MidTerm AI PDF
MidTerm AI PDF
1 of 4
Mid‐Term Exam (Take‐Home) Fall ‐ 2020
Subject: Artificial Intelligence Submission Day: Sunday
Submission Date: 29th November 2020
Program: Computer Science Max. Marks: 25
Department of _____Computer Science_______________
Please follow the instructions carefully:
1. Write your answers in a Word file and upload the file before the due date on BlackBoard.
2. Write your name and registration ID on the first page of your Word file.
3. Answer scripts can be uploaded on BlackBoard any time before its deadline.
Therefore, do not wait for the last hour to avoid any unforeseen problems.
4. Submission of answer copy(ies) will be considered acceptable through BlackBoard
only. Therefore, do not submit your document through email or any other medium.
5. Use 12 pt. font size and Times New Roman font style along with 1-inch page margins.
6. Follow the requirements of the word limit and the marking criteria while writing your
answers
7. Provide relevant, original and conceptual answers, as this exam aims to test your ability to
examine, explain, modify or develop concepts discussed in class.
8. Do not copy answers from the internet or other sources. The plagiarism of your answers may
be checked through Turnitin.
9. Recheck your answers before the submission on BlackBoard to correct any content or
language related errors.
10. Double check your word file before uploading it on BlackBoard to ensure that you have
uploaded the correct file with your answers.
Page 1 of 4
Page 2 of 4
Your representation of the game should take into account that the grid size i.e. the
number of rows and columns would be as follows:
o number of rows >= 7
o number of columns >= 8
There could be an arbitrary number of blocks in the puzzle, however, the puzzle will
always have a solution
The puzzle could also have many solutions
You will be given the best possible solution
Every slide will cost +1
a) Describe the agent using the PEAS framework. Also describe the characteristics of the
task environment.
b) Model this game as a search problem. You have to describe the following:
i. Data structure to be used to represent the state
ii. State space
iii. Initial State
Page 2 of 4
Page 3 of 4
e) Develop two admissible heuristics for this problem. Also show that they are admissible.
f) Use the heuristics developed in part (e) to run A* search and Greedy Search to a depth =
5. Show the contents of the frontier list, and the selected node at every step.
g) Describe in your words why UCS is optimal
Page 3 of 4
Page 4 of 4
Calcudoku puzzles are similar to Sudoku, but also require some basic math skills to solve.
(https://www.calcudoku.org/en/2020-11-20/6/1)
I. the 4×4 puzzle uses the numbers 1-4, the 6×6 the numbers 1-6, and so on
II. in each row and in each column each digit can appear only once (just like in Sudoku)
III. each "cage" (the blocks with the thick border) shows a result and an operation (addition:
+, subtraction: -, multiplication: ×, or division: :). The operation applied to the numbers
in the cage should produce the result shown. Note that for subtraction and division the
order is not fixed (!)
More about this type of Sudoku can be found over the internet
https://en.wikipedia.org/wiki/KenKen. Do not worry you are not going to be asked to solve the
puzzle here. However, you are required to answer the following questions:
Page 4 of 4