SRM Institute of Science and Technology

College of Engineering and Technology

School of Computing
SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamilnadu
Academic Year: 2023-24 (EVEN)
Test: CLAT-2 Date: 2nd April 2024
Course Code & Title:21CSC206T – Artificial Intelligence Duration: 2 periods
Year & Sem: II /4th Max. Marks: 50
Course Articulation Matrix:
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 1 2 - - - - - - - - - - - - -
CO2 1 2 3 - - - - - - - - - - - -
CO3 - 2 2 - - - - - - - - - - - -
CO4 1 2 - - - - - - - - - - - - -
CO5 3 2 3 - - - - - 2 - - - - - -

Part – A ( 10 x 1 = 10 Marks) Instructions: Answer ALL

Q. No Question Marks BL CO PO PI Marks
Code Scored
1 The maximum number of edges in a complete binary tree with 'n' nodes is
____________ 1 1 2 1 1.6.1
Ans: n-1
2 The time complexity of Depth Limited Search is _________, similar to Depth
First Search. 1 1 2 1 1.6.1
Ans: O(b^d)
3 If a heuristic is admissible, then A* guarantees that it will be________
1 1 2 1 1.6.1
Ans: optimal solution
4 The action of the Simple reflex agent completely depends upon __________
1 1 2 1 1.6.1
Ans: the current percept
5 Match the following:
utility-based agents Vacuum cleaner

1 1 3 2 2.7.1
goal-based agent Chess
Self-driving cars
Optimize for desired outcomes

6 Among the following, which one is least associated with Constraint Satisfaction
Problems?
● Sudoku
1 1 3 2 2.7.1
● Traveling Salesman Problem
● Map coloring problem
● Binary search
7 Which of the following statements is true about the “Flexibility and Intelligent
Agents”?
● Adaptive agents struggle to maintain consistent performance. 2.7.1
1 1 3 2
● Lack of flexibility inhibits agent responsiveness.
● Intelligent agents exhibit versatile problem-solving abilities.
● Intelligent agents are rigid in their decision-making.
8 Which of the following statements is true about the “Utility-based agents”?
1.6.1
● It always chooses the shortest path. 1 1 4 1
● It ignores costs and benefits.
 ● It prioritizes favorable outcomes
● It ignores uncertainty and risk factors
9 Which of the following statements is false about the “Knowledge-based agents”?
● Knowledge-based agents have complete and accurate information.
● Knowledge-based agents use stored information for decisions. 1.6.1
1 1 4 1
● They reason logically based on acquired knowledge.
● Knowledge-based agents exhibit intelligent behavior.

10 Which of the following statements is false about the “knowledge base building”?
● Accumulating information for comprehensive understanding.
1.6.1
● Constructing a foundation for informed decision-making. 1 1 4 1
● Knowledge base building doesn't need validation
● Organizing data to support informed decision-making
Part – B ( 3 x 8 = 24 Marks)
11 (a) Compare and contrast uninformed search methods such as Breadth First
Search (BFS), Uniform Cost Search (UCS)

BFS UCS
BFS expands nodes level by level expands nodes based on their path
costs.
explores nodes in a fixed order based prioritizes nodes with lower path
on their level. costs
generally uses more memory due to UCS has a more efficient memory
storing all nodes at each level usage pattern.
exponential time complexity in the polynomial time complexity
worst case

(OR)
(b) What is informed search? Discuss the principles behind informed
search algorithms such as Generate and Test, Best First Search, and A*
Algorithm. How do they utilize heuristic information to improve search
efficiency?

Informed Search: (2 Marks)

Informed search, also known as heuristic search, is a type of search algorithm
used in artificial intelligence that incorporates problem-specific knowledge,
known as heuristics, to guide the search process towards the most promising
areas of the search space. 8 2 2 2 2.7.1

Principles behind informed search algorithms: (3 Marks)

The key principle behind informed search algorithms lies in the use of heuristic
functions, which provide an estimate of the cost or distance from a given state to
the goal state.

By incorporating this domain-specific knowledge, informed search algorithms

can prioritize the exploration of paths that are more likely to lead to the goal,
thus avoiding the exhaustive exploration of unpromising paths.

The goal of informed search algorithms is to efficiently find optimal or

near-optimal solutions to problems with large or complex search spaces, such as
pathfinding, scheduling, and optimization tasks.

Best First Search expands nodes based on an evaluation function that estimates
the cost of reaching the goal from each node, prioritizing nodes that are closer to
the goal. However, it may not guarantee optimality.

