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 - - - - - -

Mark
Q. PI
Question Marks BL CO PO
No Code Scored
Part – A ( 10 x 1 = 10 Marks) Instructions: Answer ALL
___________data structure is suitable for implementing Breadth-First Search
1 (BFS) 1 1 2 1 1.6.1
Ans: Queue
Uniform Cost Search uses a data structure called a _________ queue to prioritize
2 the nodes for expansion 1 1 2 1 1.6.1
Ans: Priority
Best First Search is an informed search algorithm that selects the node for
3 expansion based on _________. 1 1 2 1 1.6.1
Ans: heuristic function value
The task environment of an agent is described by ____________
4 Ans: performance measures, sensors, actuators, and environment 1 1 2 1 1.6.1
(OR) PESA
Match the following:
Agents behavior Architecture and Program
Rational agent right thing 2.7.1
5 1 1 3 2

Which of the following is the odd one out?

● Reflex Agent 2.7.1
6 ● Model-based Agent 1 1 3 2
● Utility-based Agent
● Random Agent
Which of the following statements is true about the “Mini Max Algorithm”?
● It is not a backtracking algorithm.
● It performs a Breath first search algorithm for the exploration of the complete
2.7.1
7 game tree. 1 1 3 2
● It proceeds down to the terminal node of the tree, and then backtracks the tree
as the recursion.
● It is used in multiple-player games.
Which of the following statements is true about the “Simple Reflex agent”?
● This agent only succeeds in the partially observable environment.
● This agent considers any the percept history during their decision and action 1.6.1
8 1 1 4 1
process.
● This agent works on the condition-action rule, which means it maps the current
state to action.
 ● It is adaptive to changes in the environment.
Which of the following statements is false about the “Forward and Backward
Chaining”?
● Forward chaining infers conclusions from premises. 1.6.1
9 1 1 4 1
● Backward chaining starts with the goal and progresses.
● Backward chaining not is goal-oriented.
● Forward chaining is data-driven.
Which of the following statements is false about the “Inferences”?
● Observations lead to accurate inferential conclusions.
1.6.1
10 ● Contextual clues assist in making inferences. 1 1 4 1
● Inferences facilitate deeper comprehension of texts.
● Invalid inferences align with available information.
Part – B ( 3 x 8 = 24 Marks)
(a) Describe the basic idea behind Uniform Cost Search (UCS) and explain how
it differs from other uninformed search algorithms such as Breadth-First
Search (BFS) and Depth-First Search (DFS). Provide an example to illustrate
the working of UCS.

Idea behind UCS: (2 Marks)

In this algorithm from the starting state, we will visit the adjacent states and
will choose the least costly state then we will choose the next least costly
state from the all un-visited and adjacent states of the visited states, in this
way we will try to reach the goal state (note we won’t continue the path
through a goal state ), even if we reach the goal state we will continue
searching for other possible paths( if there are multiple goals). We will keep a
11 priority queue that will give the least costly next state from all the adjacent
8 3 2 2 2.7.1
states of visited states.
Differences (2 Marks)
Example(4 marks)

(OR)
(b) Explain the working principle of Breadth First Search (BFS) algorithm.
Provide a step-by-step illustration with the help of a sample graph.

Algorithm (4 Marks)
Example (4 Marks)

(a) Discuss the different types of agents commonly encountered in artificial

intelligence. Provide examples of each type.
(b) Simple reflex agents (2 Marks)
(c) Model-based reflex agents (2 Marks)
(d) Goal-based agents (2 Marks)
(e) Utility-based agents(2 Marks)
(OR)
(f) COOK + MORE = BAKER
Each letter represents a unique digit from 0 to 9.
Solve for the values of C, O, K, M, R, B, A, E to make the equation valid.

1. From O+O=KO+O=K, we can rewrite it as 2O=K2O=K, which means

KK is even.
2. Substituting KK with 2O2O in K+E=RK+E=R, we get
2O+E=R2O+E=R.
12 3. Substituting KK with 2O2O in O+R=EO+R=E, we get 8 3 3 2 2.7.1
O+2O=EO+2O=E.

Let's solve these equations:

From O+O=KO+O=K, we get K=2OK=2O. Since KK is even, OO must be an

even digit. Let's try O=2O=2:

1. K=2O=2×2=4K=2O=2×2=4

Substituting O=2O=2 into the second equation, we get 2×2+E=R2×2+E=R, which

simplifies to 4+E=R4+E=R.

Substituting O=2O=2 into the third equation, we get 2+4=E2+4=E, which

simplifies to 6=E6=E.
 Now, we have E=6E=6, K=4K=4, and R=4+6=10R=4+6=10, which is not
possible because RR must be a single digit.

Let's try O=4O=4:

1. K=2O=2×4=8K=2O=2×4=8

Substituting O=4O=4 into the second equation, we get 2×4+E=R2×4+E=R, which

simplifies to 8+E=R8+E=R.

