Roll No:………………

Name:…………………
MOHANDAS COLLEGE OF ENGINEERING AND TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Seventh Semester B.Tech
First Series Test October 2023
Course Code: CST 401
Course Name: Artificial Intelligence

Time: 2 Hours Max. Marks: 50

PART-A

Answer all questions. Each question carries 3 marks (15 Marks)

Qn.
Questions Marks CO K
No.
1 Describe in detail the four categories under which AI is classified with. 3 CO 1 2

2 What is a rational agent? Explain. 3 CO 1 2

3 Differentiate between informed search and uninformed search. 3 CO 2 2
4 How do you evaluate the performance of a search algorithm? 3 CO 2 2
Explain the terms adversarial search and pruning in the gaming
5 3 CO 3 2
environment of AI.

PART-B
Qn.
Questions Marks CO K
No.
Explain the structure Goal-based agents and Utility-based agents with the help
6.a 8 CO 1 2
of diagrams.

6.b Discuss about any five applications of AI 6 CO 1 2

OR

Explain Turing Test approach and Cognitive modelling approach in terms of

7.a 8 CO 1 2
Artificial Intelligence.
For the following activities, give a PEAS description of the task environment
and characterize it in terms of the task environment properties.
7.b 6 CO 1 2
a)Automated Taxi
b)Satellite Image Analysis System
(Note: Question 6,7,8 and 9 - 14 Marks, Question 10 and 11 – 7 Marks)

P.T.O
Qn.
Questions Marks CO KL
No.

Explain Best First Search algorithm. How does it implement

8.a 8 CO 2 2
heuristic search?
Discuss the heuristic function. Explain how the heuristic function helps
8.b 6 CO 2 2
during search procedure.Explain with a suitable example
OR
State the different conditions for optimality for A* search.
9.a 8 CO 2 2
Explain A * search with an example

Explain the components of a well defined AI problem? Write the two

9.b 6 CO 2 2
methods to solve 8-Queens problem.

10.a Illustrate the working of Minimax search procedure with an example. 7 CO 3 2

OR
How and when heuristic is used in Minimax search technique? Illustrate
10.b 7 CO 3 2
with an example. Also describe an algorithm for Minimax procedure.