A* Algorithm combines the advantages of both Generate and Test and Best First
Search by using a heuristic evaluation function to estimate the cost of reaching
the goal from each node and the actual cost of reaching that node from the start
state.
It selects nodes to expand based on the sum of these costs, ensuring both
efficiency and optimality in finding the shortest path to the goal.
 Heuristic information (3 Marks)
Heuristic information is utilized to improve search efficiency by guiding the
exploration of the search space towards the most promising areas likely to lead
to the goal state. Heuristic functions provide estimates of the cost or distance
from a given state to the goal state, allowing the search algorithm to prioritize
the expansion of nodes that are closer to the goal. By considering heuristic
information, the search algorithm can make informed decisions about which
paths to explore next, effectively pruning unpromising branches of the search
tree and focusing its efforts on those that are more likely to lead to a solution.
This targeted exploration of the search space reduces the time and memory
required to find a solution, making informed search algorithms more efficient
than uninformed search algorithms, especially in large and complex problem
domains.

12 (a) Explain the term "Rational Agent" in the context of intelligent agents.
Discuss the criteria for evaluating the rationality of an agent.
Rational Agent: (2 Marks)
A rational agent is an intelligent entity or system that acts to achieve the best
outcome or maximize its expected utility based on the available information
and its goals or objectives. The term "rational" in this context refers to the
agent's ability to make decisions that are in line with its goals, given its
knowledge and beliefs about the world.

Flexibility and Intelligent Agents (6 Marks)

Responsive: It should respond in timely fashion to the

perceived environment.

Pro-active: It should exhibit opportunistic, goal-directed

behaviour and take the initiative, wherever necessary.

Social: It should be able to interact when they are deemed

appropriate with the other artificial agents, or humans in order
to compete problem solving.

Other properties an intelligent agent should have are as

follows:

Mobility: It is recommended that an intelligent agent should

be mobile to accumulate knowledge and carry out desired 8 2 3 2 2.7.1
work/ decision-making.

Veracity: Intelligent agent should be truthful. It is not expected

to hide information or lie.
Benevolence: It should avoid conflict and should do what is
told.
Rationality: It should act to maximise the expected
performance.
Learning: Performance is increased with learning. It should
have learning ability that is essential for true autonomy.

(OR)
(b) Explain the concept of performance measures in the context of
intelligent agents. Discuss how performance measures relate to the rationality of
an agent.
● Performance Measure (3 Marks)
● Rationality and Performance (3 Marks)
● Sample Examle: (2 Marks)
rationality in case of automatic car is that the car is
expected to slow down when the signal is yellow and
should stop if the signal is red.
13 (a) Discuss the different types of inferences and reasoning patterns used in
propositional logic. Provide scenarios where each type of inference is applicable.

Inferences(3 Marks)

Reasoning patterns used in propositional logic(5 Marks)

8 2 4 2 2.7.1
(OR)
(b) Compare and contrast forward chaining and backward chaining as
inference mechanisms in propositional logic. Provide examples to illustrate their
differences.
Forward chaining(3 Marks)
Backward chaining(3 Marks)
Examples (2 Marks)
Part – C ( 1 x 16 = 16 Marks)
14 Describe the PEAS for the Wumbus world problem. Write the step by step
process that allows the agent to reach out the gold cell in the grid given below.

16 3 4 2 2.8.1

15 Solve the following crypto arithmetic puzzle to find the value of

E+N+E+R+G+Y If POINT + ZERO = ENERGY

5-digit number + 4-digit number = 6-digit number

4-digit number + 5-digit number = 6-digit number

So E = 1, P = 9, N = 0 Observe R + 0 = G. But R = G not possible. 1 + R = G

possible.

So R and G are consecutive.

G > R.1 + I = R
16 3 2 2 2.8.1
So I and Rare consecutive.

R > I. i.e., G > R > I. and G, R, I are consecutive.

Now O + T should give carry over and O + Z also give carry over.

So O is bigger number. Now take values for G, R, I as 8, 7, 6 or 7, 6, 5 etc. and

do trial and error.

POINT = 98504, ZERO = 3168 and ENERGY = 101672.

So E + N + E + R + G + Y = 1 + 0 + 1 + 6 + 7 +2 = 17

Total (50)
Course Outcome (CO) and Bloom’s Level (BL) Coverage in Questions

Approved by the
Course Coordinator Audit Professor