JAYARAJ ANNAPACKIAM CSI COLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi, Accredited by NBA(CSE) and Affiliated to Anna University)
MARGOSCHIS NAGAR, NAZARETH – 628 617
DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE
ACADEMIC YEAR 2025-2026 (ODD SEM)
CONTINUOUS ASSESSMENT TEST – I
SET-2
Dept./Year/Sem.: ADS/II/03 Date: 23.09.25
Course Code & Name: AL3391-ARTIFICIAL INTELLIEGENCE Session: AN
Course In-charge: Mrs. N, JENIFER LINCY Duration: 1 ½ Hours.
Max. Marks: 50
Course Outcomes:
CO1: Explain Intelligent agent frameworks
CO2: Apply Problem solving techniques
CO3: Apply Game playing and CSP techniques
CO4: Perform Logical reasoning
CO5: Perform Probabilistic reasoning under uncertainty
PART-A (Answer all questions) 5 x 2 = 10 Marks
Q. Questions Blooms Course Marks
No. Level Outcome
1. Define AI and write the applications of AI. UNDERSTAND CO 1
2. List the steps involved in simple problem-solving technique. UNDERSTAND CO 1
3. What is heuristic function? REMEMBER CO 2
4. What is the purpose of a contingency plan? REMEMBER CO 2
5. Given 2 jugs of capacities 5 litres and 3 litres with no measuring APPLY CO 3
markers on them. Assume that there is endless supply of water.
What is the minimum number of states to measure 4 litres of
water.
PART-B 4 x 7 = 28 Marks
Q. Questions Blooms Course Marks
No. Level Outcome
10. a) List the basic kinds of intelligent agents and explain any two
agents with the neat schematic diagram.
(or) UNDERSTAND CO 1
b) What is heuristic search technique in AI? How does Heuristic
Search Technique works? Explain its advantages and
disadvantages. CO 2
11. a) Define the “Towers of Hanoi Problem” and explain what type
of control strategy is used? APPLY
(or) CO 1
b) Enumerate “8 Queens Problem”. Describe the state space for
the problem and also give the solution.
12. a) Describe the local search algorithm.
(or) UNDERSTAND CO 2
b) How does online search agent works in an unknown
environment?
13. a) Give the Outline of min max Algorithm with an example.
UNDERSTAND CO 3
(or)
b) Consider the search graph shown below in Fig. For each of the
following search strategies, give the path that would be returned
and the pseudocode for the same.
iv. Depth-first graph search
v. Breadth -first graph search
vi. Uniform cost graph search
APPLY
CO 2
.
PART-C 1 x 12 = 12 Marks
11 Solve the following Crypt Arithmetic Problem using Constraint
Satisfaction search procedure APPLY
SAVE + MORE = MONEY CO 3
TOTAL