AI Search Methods End Term PYQ May 2025: 31 Aug 2025 (Set QDD3)

Question 1

+0 marksOne or more correct options

ASK FOR PRINTED GRAPH SHEETS

Pages 1 to 8

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
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.

Based on the above data, answer the given subquestions.

What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z

Show answer

Correct answer: S,C,F,G

Question 2 on its own page

Question 3

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.

Based on the above data, answer the given subquestions.

What is the path found by A* search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z

Show answer

Correct answer: S,B,A,E,G

Question 3 on its own page

Question 4

+1 markWritten answer

SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.

Based on the above data, answer the given subquestions.

What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.
Use the Branch-and-Bound variation that avoids cyclic expansions like S,B,S,B,S,B,...
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z

Show answer

Correct answer: S,B,A,E,G

Question 4 on its own page

Question 5

+1 markOne correct option

SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.

Based on the above data, answer the given subquestions.

For the given map, which algorithm finds the shortest path from S to G?

A
B
C
D

Show answer

Correct answer

C

Question 5 on its own page

Question 6

+1 markOne correct option

SEARCH
The figure shows a map on a uniform grid where each tile is 1x1 in size.
The start node is S and the goal node is G.
The MoveGen function returns nodes in alphabetical order.
Use Manhattan Distance as the heuristic function.
Tie-breaker: If several nodes have the same cost, use node labels to break the tie.

Based on the above data, answer the given subquestions.

Select the correct statement(s) about the given graph.

A
Heuristic is admissible.
B
Heuristic is not admissible.
C
Heuristic is admissible in some cases and not admissible in other cases.
D
There is not enough information to determine admissibility.

Show answer

Correct answer

A
Heuristic is admissible.

Question 6 on its own page

Question 7

+1 markWritten answer

TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.

Let S0 (ref. no. a1) be the first node to be refined, identify the next 4 nodes (2nd to 5th node) that are refined by the TSP BnB algorithm. Enter the nodes (node reference numbers) in the order they are refined.
Enter a comma separated list of node reference numbers.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: a9,b9,c9,d9

Show answer

Correct answer: b1,c1,d2,b2

Question 7 on its own page

Question 8

+1 markWritten answer

TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.

Which node represents the optimal tour? Enter the node reference number in the text box, or enter NIL if it is not possible to determine the optimal tour.
Enter a node reference number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: a9

Show answer

Correct answer: d5

Question 8 on its own page

Question 9

+1 markWritten answer

TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.

What is the cost of the optimal tour? Enter the cost of the optimal tour in the text box, or enter NIL if it is not possible to determine the optimal tour.
Enter an integer.
NO SPACES, TABS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42

Show answer

Correct answer: 366

Question 9 on its own page

Question 10

+1 markWritten answer

TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.

Determine the number of cities in the TSP instance. Enter the number of cities in the text box, or enter NIL if it is not possible to determine the number of cities.
Enter an integer.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42

Show answer

Correct answer: 5

Question 10 on its own page

Question 11

+1 markWritten answer

TSP BnB
TSP BnB algorithm is solving a TSP instance where the cities are A, B, C, .... and so on. The BnB search tree (at the point when the algorithm discovers the optimal tour) is provided below. Each node in the search tree displays an edge (either XY or ¬XY), a cost value, and a unique reference number (a1, b1, ..., c1, ..., d1, ..., e1, e2). Use the reference numbers to break ties. When required, use reference numbers in short answers.
What information can you glean from the search tree? Answer the sub-questions based on the information gleaned from the search tree.

Start from city A, what is the path representation of the optimal tour? Enter the path
representation in the text box, or enter NIL if it is not possible to determine the optimal tour. Enter a comma separated list of cities (city labels).
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: A,B,C

Show answer

Correct answer: A,B,D,C,E or A,E,C,D,B

Question 11 on its own page

Question 12

+1 markOne or more correct options

GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). 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.

Based on the above data, answer the given subquestions.

Which of the following is a strategy for the MAX player?

Select all that apply.

A
I,K
B
E,F,G
C
E,F
D
I,J,K

Show answer

Correct answers

A
I,K
C
E,F

Question 12 on its own page

Question 13

+1 markWritten answer

GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). 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.

Based on the above data, answer the given subquestions.

List the leaf nodes in the best strategy for MAX. Enter the node labels in alphabetical order. Enter a comma separated list of node labels in alphabetical order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z

Show answer

Correct answer: A,C,D

Question 13 on its own page

Question 14

+1 markWritten answer

GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). 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.

Based on the above data, answer the given subquestions.

List the leaf nodes inspected by Alpha-Beta algorithm.
Enter a comma separated list of node labels in alphabetical order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z

Show answer

Correct answer: A,B,E,I

