Quiz Space

May 2024 term · AI: Search Methods for Problem Solving · BSCS3003

AI Search Methods End Term: 1 September 2024, Set QDB3 (May 2024 term)

The IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 1 Sept 2024, in the May 2024 term, set QDB3: 26 questions for 25 marks in 180 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
26
Marks
25
Duration
180 min
MCQ
4
Written
13
MSQ
7
Numerical
2
Take as mock testPractise with answers

Updated

Official paper: IIT M DEGREE FN EXAM QDB1 01 Sep 2024 · No negative marking.

Question 1

+0 marksOne correct option

ASK FOR PRINTED GRAPH SHEETS

10 PAGES

DOUBLE-SIDED

  1. A

    Printed graph sheets were provided to me.

  2. B

    Printed graph sheets were not provided to me.

  3. C

    I did not use graph sheets.

Show answer

Correct answer

  • A

    Printed graph sheets were provided to me.

Question 1 on its own pageAlso asked in End Term 1 Sept 2024

Question 2

+1 markWritten answer

SEARCH

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,E,D,G

Question 2 on its own page

Question 3

+1 markWritten answer

SEARCH

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,F,C,A,G

Question 3 on its own page

Question 4

+1 markWritten answer

SEARCH

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,A,S,A,S,A,...
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: S,X,Y,Z

Show answer

Correct answer: S,F,C,A,G

Question 4 on its own page

Question 5

+1 markOne or more correct options

SEARCH

Based on the above data, answer the given subquestions.

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

Select all that apply.

  1. A

    Best First Search

  2. B

    A* Search Algorithm

  3. C

    Branch-and-Bound Search Algorithm

  4. D

    None of these.

Show answer

Correct answers

  • B

    A* Search Algorithm

  • C

    Branch-and-Bound Search Algorithm

Question 5 on its own page

Question 6

+1 markOne correct option

SEARCH

Based on the above data, answer the given subquestions.

What can you say about the heuristic function for the given graph?

  1. A

    Admissible.

  2. B

    Inadmissible.

  3. C

    Partly admissible and partly inadmissible.

  4. D

    Cannot be determined.

Show answer

Correct answer

  • A

    Admissible.

Question 6 on its own page

Question 7

+1 markWritten answer

TSP Branch-and-Bound

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 Branch-and-Bound 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,c2,d1,b2

Question 7 on its own page

Question 8

+1 markWritten answer

TSP Branch-and-Bound

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

Show answer

Correct answer: e1,282

Question 8 on its own page

Question 9

+1 markNumerical answer

TSP Branch-and-Bound

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 9 on its own page

Question 10

+1 markWritten answer

TSP Branch-and-Bound

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,X,Y

Show answer

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

Question 10 on its own page

Question 11

+1 markOne or more correct options

GAMES

Based on the above data, answer the given subquestions.

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

Select all that apply.

  1. A

    A,C

  2. B

    A,D,G

  3. C

    G,J,K

  4. D

    D,E,F

Show answer

Correct answers

  • A

    A,C

  • C

    G,J,K

Question 11 on its own page

Question 12

+1 markWritten answer

GAMES

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: D,E

Question 12 on its own page

Question 13

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions.

List the leaf nodes pruned by Alpha-Beta.
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: C,F,H,I,J,K

Question 13 on its own page

Question 14

+1 markWritten answer

GAMES

Based on the above data, answer the given subquestions.

List the leaf nodes solved (assigned SOLVED status) by SSS*.
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,D,E,G or A,D,G,E

Question 14 on its own page

Question 15

+1 markWritten answer

PROBLEM DECOMPOSITION

List the first three 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,A,C or A,C,B

Question 15 on its own page

Question 16

+1 markWritten answer

PROBLEM DECOMPOSITION

Determine the value of the start node S after each node is expanded. What are the values of S after the 1st, 2nd and 3rd nodes are expanded, respectively? Enter the 3 values in the textbox. Enter a comma separated list of numbers.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 12,42,17

Show answer

Correct answer: 22,28,32 or 28,32,56

Question 16 on its own page

Question 17

+1 markNumerical answer

PROBLEM DECOMPOSITION

What is the final value of the start node S?
Enter a number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42

Show answer

Correct answer: 56

Question 17 on its own page

Question 18

+1 markOne or more correct options

RULE BASED EXPERT SYSTEMS

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

Select all that apply.

  1. A

    Luxury-Car,104,107

  2. B

    Minivan,103,106

  3. C

    Truck,101,102,105

  4. D

    Minivan,103,106,108

Show answer

Correct answers

  • A

    Luxury-Car,104,107

  • B

    Minivan,103,106

  • C

    Truck,101,102,105

Question 18 on its own page

Question 19

+1 markOne correct option

RULE BASED EXPERT SYSTEMS

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

  1. A

    Luxury-Car,104,107

  2. B

    Minivan,103,106

  3. C

    Truck,101,102,105

  4. D

    Minivan,103,106,108

