BMSCOLLEGEOF ENGINEERING,BANGALORE-19

(Autonomous Institute,AffiliatedtoVTU)
Department Name: Computer Science and Engineering

INTERNALS-1
CourseCode: 20CS56PCAIP CourseTitle: Artificial Intelligence
Semester:V MaximumMarks:40 Marks Date:21/10/2020
Faculty Handling the Course: Dr. Jyothi S Nayak and Dr. Kavitha Sooda
Instructions: Internalchoiceis providedinPart C.

PART-A

Total 5 Marks (No choice)

No. Question Marks

1 Describe rational agent and its interaction with environment. 5

PART-B
Microprocessor
Total 15 Marks (No Choice, each question of 5 marks)
No. Question Marks
2.a) Differentiate utility-based agent architecture and goal-based agent architecture with 5
respect to an automated taxi driving agent.

2.b) Analyze how admissible heuristics result in optimal solution in A* Search algorithm. 5

2.c) Analyze the Breadth first search algorithm with respect to completeness, optimality, 5
time and space complexity.

PART- C

Total 20 marks (Choice between 3a or 3b and 4a or 4b)

No. Question Marks

3
Write the PEAS description for the following 10
a
3.a) i) Internet Book Shopping Agent
ii) Online Payment System
iii) Taxi Driver agent
iv) Interactive mathematics tutor.

OR
3.b) You are given two jugs, a 4-litre one and a 3-litre one. Neither has any measuring 10
markers on it. There is a pump that can be used to fill the jugs with water. How
can you get exactly 2 liters of water into 4-litre jug. Give the initial state, Goal state,
operators and path cost function for the problem. Also write the state space diagram.

4.a) Write the algorithm for Iterative Deepening Search and compare its performance 10
with DFS.
OR
4.b) Apply the Greedy Best First search algorithm for 8 Puzzle problem with Start state 10
and Goal state shown below. Also draw the states resulted from the Start state to the
Goal state.

1 2 3

4 6

7 5 8

Start state

1 2 3

4 5 6

7 8

Goal state