MauryaHub PYQ Practice

cs3003_2025T3_Q2_NA.pdf

AI: Search Methods for Problem Solving · Quiz 2 · Sep 2025

← 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 47 MCQ · 5.0 marks

Which of the following sets of concrete test inputs execute all instances of symbolic execution for the method process?
  1. {a = 4, b = 8}, {a = 4, b = 6}
  2. {a = 6, b = 4}, {a = 0, b = 0}
  3. {a = 0, b = 8}, {a = 4, b = 0}
  4. {a = -1, b = 1}, {a = 4, b = 4}       **AI** **Section Id :** 640653121908 **Section Number :** 3 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 6 **Number of Questions to be attempted :** 6 **Section Marks :** 25 **Display Number Panel :** Yes **Section Negative Marks :** 0 **Group All Questions :** No **Enable Mark as Answered Mark for Review and** No **Clear Response :** **Section Maximum Duration :** 0 **Section Minimum Duration :** 0 **Section Time In :** Minutes **Maximum Instruction Time :** 0

A published solution is not available for this question yet.

Question 49 MCQ · 1.0 marks

[[IMAGE:d0287584ab42e976_3_2]] Based on the above data, answer the given subquestions.
Does the Depth First Search algorithm find the path to the goal?
Source diagram or notation
  1. Yes
  2. No
  3. Cannot be determined

A published solution is not available for this question yet.

Question 50 MCQ · 1.0 marks

[[IMAGE:d0287584ab42e976_3_2]] Based on the above data, answer the given subquestions.
Does the Best-First Search algorithm find the path to the goal?
Source diagram or notation
  1. Yes
  2. No
  3. Cannot be determined

A published solution is not available for this question yet.

Question 51 MCQ · 1.0 marks

[[IMAGE:d0287584ab42e976_3_2]] Based on the above data, answer the given subquestions.
Does the Branch and Bound algorithm find the path to the goal?
Source diagram or notation
  1. Yes
  2. No
  3. Cannot be determined

A published solution is not available for this question yet.

Question 52 MCQ · 1.0 marks

[[IMAGE:d0287584ab42e976_3_2]] Based on the above data, answer the given subquestions.
[[IMAGE:d0287584ab42e976_4_3]]
Source diagram or notationSource diagram or notation
  1. Yes
  2. No
  3. Cannot be determined

A published solution is not available for this question yet.

Question 53 MCQ · 1.0 marks

[[IMAGE:d0287584ab42e976_3_2]] Based on the above data, answer the given subquestions.
[[IMAGE:d0287584ab42e976_4_4]]
Source diagram or notationSource diagram or notation
  1. Yes
  2. No
  3. Cannot be determined

A published solution is not available for this question yet.

Question 54 MCQ · 1.0 marks

[[IMAGE:d0287584ab42e976_3_2]] Based on the above data, answer the given subquestions.
Is the heuristic admissible in the given state space?
Source diagram or notation
  1. Yes
  2. No
  3. Cannot be determined

A published solution is not available for this question yet.

Question 55 MCQ · 1.0 marks