Question 14 on its own page

Question 15

+1 markWritten answer

GAMES
The figure shows a game tree with evaluation function values at the leaf nodes.
The leaf nodes are labeled from A to K.
Use these labels to enter a leaf node or a list of leaf nodes in short answers (textbox). 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.

Based on the above data, answer the given subquestions.

Show answer

Correct answer: A,B,E,I or A,E,I,B or I,E,A,B

Question 15 on its own page

Question 16

+1 markWritten answer

PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
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, expand the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the subquestions.

List the nodes (including S) 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: X,Y,Z

Show answer

Correct answer: S,B,A or B,A

Question 16 on its own page

Question 17

+1 markWritten answer

PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
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, expand the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the subquestions.

Determine the value of the start node S after each node is expanded. Enter the value of S after each node is expanded.
Enter a comma separated list of numbers.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 12,42,17

Show answer

Correct answer: 34,37,56 or 37,56

Question 17 on its own page

Question 18

+1 markNumerical answer

PROBLEM DECOMPOSITION
The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more smaller problems. Nodes are uniquely identified by labels (S, A, B, …). The number in each node is the heuristic estimate of the cost of solving that node.
Nodes shown in double lines are primitive nodes and their values are actual costs. Observe that a primitive node is added to the graph by its parent when the parent is expanded, and the primitive node is labeled as SOLVED and it will not be expanded subsequently.
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, expand the unsolved branch with the highest cost.

Use AO* algorithm to solve S, then answer the subquestions.

Show answer

Correct answer: 56

Question 18 on its own page

Question 19

+1 markOne or more correct options

RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. Here, BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.

The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.

text

1101.  (Fuel   ^item N59 ^type solid)
2102.  (Fuel   ^item N26 ^type liquid)
3103.  (Fuel   ^item N37)
4104.  (BoM    ^item N48 ^part alternator)
5105.  (Energy ^item N48 ^source wind)
6106.  (BoM    ^item N37 ^part alternator)
7107.  (BoM    ^item N15 ^part CD-nozzle)

The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the given sub-questions.

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

Select all that apply.

A
(Liquid-Fuel-Rocket, 102, 107)
B
(Solid-Fuel-Rocket, 107, 101)
C
(Windmill, 105, 104)
D
(Generator, 104)
E
(Generator, 106)
F
(Rocket, 107)

Show answer

Correct answers

C
(Windmill, 105, 104)
D
(Generator, 104)
E
(Generator, 106)
F
(Rocket, 107)

Question 19 on its own page

Question 20

+1 markOne correct option

RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. Here, BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.

The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.

text

1101.  (Fuel   ^item N59 ^type solid)
2102.  (Fuel   ^item N26 ^type liquid)
3103.  (Fuel   ^item N37)
4104.  (BoM    ^item N48 ^part alternator)
5105.  (Energy ^item N48 ^source wind)
6106.  (BoM    ^item N37 ^part alternator)
7107.  (BoM    ^item N15 ^part CD-nozzle)

The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the given sub-questions.

If the Inference Engine uses Specificity for conflict resolution then which rule-data tuple will fire in the first round?

A
(Liquid-Fuel-Rocket, 102, 107)
B
(Solid-Fuel-Rocket, 107, 101)
C
(Windmill, 105, 104)
D
(Generator, 104)
E
(Generator, 106)
F
(Rocket, 107)

Show answer

Correct answer

C
(Windmill, 105, 104)

Question 20 on its own page

Question 21

+1 markOne correct option

RULE BASED EXPERT SYSTEMS
A Rete Net for a rule based system to identify engines, turbines and motors is shown in the figure. Here, BoM refers to Bill-of-Materials, which is a list of parts and their quantities needed for assembling a machine.
The nodes in the network are uniquely identified by labels: A1,A2,... for Alpha nodes; B1,B2,... for beta nodes; R1,R2,... for rules.

The Working Memory contains the following WMEs uniquely identified by timestamps (sequence numbers). Assume that WMEs reside in the appropriate Alpha node, and Beta nodes simply point to elements in the ancestor Alpha nodes.

text

1101.  (Fuel   ^item N59 ^type solid)
2102.  (Fuel   ^item N26 ^type liquid)
3103.  (Fuel   ^item N37)
4104.  (BoM    ^item N48 ^part alternator)
5105.  (Energy ^item N48 ^source wind)
6106.  (BoM    ^item N37 ^part alternator)
7107.  (BoM    ^item N15 ^part CD-nozzle)

The sub-questions are based on the first Match-Resolve-Execute cycle. Determine the locations of the WMEs and compute the conflict set, then answer the given sub-questions.

If the Inference Engine uses Recency for conflict resolution which rule-data tuple will fire in the first round?

