B.M.S.

COLLEGE OF ENGINEERING, BANGALORE-19

(Autonomous Institute, Affiliated to VTU)
Department Name: Computer Science and Engineering
INTERNALS-1
Course Code : 20CS56PCAIP Course Title : Artificial Intelligence
Semester : V Maximum Marks: 40 Date: 21/10/2020
Faculty Handling the Course: Dr. Jyothi S Nayak and Dr. Kavitha Sooda
Instructions: Instructions: Internal choice is provided in Part C.

PART –A (5 marks)

No. Question Marks

1 “Surely computers cannot be intelligent—they can do only what their programmers 5
tell them.” Is the latter statement true, and does it imply the former?

PART –B (15 marks)

No. Question Marks

2.a) 5

Find the most cost-effective path to reach from start state ‘A’ to final state
‘J’ by applying A* Algorithm. The numbers written on edges represent the
distance between the nodes. The numbers written on nodes represent the
heuristic value. Note since ‘J’ is the destination node, the heuristic value =0.
2.b) Implement a Utility based agent for the vacuum environment. Assume that initially 5
the environment with this agent has all possible square as dirty.

2.c) Provide the standard formulation for 8-queens problem, 5

(i). if queen placed initially at random,
(ii). If queen placed the top left most position initially
Discuss the state space reduction in case (i) and (ii)
 PART –C (20 marks)

No. Question Marks

3.a) The missionaries and cannibals problem is usually stated as follows. Three 10
missionaries and three cannibals are on one side of a river, along with a boat that
can hold one or two people. Find a way to get everyone to the other side without
ever leaving a group of missionaries in one place outnumbered by the cannibals in
that place.
i. Formulate the problem precisely, making only those distinctions necessary to
ensure a valid solution.
ii. Why do you think people have a hard time solving this puzzle, given that the
state space is so simple?
OR
3.b) 10

Discuss the Frontier queue style, Whether it is complete and optimal? What
is the time and space complexity? How is it better than Breadth first search?
4.a) 10

Apply recursive Best first search and discuss the properties with respect to
completeness and optimality? Consider Pitesti’s SLD as 100.

OR
4.b) Write the PEAS Description for: 10
i. Part Picking Robot
ii. Satellite Image analysis System
iii. Taxi Driver
iv. Medical Diagnosis system