Figure from the original question paper

(A) Printed graph sheets were provided on time.

(B) Printed graph sheets were provided late.

(C) Printed graph sheets were not provided.

(E) I did not use graph sheets.

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below. Consider the following planning problem. Based on the above data, answer the given subquestions. Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr In the planning graph, which of the following are mutex action pairs in layer 1?

(C) Stack(D,E) and nop for holding(D)

(A) Stack(D,E) and nop for armEmpty

(B) Stack(D,E) and nop for clear(C)

AI Search Methods End Term PYQ Jan 2026: 10 May 2026 (Set 2)

Question 1

+1 markOne or more correct options

Select all that apply.

A
Printed graph sheets were provided on time.
B
Printed graph sheets were provided late.
C
Printed graph sheets were not provided.
D
I used the graph sheets.
E
I did not use graph sheets.

Show answer

Correct answers

A
Printed graph sheets were provided on time.
D
I used the graph sheets.

Question 1 on its own page

Question 2

+1 markWritten answer

SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encoded as a digit string ABC, denotes volume of water in jugs a, b and c, respectively. For example, state 122 denotes that jugs a, b and c contain 1L, 2L and 2L of water, respectively.

MoveGen takes a state ABC and returns a set of neighbours that are one move away from ABC. For example, MoveGen(122) = { 032, 302, 320, 131 }. Based on the above data, answer the given subquestions.

Let 212 be the start state and 131 be the goal state, find the shortest path from start to goal. Enter the path starting with 212 as a comma separated list of states. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 212,230,500 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 2 on its own page

Question 3

+1 markWritten answer

SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encoded as a digit string ABC, denotes volume of water in jugs a, b and c, respectively. For example, state 122 denotes that jugs a, b and c contain 1L, 2L and 2L of water, respectively.

MoveGen takes a state ABC and returns a set of neighbours that are one move away from ABC. For example, MoveGen(122) = { 032, 302, 320, 131 }. Based on the above data, answer the given subquestions.

Let 212 be the start state and 131 be the goal state, find the sequence of moves that produce the shortest path from start to goal. Enter the sequence of moves as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: aEb,aTc,bETa,cETb Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 3 on its own page

Question 4

+1 markOne correct option

SEARCH ALGORITHMS Answer the given subquestions.

Under what cases does Depth First Iterative Deepening (DFID) guarantee to find the shortest path if one exists?

A
When it inspects only new nodes.
B
When it inspects new as well as open nodes.
C
When it inspects new as well as closed nodes.
D
None of these

Show answer

Correct answer

C
When it inspects new as well as closed nodes.

Question 4 on its own page

Question 5

+1 markOne or more correct options

SEARCH ALGORITHMS Answer the given subquestions.

Given a finite state space with unit edge costs, and a heuristic function whose properties are not known, which of the following algorithms are suitable for finding the optimal path?

Select all that apply.

A
Depth First Search
B
Breadth First Search
C
Dijkstra's algorithm
D
Branch and Bound Search
E
A*
F
WA* for some w
G
Sparse Memory Graph Search (SMGS)

Show answer

Correct answers

B
Breadth First Search
C
Dijkstra's algorithm
D
Branch and Bound Search

Question 5 on its own page

Question 6

+1 markOne or more correct options

SEARCH ALGORITHMS Answer the given subquestions.

If w is set to a large value (tending to infinity) then wA* algorithm will __________ .

Select all that apply.

A
behave like Best-First Search
B
behave like Dijkstra's algorithm
C
guarantee an optimal path if h is admissible
D
not guarantee an optimal path even if h is admissible

Show answer

Correct answers

A
behave like Best-First Search
D
not guarantee an optimal path even if h is admissible

Question 6 on its own page

Question 7

+1 markWritten answer

GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the subtree shown in the figure.

Each leaf node A to D takes a UNIQUE EVAL VALUE from the set {1, 2, 3, 4}. Alpha-Beta algorithm is entering the subtree with alpha=1 and beta=3; find an optimal eval assignment (for nodes A to D) that maximizes the number of leaves pruned; find the minimax value, the type of cuts and the leaves pruned for that assignment. Based on the above data, answer the given subquestions.

Enter the optimal eval assignment (evals of nodes A to D) in the text box. Enter a comma separated list of evals. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 1,2,3,4 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 7 on its own page

Question 8

+1 markWritten answer

GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the subtree shown in the figure.

Each leaf node A to D takes a UNIQUE EVAL VALUE from the set {1, 2, 3, 4}. Alpha-Beta algorithm is entering the subtree with alpha=1 and beta=3; find an optimal eval assignment (for nodes A to D) that maximizes the number of leaves pruned; find the minimax value, the type of cuts and the leaves pruned for that assignment. Based on the above data, answer the given subquestions.

The minimax value of the subtree for the optimal eval assignment is __________ . Enter an integer. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.

Show answer

A written answer, not marked automatically.

Question 8 on its own page

Question 9

+1 markWritten answer

GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the subtree shown in the figure.

Each leaf node A to D takes a UNIQUE EVAL VALUE from the set {1, 2, 3, 4}. Alpha-Beta algorithm is entering the subtree with alpha=1 and beta=3; find an optimal eval assignment (for nodes A to D) that maximizes the number of leaves pruned; find the minimax value, the type of cuts and the leaves pruned for that assignment. Based on the above data, answer the given subquestions.

Enter the number of alpha-cuts followed by the number of beta-cuts as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 1,2 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 9 on its own page

Question 10

+1 markWritten answer

GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the subtree shown in the figure.

Each leaf node A to D takes a UNIQUE EVAL VALUE from the set {1, 2, 3, 4}. Alpha-Beta algorithm is entering the subtree with alpha=1 and beta=3; find an optimal eval assignment (for nodes A to D) that maximizes the number of leaves pruned; find the minimax value, the type of cuts and the leaves pruned for that assignment. Based on the above data, answer the given subquestions.

Enter the label of leaf nodes pruned by Alpha-Beta algorithm, or enter NIL if no leaves were pruned. Enter a comma separated list of labels (A to D), or enter NIL. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: W,X,Y,Z Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 10 on its own page

Question 11

+1 markWritten answer

GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes are labeled from A to J. Where applicable, use these labels in short answers. Tie-breaker: When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.

Run SSS* algorithm on the game tree, then answer the sub-questions.

Find the horizon nodes that are assigned SOLVED status by SSS* algorithm. Enter the labels of those nodes in the textbox, or enter NIL if no nodes are assigned SOLVED status. Enter node labels as a comma separated list in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 11 on its own page

Question 12

+1 markWritten answer

GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes are labeled from A to J. Where applicable, use these labels in short answers. Tie-breaker: When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.

Run SSS* algorithm on the game tree, then answer the sub-questions.

Find the SOLVED horizon nodes that are pruned from the queue by SSS* algorithm, i.e., SOLVED horizon nodes removed from the queue when a MAX-ancestor is SOLVED. Enter the labels of those nodes in the textbox, or enter NIL if SOLVED nodes were never pruned. Enter node labels as a comma separated list in alphabetical order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 12 on its own page

Question 13

+1 markWritten answer

PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are uniquely identified by labels (S, A, B, C, …). Each node shows the heuristic estimate of the cost of solving that node. Nodes shown in double lines are primitive nodes and their values are actual costs. A primitive node is added to the graph, with SOLVED status, when its parent is expanded. And therefore, a primitive node is never expanded. The cost of each edge is 2 units. Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the sub-questions.

List the nodes expanded by AO* algorithm. List the nodes in the order they are expanded. Observe that primitive nodes are not expanded. Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 13 on its own page

Question 14

+1 markWritten answer

PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are uniquely identified by labels (S, A, B, C, …). Each node shows the heuristic estimate of the cost of solving that node. Nodes shown in double lines are primitive nodes and their values are actual costs. A primitive node is added to the graph, with SOLVED status, when its parent is expanded. And therefore, a primitive node is never expanded. The cost of each edge is 2 units. Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the sub-questions.

For each node expanded by AO* algorithm, determine the value propagated to the start node S. Enter the values of S as a list. Enter a comma separated list of numbers. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 12,42,17 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 14 on its own page

Question 15

+1 markOne correct option

PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are uniquely identified by labels (S, A, B, C, …). Each node shows the heuristic estimate of the cost of solving that node. Nodes shown in double lines are primitive nodes and their values are actual costs. A primitive node is added to the graph, with SOLVED status, when its parent is expanded. And therefore, a primitive node is never expanded. The cost of each edge is 2 units. Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the sub-questions.

What can you conclude about the given AND-OR decomposition?