Substituting O=4O=4 into the third equation, we get 4+8=E4+8=E, which

simplifies to 12=E12=E, which is not possible because EE must be a single digit.

Since neither O=2O=2 nor O=4O=4 work, there's no integer solution that satisfies
all three equations simultaneously.

So that you can not make a unique number to all the letters.
one of the solution : B=1 and R=1
1443

7412
_________

1 5 4 3 1​

(a) Discuss the challenges associated with representing knowledge in AI systems.

How do different knowledge representation techniques address these
challenges?
Challenges:
1. Ambiguity: Handling information with multiple meanings or
interpretations.
2. Incompleteness: Dealing with partial or missing knowledge.
3. Scalability: Managing vast amounts of data and knowledge.
4. Inference: Enabling machines to reason and draw conclusions from
knowledge.

Different knowledge representation techniques

1. Declarative Knowledge:

● Declarative knowledge is to know about something.

● It includes concepts, facts, and objects.
● It is also called descriptive knowledge and expressed in
declarativesentences.
● It is simpler than procedural language.
13 8 2 4 2 2.7.1
2. Procedural Knowledge

● It is also known as imperative knowledge.

● Procedural knowledge is a type of knowledge which is responsible for
knowing how to do something.
● It can be directly applied to any task.
● It includes rules, strategies, procedures, agendas, etc.
● Procedural knowledge depends on the task on which it can be applied.

3. Meta-knowledge:

● Knowledge about the other types of knowledge is called

Meta-knowledge.

4. Heuristic knowledge:

● Heuristic knowledge is representing knowledge of some experts in a filed

or subject.
 ● Heuristic knowledge is rules of thumb based on previous experiences,
awareness of approaches, and which are good to work but not
guaranteed.

5. Structural knowledge:

● Structural knowledge is basic knowledge to problem-solving.

● It describes relationships between various concepts such as kind of, part
of, and grouping of something.
● It describes the relationship that exists between concepts or objects.

(OR)
(b) Explain the Wumpus World environment and how knowledge representation is
used to model it. Illustrate your answer with examples.
Answer Key:
Description for Wumpus World environment (PEAS)(4 Marks)
Example (4 Marks)

Part – C ( 1 x 16 = 16 Marks) Instructions: Answer any ONE

Consider a scenario where you are implementing a chess-playing AI using the
minimax algorithm with alpha-beta pruning. The AI evaluates potential moves in
a particular game state, and you have implemented the alpha-beta pruning
algorithm to improve the efficiency of the search.
In a specific branch of the game tree, the AI is currently evaluating a node with a
depth of 3. The alpha value at the parent node is 2, and the beta value is 5. During
the evaluation of the child nodes, the AI finds that the alpha value at one of the
child nodes is 4.
(a) Describe how alpha-beta pruning would affect the further exploration of
the sibling nodes.
(b) Explain whether the AI would continue to evaluate the sibling nodes in
this scenario or if any nodes would be pruned. Justify your answer.
Answer Key:
In the scenario described, the AI is currently evaluating a node with a depth of 3
in the game tree, and the alpha-beta pruning algorithm is applied. The parent node
has an alpha value of 2 and a beta value of 5. During the evaluation of one of the
child nodes, the AI finds that the alpha value at this child node is 4.

In alpha-beta pruning, the alpha value represents the best (highest) value that the
maximizing player (AI) has found so far along the path to the root, while the beta
value represents the best (lowest) value that the minimizing player (opponent) has
found so far along the path to the root.
14 16 3 3 2 2.8.1
Since the alpha value at the child node is 4, it means that the maximizing player
(AI) has found a move that leads to a value of at least 4. Since alpha represents the
best value found so far, it is updated to 4 at this child node.

Now, consider the implications for exploring the sibling nodes:

1. If the sibling nodes are maximizing nodes (AI's moves), then the AI
would be interested in finding moves that improve its position further.
Since the alpha value at the current node is 4, and it represents the best
value found so far for the maximizing player, any sibling node with a
beta value less than or equal to 4 (i.e., worse than the current best move)
can be pruned. This is because the opponent would not choose a move
that leads to a worse outcome for the AI than it has already found.
2. If the sibling nodes are minimizing nodes (opponent's moves), then the
opponent would be trying to minimize the AI's score. Since the beta
value at the parent node is 5, representing the best value that the
opponent has found so far, any sibling node with an alpha value greater
than or equal to 5 (i.e., better for the AI than the best move found so far
by the opponent) can be pruned. This is because the opponent would not
choose a move that leads to a better outcome for the AI than it has
already found.
 You are developing an AI system to find the shortest path for a delivery robot
navigating through a city grid given below with varying terrain costs. Describe
how you would implement the A* Search algorithm for this scenario, considering
factors such as heuristic functions, node expansion, and path cost evaluation.

15 16 3 2 2 2.8.1
 Total (50)
Course Outcome (CO) and Bloom’s level (BL) Coverage in Questions

Approved by the
Course Coordinator Audit Professor