Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET

Previous Year Question (PYQs)

Match List-I with List-II:
List-I List-II
(a) Greedy best-first (i) Minimal cost $p+h(p)$
(b) Lowest cost-first (ii) Minimal $h(p)$
(c) $A^*$ Algorithm (iii) Minimal cost $p$
Choose the correct option from those given below:




Solution

Greedy best-first search selects the node with minimum heuristic value.

So,

$(a)\rightarrow(ii)$

Lowest cost-first search selects the node with minimum path cost.

So,

$(b)\rightarrow(iii)$

$A^*$ algorithm selects the node using cost plus heuristic value.

So,

$(c)\rightarrow(i)$

Therefore, the correct matching is

$(a)-(ii);\ (b)-(iii);\ (c)-(i)$


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
Ask Your Question or Put Your Review.

loading...