A
The heuristic is admissible.
B
The heuristic is inadmissible.
C
The heuristic is sometimes admissible and sometimes inadmissible.

Show answer

Correct answer

A
The heuristic is admissible.

Question 15 on its own page

Question 16

+1 markOne or more correct options

RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the figure. The labels A1, A2, ..., A10, A16, ..., B1, B2, B3, R1, …, R4 uniquely identify the nodes in the network. When required, use the above label ordering to break ties and to enter short answers. Note: "attribute <> x" is true when that attribute exists and its value is not equal to x.

Run the Rete algorithm for the Working Memory shown below, the WMEs are in timestamp order. Assume that WMEs reside at appropriate Alpha nodes, and the Beta nodes point to WMEs residing in Alpha nodes.

For each WME identify its location (node label) in the Rete Net, and prepare the conflict set for the first cycle, then answer the sub-questions.

RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the fig

Which of the following rule-data tuples are in the conflict-set?

Select all that apply.

A
R1,107
B
R2,102,104
C
R3,103,106
D
R4,101,105
E
R2,102,103
F
R3,104,106

Show answer

Correct answers

A
R1,107
B
R2,102,104
C
R3,103,106
D
R4,101,105

Question 16 on its own page

Question 17

+1 markOne or more correct options

RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the figure. The labels A1, A2, ..., A10, A16, ..., B1, B2, B3, R1, …, R4 uniquely identify the nodes in the network. When required, use the above label ordering to break ties and to enter short answers. Note: "attribute <> x" is true when that attribute exists and its value is not equal to x.

Run the Rete algorithm for the Working Memory shown below, the WMEs are in timestamp order. Assume that WMEs reside at appropriate Alpha nodes, and the Beta nodes point to WMEs residing in Alpha nodes.

For each WME identify its location (node label) in the Rete Net, and prepare the conflict set for the first cycle, then answer the sub-questions.

If the Inference Engine uses Specificity as the conflict resolution strategy then which of the following rule-data tuples will qualify?

Select all that apply.

A
R1,107
B
R2,102,104
C
R3,103,106
D
R4,101,105
E
R2,102,103
F
R3,104,106

Show answer

Correct answers

C
R3,103,106
D
R4,101,105

Question 17 on its own page

Question 18

+1 markOne correct option

RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the figure. The labels A1, A2, ..., A10, A16, ..., B1, B2, B3, R1, …, R4 uniquely identify the nodes in the network. When required, use the above label ordering to break ties and to enter short answers. Note: "attribute <> x" is true when that attribute exists and its value is not equal to x.

Run the Rete algorithm for the Working Memory shown below, the WMEs are in timestamp order. Assume that WMEs reside at appropriate Alpha nodes, and the Beta nodes point to WMEs residing in Alpha nodes.

For each WME identify its location (node label) in the Rete Net, and prepare the conflict set for the first cycle, then answer the sub-questions.

If the Inference Engine uses Recency as the conflict resolution strategy then which of the following rule-data tuples will qualify?.

A
R1,107
B
R2,102,104
C
R3,103,106
D
R4,101,105
E
R2,102,103
F
R3,104,106

Show answer

Correct answer

A
R1,107

Question 18 on its own page

Question 19

+1 markOne or more correct options

AUTOMATED PLANNING 1 Answer the given subquestions.

Consider actions a and b and the two orderings (a then b) and (b then a). Which of the following conditions (each taken independently) will make both of the orderings feasible?

Select all that apply.

A
P is in pre(a) and also in pre(b).
B
P is in del-effects(a) and also in del-effects(b).
C
None of these.

Show answer

Correct answers

A
P is in pre(a) and also in pre(b).
B
P is in del-effects(a) and also in del-effects(b).

Question 19 on its own page

Question 20

+1 markOne or more correct options

AUTOMATED PLANNING 1 Answer the given subquestions.

In planning graphs constructed by GraphPlan, actions a and b in layer n are mutex __________ .

Select all that apply.

A
if P in pre(a) and Q in pre(b) are mutex
B
if P is in pre(a), in del-effects(a), in pre(b) and also in del-effects(b)
C
only if every P in pre(a) is also present in del-effects(b)
D
only if every P in add-effects(a) is also present in del-effects(b)

Show answer

Correct answers