Show answer

Correct answer

  • C

    Truck,101,102,105

Question 19 on its own page

Question 20

+1 markOne correct option

RULE BASED EXPERT SYSTEMS

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

  1. A

    Luxury-Car,104,107

  2. B

    Minivan,103,106

  3. C

    Truck,101,102,105

  4. D

    Minivan,103,106,108

Show answer

Correct answer

  • A

    Luxury-Car,104,107

Question 20 on its own page

Question 21

+1 markOne or more correct options

AUTOMATED PLANNING

Based on the above data, answer the given subquestions.

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

Select all that apply.

  1. A

    Putdown(D)

  2. B

    Unstack(D,B)

  3. C

    Unstack(C,A)

  4. D

    Pickup(E)

  5. E

    Pickup(A)

  6. F

    Stack(B,A)

  7. G

    Stack(A,C)

Show answer

Correct answers

  • B

    Unstack(D,B)

  • C

    Unstack(C,A)

  • D

    Pickup(E)

Question 21 on its own page

Question 22

+1 markOne or more correct options

AUTOMATED PLANNING

Based on the above data, answer the given subquestions.

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

Select all that apply.

  1. A

    Putdown(D)

  2. B

    Unstack(D,B)

  3. C

    Unstack(C,A)

  4. D

    Pickup(E)

  5. E

    Pickup(A)

  6. F

    Stack(B,A)

  7. G

    Stack(A,C)

Show answer

Correct answers

  • F

    Stack(B,A)

  • G

    Stack(A,C)

Question 22 on its own page

Question 23

+1 markOne or more correct options

AUTOMATED PLANNING

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.

  1. A

    Unstack(D,B) , Pickup (E)

  2. B

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

  3. C

    Pickup(E), Stack(B,A)

  4. D

    Pickup(E), Stack(A,C)

Show answer

Correct answers

  • A

    Unstack(D,B) , Pickup (E)

  • B

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

Question 23 on its own page

Question 24

+1 markOne or more correct options

AUTOMATED PLANNING

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.

  1. A

    clear(B),holding (C)

  2. B

    clear(B), clear(A)

  3. C

    clear(E), on(D,B)

  4. D

    clear(E), holding(D)

Show answer

Correct answers

  • A

    clear(B),holding (C)

  • B

    clear(B), clear(A)

Question 24 on its own page

Question 25

+1 markWritten answer

CONSTRAINT SATISFACTION
The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedral objects is provided below. The in-plane clockwise/counterclockwise rotations of these junctions are valid as well. These junctions provide constraints on the possible edge assignments (convex, concave, arrow) for the edges/lines in 2D line drawings of trihedral objects.
The junctions carry unique labels: L1, L2, L3, L4, L5, L6, T1, T2, T3, T4, W1, W2, W3, Y1, Y2, Y3. When required, use the labels in short answers.

Note: A 2D line drawing of trihedral objects is considered to be consistent if all the edges and junctions can be assigned labels that are consistent with each other, otherwise the drawing is considered to be inconsistent and all labels are reset to NIL.
Apply a suitable algorithm to assign consistent labels to edges/junctions in the 2D line drawings in the sub-questions. Choose a suitable edge and junction order for solving the problems. Based on the above data, answer the given subquestions.

Assign consistent labels to all the edges and junctions in the 2D line drawing shown below. Enter the labels of the junctions 1, 2, 3, 4 in the text box, in that order. Enter NIL if the drawing has no consistent label assignment.

Enter a comma separated list of junction labels, or enter NIL.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: Y9,T9,W9,L9

Show answer

Correct answer: NIL

Question 25 on its own page

Question 26

+1 markWritten answer

CONSTRAINT SATISFACTION
The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedral objects is provided below. The in-plane clockwise/counterclockwise rotations of these junctions are valid as well. These junctions provide constraints on the possible edge assignments (convex, concave, arrow) for the edges/lines in 2D line drawings of trihedral objects.
The junctions carry unique labels: L1, L2, L3, L4, L5, L6, T1, T2, T3, T4, W1, W2, W3, Y1, Y2, Y3. When required, use the labels in short answers.

Note: A 2D line drawing of trihedral objects is considered to be consistent if all the edges and junctions can be assigned labels that are consistent with each other, otherwise the drawing is considered to be inconsistent and all labels are reset to NIL.
Apply a suitable algorithm to assign consistent labels to edges/junctions in the 2D line drawings in the sub-questions. Choose a suitable edge and junction order for solving the problems. Based on the above data, answer the given subquestions.

Assign consistent labels to all the edges and junctions in the 2D line drawing shown below. Enter the labels of the junctions 1, 2, 3, 4 in the text box, in that order. Enter NIL if the drawing has no consistent label assignment.

Enter a comma separated list of junction labels, or enter NIL.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: Y9,T9,W9,L9

Show answer

Correct answer: L5,L6,W1,L1

Question 26 on its own page