Mumbai University Solved Question Papers
Artificial Intelligence
Previous Year Question Paper with Solution
BSc CS · Sem 5
Nov 2024 Examination
munotes.in
Mumbai
BSc CS Sem 5 Artificial Intelligence Nov 2024 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 Nov 2024 examination.
Contents
The questions below are the paper as the University of Mumbai set it at the Nov 2024 examination, in the order it was set.
MarksPage
MarksPage
The Paper as Set
The questions in this volume are the questions asked at the Nov 2024 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-Queens problem.[5]
Answer
For full marks, cover: the problem, the incremental formulation (all six parts), the improved formulation and its effect on the state space, the complete-state formulation used by local search, and a sample solution.
The problem
Place eight queens on an 8 x 8 chessboard so that no queen attacks another. A queen attacks along its row, its column and both diagonals. The puzzle has 92 solutions.
Incremental formulation
Queens are added one at a time to an empty board.
- States: any arrangement of 0 to 8 queens on the board.
- Initial state: the empty board.
- Actions: place a queen on any empty square.
- Transition model: Result(state, square) is the board with a queen added on that square.
- Goal test: 8 queens are on the board and no two attack each other.
- Path cost: not relevant; only the final arrangement matters. (If needed, each placement costs 1.)
This allows 64 x 63 x ... x 57, about 1.8 x 10^14, sequences, far too many to search.
Improved formulation
- States: n queens (0 <= n <= 8), one in each of the leftmost n columns, with no two attacking.
- Actions: add a queen to any square of the leftmost empty column that is not attacked.
Because illegal placements are never made, the state space falls to just 2,057 states, and a simple depth-first search finds a solution quickly.
Complete-state formulation
Local search algorithms such as hill climbing start with all 8 queens on the board, one per column, and move a queen within its column. The heuristic h is the number of attacking pairs. With all eight queens on one diagonal, every pair attacks, so h = 28; a solution has h = 0.
A solution
Reading the row of the queen in columns 1 to 8: (1, 5, 8, 6, 3, 7, 2, 4). No two share a row, and no two share a diagonal, so h = 0.
Conclusion. In the incremental 8-queens formulation, states are boards with 0 to 8 queens and the initial state is the empty board. Actions add a queen, the transition returns the new board, the goal test checks 8 non-attacking queens, and path cost does not matter. Placing queens column by column only on safe squares cuts the space from about 1.8 x 10^14 sequences to 2,057 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.