A
if P in pre(a) and Q in pre(b) are mutex
B
if P is in pre(a), in del-effects(a), in pre(b) and also in del-effects(b)

Question 20 on its own page

Question 21

+1 markOne or more correct options

AUTOMATED PLANNING 1 Answer the given subquestions.

In planning graphs constructed by GraphPlan, which of the following are true?

Select all that apply.

A
If propositions P and Q are non mutex in layer zero then it will remain non mutex in all future layers.
B
If propositions P and Q are non mutex in a layer n then it will remain non mutex in all future layers.
C
If propositions P and Q are non mutex in a layer n then it can become mutex in a future layer.
D
None of these.

Show answer

Correct answers

A
If propositions P and Q are non mutex in layer zero then it will remain non mutex in all future layers.
B
If propositions P and Q are non mutex in a layer n then it will remain non mutex in all future layers.

Question 21 on its own page

Question 22

+1 markOne or more correct options

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain descr

Which of the following are applicable actions for FSSP?

Select all that apply.

A
Putdown(D)
B
Stack(A,D)
C
Stack(D,E)
D
Stack(D,C)
E
Unstack(E,B)
F
Unstack(C,A)

Show answer

Correct answers

A
Putdown(D)
C
Stack(D,E)
D
Stack(D,C)

Question 22 on its own page

Question 23

+1 markOne or more correct options

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

Which of the following are relevant actions for BSSP?

Select all that apply.

A
Putdown(D)
B
Stack(A,D)
C
Stack(D,E)
D
Stack(D,C)
E
Unstack(E,B)
F
Unstack(C,A)

Show answer

Correct answers

B
Stack(A,D)
C
Stack(D,E)

Question 23 on its own page

Question 24

+1 markOne or more correct options

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

In the planning graph, which of the following are mutex action pairs in layer 1?

Select all that apply.

A
Stack(D,E) and nop for armEmpty
B
Stack(D,E) and nop for clear(C)
C
Stack(D,E) and nop for holding(D)
D
Stack(D,E) and Putdown(D)

Show answer

Correct answers

C
Stack(D,E) and nop for holding(D)
D
Stack(D,E) and Putdown(D)

Question 24 on its own page

Question 25

+1 markOne or more correct options

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

In the planning graph, which of the following are mutex proposition pairs in layer 1?

Select all that apply.

A
armEmpty and clear(C)
B
armEmpty and holding(D)
C
on(D,E) and clear(C)
D
on(D,E) and onTable(D)

Show answer

Correct answers

B
armEmpty and holding(D)
D
on(D,E) and onTable(D)

Question 25 on its own page

Question 26

+1 markOne or more correct options

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

In the planning graph, which of the following are applicable actions in layer 2?

Select all that apply.

A
Pickup(D)
B
Putdown(C)
C
Unstack(E,B)
D
Unstack(C,A)

Show answer

Correct answers

A
Pickup(D)
C
Unstack(E,B)
D
Unstack(C,A)

Question 26 on its own page

Question 27

+1 markOne correct option

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

For the given planning problem, does a plan exist?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 27 on its own page

Question 28

+1 markWritten answer

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

For the given planning problem, the length of the plan found by GraphPlan is __________ . Enter an integer or enter NIL if GraphPlan cannot find a plan. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 12 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 28 on its own page

Question 29

+1 markOne or more correct options

CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

Which of the following tuples occur in R_AC?

Select all that apply.

A
(1,2)
B
(2,1)
C
(2,4)
D
(4,2)

Show answer

Correct answers

A
(1,2)
B
(2,1)
C
(2,4)

Question 29 on its own page

Question 30

+1 markOne or more correct options

CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

Which of the following tuples occur in R_BA?

Select all that apply.

A
(1,4)
B
(2,1)
C
(3,1)
D
(4,2)

Show answer

Correct answers

A
(1,4)
B
(2,1)
D
(4,2)

Question 30 on its own page

Question 31

+1 markOne correct option

CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

Is the given CSP arc-consistent?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

B
No

Question 31 on its own page

Question 32

+1 markOne correct option

CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

If the given CSP is not already arc-consistent, then make it arc-consistent, and then check if the resulting network is path consistent.

A
It is path consistent.
B
It is not path consistent.
C
Path consistency does not apply because the constraint graph has a cycle.

Show answer

Correct answer

A
It is path consistent.

Question 32 on its own page

Question 33

+1 markWritten answer

CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

Does the given CSP have a solution? Enter the solution for the variables A,B,C as a comma separated list. Enter NIL if there is no solution. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 1,2,3 Answers Case Sensitive : No

Show answer

A written answer, not marked automatically.

Question 33 on its own page

Question 34

+1 markWritten answer

SEARCH Consider a water-jug puzzle with three jugs a, b and c of capacities 5L, 3L and 2L, respectively. A state, encoded as a digit string ABC, denotes volume of water in jugs a, b and c, respectively. For example, state 122 denotes that jugs a, b and c contain 1L, 2L and 2L of water, respectively.

MoveGen takes a state ABC and returns a set of neighbours that are one move away from ABC. For example, MoveGen(122) = { 032, 302, 320, 131 }. Based on the above data, answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 34 on its own page

Question 35

+1 markWritten answer

SEARCH ALGORITHMS Answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 35 on its own page

Question 36

+1 markWritten answer

GAMES: ALPHA-BETA Consider a game tree with the root node as MAX, where an arbitrary path from the root reaches the subtree shown in the figure.

Each leaf node A to D takes a UNIQUE EVAL VALUE from the set {1, 2, 3, 4}. Alpha-Beta algorithm is entering the subtree with alpha=1 and beta=3; find an optimal eval assignment (for nodes A to D) that maximizes the number of leaves pruned; find the minimax value, the type of cuts and the leaves pruned for that assignment. Based on the above data, answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 36 on its own page

Question 37

+1 markWritten answer

GAMES: SSS STAR The figure shows a game tree with evaluation function values at the horizon nodes. The horizon nodes are labeled from A to J. Where applicable, use these labels in short answers. Tie-breaker: When several nodes carry the same best cost then select the deepest node, if tie persists then select the leftmost of the deepest nodes to break the tie.

Run SSS* algorithm on the game tree, then answer the sub-questions.

Show answer

A written answer, not marked automatically.

Question 37 on its own page

Question 38

+1 markWritten answer

PROBLEM DECOMPOSITION The figure shows an AND-OR decomposition of problem S into smaller problems. The nodes are uniquely identified by labels (S, A, B, C, …). Each node shows the heuristic estimate of the cost of solving that node. Nodes shown in double lines are primitive nodes and their values are actual costs. A primitive node is added to the graph, with SOLVED status, when its parent is expanded. And therefore, a primitive node is never expanded. The cost of each edge is 2 units. Tie-breaker 1: If several nodes have the same cost then break the tie using node labels. Tie-breaker 2: For AND nodes, select the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the sub-questions.

Show answer

A written answer, not marked automatically.

Question 38 on its own page

Question 39

+1 markWritten answer

RULE BASED EXPERT SYSTEMS A part of the Rete Net that classifies mushrooms (as edible or poisonous) is shown in the figure. The labels A1, A2, ..., A10, A16, ..., B1, B2, B3, R1, …, R4 uniquely identify the nodes in the network. When required, use the above label ordering to break ties and to enter short answers. Note: "attribute <> x" is true when that attribute exists and its value is not equal to x.

Run the Rete algorithm for the Working Memory shown below, the WMEs are in timestamp order. Assume that WMEs reside at appropriate Alpha nodes, and the Beta nodes point to WMEs residing in Alpha nodes.

For each WME identify its location (node label) in the Rete Net, and prepare the conflict set for the first cycle, then answer the sub-questions.

Show answer

A written answer, not marked automatically.

Question 39 on its own page

Question 40

+1 markWritten answer

AUTOMATED PLANNING 1 Answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 40 on its own page

Question 41

+1 markWritten answer

Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix AUTOMATED PLANNING 2 The domain description of a Blocks World with a single one-armed robot is given below.

Consider the following planning problem.

Based on the above data, answer the given subquestions.

Show answer

A written answer, not marked automatically.

Question 41 on its own page

Question 42

+1 markWritten answer

CONSTRAINT SATISFACTION Consider a CSP over 3 variables A, B, C where the domains and constraints are:

where, mod(n,d) returns the remainder after dividing n by d, for example, mod(8,3)=2, mod(6,7)=6, mod(8,7)=1. Compute the three relations to match the domain constraints,then draw the constraint graph and matching-diagram,and then answer the sub-questions.

Show answer

A written answer, not marked automatically.

Question 42 on its own page