Mumbai University Solved Question Papers
Artificial Intelligence
Previous Year Question Paper with Solution
BSc CS · Sem 5
Oct 2025 Examination
munotes.in
Mumbai
BSc CS Sem 5 Artificial Intelligence Oct 2025 Question Paper with Solutions
Get access to whole semester resourcesSemester Pass
MU B.Sc. (Computer Science) student group
Free to join
First published on munotes.in on 17 October 2026.
Published by munotes.in, Mumbai.
Model answers written and edited by the munotes.in editorial desk.
Passages from this volume may be quoted, in print, online or by an AI system, with credit: name munotes.in and link to this volume's page. The volume may not be reproduced as a whole. Full terms at munotes.in/content-license.
munotes.in is an independent study resource for students of the University of Mumbai. It is not affiliated with the University of Mumbai, and is not endorsed by it.
The University does not publish an official answer key for this paper. The answers in this volume are model answers, written to show how a full-mark answer is built. They are a study aid, not an authority on what an examiner marked.
The question paper reproduced here is the paper as set by the University of Mumbai at the Oct 2025 examination.
Contents
The questions below are the paper as the University of Mumbai set it at the Oct 2025 examination, in the order it was set.
MarksPage
MarksPage
The Paper as Set
The questions in this volume are the questions asked at the Oct 2025 examination, reproduced as the University of Mumbai set them, in the order it set them. Nothing has been reworded, added or left out. Only the answers are ours. See the original question paper.
Duration 2½ hours · Total marks 75 · 24 questions answered
Instructions printed on the paper
- N.B. (1) All questions are compulsory. (2) Figures to the right indicate marks. (3) Illustrations, in-depth answers and diagrams will be appreciated. (4) Mixing of sub-questions is not allowed.
How to use this volume
Solve the paper first, under exam conditions and against the clock. Then read the answers here and mark your own. Reading a solution before attempting the question feels productive and teaches very little, because recognising an answer is not the same as being able to write one.
SECTION I
Q.1
Attempt ANY FOUR from the following · 20 Marks
(a)Write States, Initial States, Actions, Transition Model, Goal Test and Path Cost for 8-puzzle problem.[5]
Answer
For full marks, cover: the puzzle itself with a board, each of the six parts of the formulation stated precisely, the size of the state space, and why the formulation matters for search.
The 8-puzzle
The 8-puzzle is a 3 x 3 board with eight numbered tiles and one blank square. A tile next to the blank can slide into it. The aim is to reach a given goal arrangement, for example:
| blank | 1 | 2 |
| 3 | 4 | 5 |
| 6 | 7 | 8 |
To solve it with a search algorithm, it must first be written as a well-defined problem.
Formulation
- States: a state says where each of the eight tiles and the blank is on the nine squares.
- Initial state: any arrangement can be the start. Only half of all arrangements can reach a given goal, because the tile moves preserve a parity property.
- Actions: it is simplest to think of the blank moving: Left, Right, Up or Down. An action is allowed only if it keeps the blank on the board, so a corner blank has 2 actions, an edge blank 3 and the centre blank 4.
- Transition model: given a state and an action, it returns the new state with the blank and the neighbouring tile swapped. For example, moving the blank Left from the centre puts the tile that was on the left into the centre.
- Goal test: checks whether the state matches the goal arrangement.
- Path cost: each move costs 1, so the path cost is the number of moves.
Size of the problem
There are 9! = 362,880 arrangements, but only 9!/2 = 181,440 are reachable from any one state. That is small enough for a computer to search completely. The 15-puzzle (4 x 4) has about 10^13 reachable states, so it needs good heuristics.
Why the formulation matters
The formulation decides what the search algorithm explores. Describing actions as moves of the blank gives at most four actions per state instead of a separate action for every tile. The 8-puzzle is the standard test problem for heuristics such as misplaced tiles and Manhattan distance.
Conclusion. In the 8-puzzle, a state gives the positions of the eight tiles and the blank, and any arrangement can be the initial state. The actions are blank moves: Left, Right, Up and Down. The transition model swaps the blank with a neighbour, the goal test compares with the goal board, and each move costs 1. It has 181,440 reachable states.
The rest of the answers
The first answer is free. The rest come with the B.Sc. (Computer Science) Semester 5 solved papers.
You have read the question paper and its first answer in full. Buy the solved papers once and you can read every answer of every solved paper in this semester.
Notes + practical solutions + solved papers: ₹798 Already bought it? Sign in
Or solved papers only: ₹499
Or notes + practical solutions: ₹499
The question paper itself stays free, and so does the syllabus.
Found an error in this volume? Report it and we will check it against the paper.