MauryaHub PYQ Practice

cs3003_2026T1_Q2_NA.pdf

AI: Search Methods for Problem Solving · Quiz 2 · Jan 2026

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

Question 2 MSQ · 0.0 marks

[[IMAGE:8f0085a40c8cd9f7_2_2]]
Source diagram or notation
  1. Printed graph sheets were provided on time.
  2. Printed graph sheets were provided late.
  3. Printed graph sheets were not provided.
  4. I used the graph sheets.
  5. I did not use graph sheets.

A published solution is not available for this question yet.

Question 3 SHORT_TEXT · 1.0 marks

**SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
In the map, S is the first node to be refined, determine the next 3 nodes (from the 2nd to 4th node) refined by A*. Enter the nodes in the order they are refined. Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
Source diagram or notation

    A published solution is not available for this question yet.

    Question 4 SHORT_TEXT · 1.0 marks

    **SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
    What is the final path found by A* ? Enter the path as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,G
    Source diagram or notation

      A published solution is not available for this question yet.

      Question 5 SHORT_TEXT · 1.0 marks

      **SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
      For w=2, what is the final path found by WA* ? Enter the path as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,G
      Source diagram or notation

        A published solution is not available for this question yet.

        Question 6 NAT · 1.0 marks

        **SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
        What is the cost of the path found by Branch-and-Bound algorithm? Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
        Source diagram or notation

          A published solution is not available for this question yet.

          Question 7 MSQ · 1.0 marks

          **SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
          For the given map, which algorithms find a path that is also an optimal path?
          Source diagram or notation
          1. A*
          2. Branch and Bound
          3. Breadth First Search
          4. Hill Climbing
          5. WA* (w=2)

          A published solution is not available for this question yet.

          Question 8 MCQ · 1.0 marks

          **SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
          Is the heuristic admissible?
          Source diagram or notation
          1. Yes
          2. No

          A published solution is not available for this question yet.

          Question 9 MCQ · 1.0 marks

          **SEARCH** The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. **Tie-breaker**: Use alphabetical order to break ties. [[IMAGE:8f0085a40c8cd9f7_3_3]] Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
          A* algorithm calls MoveGen function, then drops neighbours already present in either OPEN or CLOSED, only then adds remaining neighbours to OPEN.
          Source diagram or notation
          1. True
          2. False

          A published solution is not available for this question yet.

          Question 10 NAT · 1.0 marks

          **TSP** Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on. [[IMAGE:8f0085a40c8cd9f7_6_4]] [[IMAGE:8f0085a40c8cd9f7_6_5]] **Note 1:** A segment is a two-way edge between a pair of cities. **Note 2:** In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.
          According to the TSP BnB algorithm covered in the lecture, select the first segment XY to refine the root node S0, then compute the lower bound cost of the node (S0, ~XY) that permanently excludes XY. Enter the lower bound cost in the textbox. Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
          Source diagram or notationSource diagram or notation

            A published solution is not available for this question yet.

            Question 11 NAT · 1.0 marks

            **TSP** Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on. [[IMAGE:8f0085a40c8cd9f7_6_4]] [[IMAGE:8f0085a40c8cd9f7_6_5]] **Note 1:** A segment is a two-way edge between a pair of cities. **Note 2:** In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.
            How many tours are represented by the node (S0, BC, AD, BE, ~AB, AF)? Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
            Source diagram or notationSource diagram or notation

              A published solution is not available for this question yet.

              Question 12 SHORT_TEXT · 1.0 marks

              **TSP** Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on. [[IMAGE:8f0085a40c8cd9f7_6_4]] [[IMAGE:8f0085a40c8cd9f7_6_5]] **Note 1:** A segment is a two-way edge between a pair of cities. **Note 2:** In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.
              Infer all the permanently included and permanently excluded segments in the node (S0, BC, AD, BE, ~AB, AF). Enter the total number of permanently included segments followed by the total number of permanently excluded segments as a comma separated list. Enter two natural numbers as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 17,42
              Source diagram or notationSource diagram or notation

                A published solution is not available for this question yet.

                Question 13 MSQ · 1.0 marks

                **GAMES** [[IMAGE:8f0085a40c8cd9f7_8_6]] Based on the above data, answer the given subquestions.
                What defines the best strategy for the MAX player?
                Source diagram or notation
                1. It is a strategy for the MAX player.
                2. It yields the best value for the MAX player.
                3. It admits only perfect play.
                4. It always wins the game for the MAX player.

                A published solution is not available for this question yet.

                Question 14 SHORT_TEXT · 1.0 marks

                **GAMES** [[IMAGE:8f0085a40c8cd9f7_8_6]] Based on the above data, answer the given subquestions.
                For the given game tree, list the leaf nodes in the best strategy. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
                Source diagram or notation

                  A published solution is not available for this question yet.

                  Question 15 SHORT_TEXT · 1.0 marks

                  **GAMES** [[IMAGE:8f0085a40c8cd9f7_8_6]] Based on the above data, answer the given subquestions.
                  List the leaf nodes pruned by Alpha-Beta algorithm. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
                  Source diagram or notation

                    A published solution is not available for this question yet.

                    Question 16 SHORT_TEXT · 1.0 marks

                    **GAMES** [[IMAGE:8f0085a40c8cd9f7_8_6]] Based on the above data, answer the given subquestions.
                    Solve the game tree using SSS* algorithm. List the leaf nodes (that are not in the initial cluster) that are assigned SOLVED status. Enter the node labels as a comma separated list in ASCENDING order. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z
                    Source diagram or notation

                      A published solution is not available for this question yet.

                      Question 17 MCQ · 1.0 marks

                      **GAMES** [[IMAGE:8f0085a40c8cd9f7_8_6]] Based on the above data, answer the given subquestions.
                      Alpha value is refined by Alpha-Beta algorithm whenever __________ .
                      Source diagram or notation
                      1. eval(child) <= Alpha
                      2. Alpha < eval(child) < Beta
                      3. Beta <= eval(child)
                      4. Alpha = eval(child) = Beta

                      A published solution is not available for this question yet.

                      Question 18 MSQ · 1.0 marks

                      **AUTOMATED PLANNING** The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments. [[IMAGE:8f0085a40c8cd9f7_11_7]] **Tie-breaker 1:** When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. **Tie-breaker 2:** Treat the goal description, preconditions and effects as lists that are accessed from left to right. **Tie-breaker 3:** When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain. [[IMAGE:8f0085a40c8cd9f7_11_8]] Based on the above data, answer the given subquestions.
                      Which of the following are **applicable** actions for the given planning problem?
                      Source diagram or notationSource diagram or notation
                      1. Pickup(E)
                      2. Stack(A,B)
                      3. Stack(B,C)
                      4. Stack(D,E)
                      5. Unstack(A,B)
                      6. Unstack(D,C)

                      A published solution is not available for this question yet.

                      Question 19 MSQ · 1.0 marks

                      **AUTOMATED PLANNING** The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments. [[IMAGE:8f0085a40c8cd9f7_11_7]] **Tie-breaker 1:** When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. **Tie-breaker 2:** Treat the goal description, preconditions and effects as lists that are accessed from left to right. **Tie-breaker 3:** When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain. [[IMAGE:8f0085a40c8cd9f7_11_8]] Based on the above data, answer the given subquestions.
                      Which of the following are **relevant** actions for the given planning problem?
                      Source diagram or notationSource diagram or notation
                      1. Pickup(E)
                      2. Stack(A,B)
                      3. Stack(B,C)
                      4. Stack(D,E)
                      5. Unstack(A,B)
                      6. Unstack(D,C)

                      A published solution is not available for this question yet.

                      Question 20 MCQ · 1.0 marks

                      **AUTOMATED PLANNING** The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments. [[IMAGE:8f0085a40c8cd9f7_11_7]] **Tie-breaker 1:** When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. **Tie-breaker 2:** Treat the goal description, preconditions and effects as lists that are accessed from left to right. **Tie-breaker 3:** When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain. [[IMAGE:8f0085a40c8cd9f7_11_8]] Based on the above data, answer the given subquestions.
                      For the given goal description, as per the tie breaking rules, which of the following is the first action popped out of the stack by Goal Stack Planning?
                      Source diagram or notationSource diagram or notation
                      1. Stack(A,B)
                      2. Stack(B,C)
                      3. Stack(D,E)
                      4. Unstack(A,B)
                      5. Unstack(D,C)

                      A published solution is not available for this question yet.

                      Question 21 NAT · 1.0 marks

                      **AUTOMATED PLANNING** The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments. [[IMAGE:8f0085a40c8cd9f7_11_7]] **Tie-breaker 1:** When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. **Tie-breaker 2:** Treat the goal description, preconditions and effects as lists that are accessed from left to right. **Tie-breaker 3:** When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain. [[IMAGE:8f0085a40c8cd9f7_11_8]] Based on the above data, answer the given subquestions.
                      For the given goal description, as per the tie breaking rules, Goal Stack Planning will push the goal description (compound goal) to the stack __________ time(s). Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
                      Source diagram or notationSource diagram or notation

                        A published solution is not available for this question yet.

                        Question 22 MCQ · 1.0 marks

                        **AUTOMATED PLANNING** The domain description of Blocks World with a one-armed robot is given below. The same domain description used in assignments. [[IMAGE:8f0085a40c8cd9f7_11_7]] **Tie-breaker 1:** When choosing actions non-deterministically, choose actions that lead to a plan. Ignore actions that lead to dead-ends or cycles. **Tie-breaker 2:** Treat the goal description, preconditions and effects as lists that are accessed from left to right. **Tie-breaker 3:** When list elements are pushed one by one to a stack, the last element in the list will be at the top of the stack. A planning problem is given below, find a plan using operators and predicates provided in the blocks-world domain. [[IMAGE:8f0085a40c8cd9f7_11_8]] Based on the above data, answer the given subquestions.
                        While working on a new subgoal, if Goal Stack Planning breaks a previously completed subgoal then it will immediately terminate and report failure.
                        Source diagram or notationSource diagram or notation
                        1. True
                        2. False

                        A published solution is not available for this question yet.