A
(Liquid-Fuel-Rocket, 102, 107)
B
(Solid-Fuel-Rocket, 107, 101)
C
(Windmill, 105, 104)
D
(Generator, 104)
E
(Generator, 106)
F
(Rocket, 107)

Show answer

Correct answer

F
(Rocket, 107)

Question 21 on its own page

Question 22

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.

text

1PREDICATES
2
3armEmpty        The arm is not holding any block, it is empty.
4holding(X)      The arm is holding X.
5onTable(X)      X is on the table.
6clear(X)        X has nothing above it, it is clear.
7on(X,Y)         X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Consider the following planning problem.

Based on the above data, answer the given subquestions.

Which of the following are applicable actions in the start state?

Select all that apply.

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

Show answer

Correct answers

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

Question 22 on its own page

Question 23

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.

text

1PREDICATES
2
3armEmpty        The arm is not holding any block, it is empty.
4holding(X)      The arm is holding X.
5onTable(X)      X is on the table.
6clear(X)        X has nothing above it, it is clear.
7on(X,Y)         X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

Consider the following planning problem.

Based on the above data, answer the given subquestions.

Which of the following are relevant actions in the goal state?

Select all that apply.

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

Show answer

Correct answers

F
Stack(A,B)
G
Stack(B,C)

Question 23 on its own page

Question 24

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.

text

1PREDICATES
2
3armEmpty        The arm is not holding any block, it is empty.
4holding(X)      The arm is holding X.
5onTable(X)      X is on the table.
6clear(X)        X has nothing above it, it is clear.
7on(X,Y)         X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

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
Unstack(D,A), Pickup(C)
B
Unstack(D,A), Unstack(E,B)
C
Pickup(C), Stack(A,B)
D
Pickup(C), Stack(B,C)

Show answer

Correct answers

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

Question 24 on its own page

Question 25

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.

text

1PREDICATES
2
3armEmpty        The arm is not holding any block, it is empty.
4holding(X)      The arm is holding X.
5onTable(X)      X is on the table.
6clear(X)        X has nothing above it, it is clear.
7on(X,Y)         X is directly placed on Y.
8
9OPERATORS
10
11Pickup(X): pick up X from the table.
12      Preconditions: { armEmpty, clear(X), onTable(X) }
13      Add Effects  : { holding(X) }
14      Del Effects  : { armEmpty, onTable(X) }
15
16Putdown(X): place X on the table.
17      Preconditions: { holding(X) }
18      Add Effects  : { armEmpty, onTable(X) }
19      Del Effects  : { holding(X) }
20
21Unstack(X,Y): pick up X that is directly sitting on Y.
22      Preconditions: { armEmpty, clear(X), on(X,Y) }
23      Add Effects  : { clear(Y), holding(X) }
24      Del Effects  : { armempty, on(X,Y) }
25
26Stack(X,Y): place X directly on top of Y.
27      Preconditions: { holding(X), clear(Y) }
28      Add Effects  : { armEmpty, on(X,Y) }
29      Del Effects  : { holding(X), clear(Y) }

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
clear(A), holding(E)
B
clear(A), clear(B)
C
clear(C), on(D,A)
D
clear(C), holding(E)

Show answer

Correct answers

A
clear(A), holding(E)
B
clear(A), clear(B)

Question 25 on its own page

Question 26

+1 markOne correct option

CONSTRAINT SATISFACTION

Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent to each other, and the regions are being processed in the order A,B,C.

The domains are:

$D_A = \{b, g\}$

$D_B = \{r, b\}$

$D_C = \{r, b\}$

Draw the constraint graph for the above problem and answer the sub-questions.

Is the given CSP arc consistent?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

Question 26 on its own page

Question 27

+1 markOne correct option

CONSTRAINT SATISFACTION

Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent to each other, and the regions are being processed in the order A,B,C.

The domains are:

$D_A = \{b, g\}$

$D_B = \{r, b\}$

$D_C = \{r, b\}$

Draw the constraint graph for the above problem and answer the sub-questions.

Is the given CSP path consistent?

A
No
B
Yes
C
Cannot be determined

Show answer

Correct answer

A
No

Question 27 on its own page

Question 28

+1 markWritten answer

CONSTRAINT SATISFACTION

Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent to each other, and the regions are being processed in the order A,B,C.

The domains are:

$D_A = \{b, g\}$

$D_B = \{r, b\}$

$D_C = \{r, b\}$

Draw the constraint graph for the above problem and answer the sub-questions.

Does the given CSP have a solution? Enter the solution for regions A,B,C as a comma separated list of colours. Enter NIL if there is no solution.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: r,b,r

Show answer

Correct answer: g,r,b or g,b,r

Question 28 on its own page