Match List I with List II

List I

List II

(A) Branch-and-bound

(I) Keeps track of all partial paths which can be candidate for further exploration.

(B) Steepest-accent hill climbing

(II) Detects difference between current state and goal state

(C) Constraint satisfaction

(III) Discovers problem state(s) that satisfy a set of constraints.

(D) Means-end-analysis

(IV) Considers all moves from current state and selects best move

Choose the correct answer from the options given below:

Question

Question

This question was previously asked in

UGC NET Computer Science (Paper 2) 2020 Official Paper

Answer 1

The correct answer is option 1.

Key Points

Branch-and-bound:

Keeps track of all partial paths which can be a candidate for further exploration. (ex: A* Search, BFS)

Steepest-accent hill climbing:

Considers all moves from the current state and selects the best move. (ex:hill-climbing algorithm. )

Constraint satisfaction:

Discovers problem state(s) that satisfy a set of constraints. (ex: Eight queens puzzle. Map coloring problem.)

Means-end-analysis:

Detects the difference between the current state and the goal state. (ex: Means-end-analysis)

∴ Hence the correct answer is A - I, B - IV, C - III, D - II.

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