PGP COLLEGE OF ENGINEERING AND TECHNOLOGY, NAMAKKAL

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

CONTINOUS INTERNAL ASSESSMENT TEST I
CS3491 – Artificial Intelligence and Machine Learning
Academic Year: 2023-2024(EVEN Semester)

Year/Semester & Branch:II Year/ IV Semester &CSE

Faculty Name: G.HEMALATHA Date:12.04.2024
Max. Marks: 100 Time: 90 mins
Blooms Taxonomy
Course Outcome(s) Question Numbers
Level
CO3:Use appropriate linear/non–linear data RE -Remembering
structure operations for solving a given 1,2,3,4,5,6,7,8,9, UN-Understanding
problem. AP-Applying
AN-Analyzing
CO4: Apply appropriate graph algorithms 10,11(a),11(b),12(a),12(b)
EV-Evaluating
for graph applications. , CR-Creating

PART-A
Answer ALL Questions (5x2=10 Marks)
1. Define Artificial Intelligence?Application of AI? [UN] 2
2. What is adversial Search? [RE] 2
3. Define uncertainity and causes of uncertainity? [RE] 2
4. State Bayes Rule [UN] 2
5. Characteristics of AI [RE] 2
6. What are agents for AI and Software doing [RE] 2
7. Define Environment and Tasks of environment [RE] 2
8. Bessysian Networks or Bessiyan Interference? [RE] 2
9. Define Casual Networks [RE] 2
10. Define Intelligent Agent Structure of Intelligent agent and behaviour [AN] 2

PART-B
Answer ALL Questions (2x13=26 Marks)
11.(a) (i) Outline the uninformed search strategies like Breadth first Search [EV] (13)
and Depth First search with Example.
OR
(b) (i) State the Tree structured constraint Satisfaction problem outline the [EV] (13)
local search for Constraint the satisfaction Problem with an Example.

12.(a) (i) Elaborate on Unconditional probability and Conditional Probability (6)

with an example. [EV]
(ii) What is an beyssian Network?Explain the steps followed to construct (7)
a Beysian with an Example.
OR
(b) (i) What do you mean by Inference in Bayesian networks?Outline by [EV] (13)
enumeration with an Example
 .
13(a) (i) Explain the Min Max Algorithm and How it is works foe game in [RE] (7)
tic- tac-toe
(ii) Explain Alpha Beta Prunning Using Example (6)
OR
(b) (i) How to handle uncertain knowledge with Example and how to [RE] (13)
represent knowledge in an uncertain domain

14. (a) (i) Explain the Nature of Heuristic with an Example and What is the [AN] (13)
effect of Heuristic accuracy
OR
(b) (ii) How to define a problem in State Space Search? Discuss it with the [RE] (13)
help of an Example

15. (a) (i) Explain the various types of Agents. [EV] (6)
(ii) Explain the algorithm for steepest Hill climbing (7)
OR
(b) How many solutions are there for the map coloring problem in the [EV] (13)
below figure? How many solutions for four colors are allowed ?two

colors?a) b)

PART-C
Answer the Questions (1x14=14 Marks)
16. (a) (i) Solve the following Crypt Arithmetic Problem using Constraints
Satisfaction Search procedure [EV] (14)
CROSS
+R O A D S
--------------
DANGER
---------------
OR
(b) (i) A* Search and give the proof of Optimality of A* [AP] (7)
(ii) AO* algorithm with Example (6)
 Prepared by Approve by

(G.HEMALATHA AP/CSE)
S.NARMATHA AP/CSE ( HOD/CSE)