Match List I with List II \(\begin{array}{llll} & \text{List I} && \text{List…

2020

Match List I with List II

\(\begin{array}{llll} & \text{List I} && \text{List II} \\ (A) & \text{Branch-and-bound} & (I) & \text{Keeps track of all partial paths} \\ &&& \text{which can be candidate for} \\ &&& \text{further exploration.} \\ (B) & \text{Steepest-accent hill climbing} & (II) & \text{Defects difference between current} \\ &&& \text{state and goal state} \\ (C) & \text{Constraint satisfaction} & (III) & \text{Discovers problem state(s) that satisfy} \\ &&& \text{a set of constraints} \\ (D) & \text{Means-end-analysis} & (IV) & \text{Considers all moves from current state} \\ &&& \text{and selects best move} \end{array}\)

Choose the correct answer from the options given below:

  1. A.

    \(A-I, B-IV, C-III, D-II \)

  2. B.

    \(A-I, B-II, C-III, D-IV \)

  3. C.

    \(A-II, B-I, C-III, D-IV \)

  4. D.

    \( A-II, B-IV, C-III, D-I\)

Attempted by 74 students.

Show answer & explanation

Correct answer: A

Correct matching and explanation:

  • Branch-and-bound → Keeps track of all partial paths which can be candidate for further exploration. Branch-and-bound systematically generates partial solutions, stores promising partial paths, and uses bounds to prune unpromising branches.

  • Steepest-ascent hill climbing → Considers all moves from the current state and selects the best move. Steepest-ascent evaluates all neighbors of the current state and moves to the neighbor with the best evaluation.

  • Constraint satisfaction → Discovers problem state(s) that satisfy a set of constraints. Constraint satisfaction problems seek assignments or states that meet all given constraints, often using backtracking, propagation, or search.

  • Means-end analysis → Identifies differences between the current state and the goal state and chooses actions to reduce those differences. Means-end analysis breaks the goal into subgoals by analyzing differences and selects operators that reduce those specific differences.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…