**SEARCH METHODS** Based on the above topic, answer the given subquestions.
Which of the following algorithms can be used to find the **most expensive path** to goal in a state space where every move is reversible and the edge costs are greater than 1?
  1. [[IMAGE:d0287584ab42e976_5_5]]
    Source diagram or notation
  2. [[IMAGE:d0287584ab42e976_5_6]]
    Source diagram or notation
  3. [[IMAGE:d0287584ab42e976_5_7]]
    Source diagram or notation
  4. [[IMAGE:d0287584ab42e976_5_8]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 56 MSQ · 1.0 marks

**SEARCH METHODS** Based on the above topic, answer the given subquestions.
If h(x) and k(x) are admissible then which of the following is/are admissible?
  1. h(x)/2 + k(x)/2
  2. h(x) + k(x)
  3. max( h(x), k(x) )
  4. min( h(x), k(x) )

A published solution is not available for this question yet.

Question 57 NAT · 1.0 marks

[[IMAGE:d0287584ab42e976_6_9]] A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible to compute the lower bound. Run TSP BnB to find the optimal tour. Determine the first three segments xy, uv and pq processed by TSP BnB. Based on the above data, answer the given subquestions.
What is the lower bound on the cost of the tour as per the TSP BnB algorithm discussed in class? Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 17
Source diagram or notation

    A published solution is not available for this question yet.

    Question 58 SHORT_TEXT · 1.0 marks

    [[IMAGE:d0287584ab42e976_6_9]] A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible to compute the lower bound. Run TSP BnB to find the optimal tour. Determine the first three segments xy, uv and pq processed by TSP BnB. Based on the above data, answer the given subquestions.
    What is the first segment (xy) selected for refining S0? Enter edge label xy NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: XY
    Source diagram or notation

      A published solution is not available for this question yet.

      Question 59 NAT · 1.0 marks

      [[IMAGE:d0287584ab42e976_6_9]] A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible to compute the lower bound. Run TSP BnB to find the optimal tour. Determine the first three segments xy, uv and pq processed by TSP BnB. Based on the above data, answer the given subquestions.
      What is the cost of the node ~xy (that permanently excludes segment xy)? 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 60 NAT · 1.0 marks

        [[IMAGE:d0287584ab42e976_6_9]] A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible to compute the lower bound. Run TSP BnB to find the optimal tour. Determine the first three segments xy, uv and pq processed by TSP BnB. Based on the above data, answer the given subquestions.
        How many tours are represented by the node (S0,xy,uv)? 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 61 NAT · 1.0 marks

          [[IMAGE:d0287584ab42e976_6_9]] A segment is a two-way edge between two cities. After adding/dropping a permanent segment, infer as many new permanent segments as possible to compute the lower bound. Run TSP BnB to find the optimal tour. Determine the first three segments xy, uv and pq processed by TSP BnB. Based on the above data, answer the given subquestions.
          What is the cost of the node (S0,xy,uv,pq)? Enter a natural number. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 17
          Source diagram or notation

            A published solution is not available for this question yet.

            Question 62 SHORT_TEXT · 1.0 marks

            [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
            List the horizon nodes in the best strategy for the MAX player. Enter node labels as 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 63 NAT · 1.0 marks

              [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
              Enter the total number of strategies available for the MAX player. Enter an integer 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 64 SHORT_TEXT · 1.0 marks

                [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
                Of all the strategies available for the MAX player, identify the MAX strategy that is most favorable for the MIN player. Enter the horizon nodes of that MAX strategy in the textbox. Enter node labels as 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 65 SHORT_TEXT · 1.0 marks

                  [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
                  List the horizon nodes pruned by Alpha-Beta algorithm. Enter node labels as 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 66 SHORT_TEXT · 1.0 marks

                    [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
                    [[IMAGE:d0287584ab42e976_11_11]]
                    Source diagram or notationSource diagram or notation

                      A published solution is not available for this question yet.

                      Question 67 SHORT_TEXT · 1.0 marks

                      [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
                      [[IMAGE:d0287584ab42e976_12_12]]
                      Source diagram or notationSource diagram or notation

                        A published solution is not available for this question yet.

                        Question 68 MSQ · 1.0 marks

                        [[IMAGE:d0287584ab42e976_9_10]] Based on the above data, answer the given subquestions.
                        [[IMAGE:d0287584ab42e976_12_13]]
                        Source diagram or notationSource diagram or notation
                        1. As soon as a MIN node is solved and added to the priority queue, immediately its MAX parent is also marked as solved and added to the priority queue.
                        2. As soon as a last MAX child is solved and added to the priority queue, immediately its MIN parent is also marked as solved and added to the priority queue.
                        3. Only a solved node at the top of the priority queue will determine when its parent will be marked as solved.
                        4. A live terminal node that is at the top of the priority queue will be immediately marked as solved.

                        A published solution is not available for this question yet.

                        Question 69 NAT · 1.0 marks

                        [[IMAGE:d0287584ab42e976_13_14]] [[IMAGE:d0287584ab42e976_14_15]] Based on the above data, answer the given subquestions.
                        What is the length of the optimal plan? Enter the number of actions in the optimal plan. 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 70 MSQ · 1.0 marks

                          [[IMAGE:d0287584ab42e976_13_14]] [[IMAGE:d0287584ab42e976_14_15]] 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(A)
                          2. Putdown(A)
                          3. Putdown(B)
                          4. Putdown(C)
                          5. Stack(A,B)

                          A published solution is not available for this question yet.