# NTA | UGC NET 2019 June – II | Question 68

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:

(A)

(a) â€“ (i) ; (b) â€“ (ii); (c) â€“ (iii)

(B)

(a) â€“ (iii) ; (b) â€“ (ii); (c) â€“ (i)

(C)

(a) â€“ (i) ; (b) â€“ (iii); (c) â€“ (ii)

(D)

(a) â€“ (ii) ; (b) â€“ (iii); (c) â€“ (i)

Explanation:

Greedy best first:  Minimal h(p)

Lowest cost: Minimal cost(p)

A* search: Minimal cost(p)+h(p) where,

=> g = the movement cost to move from the starting point to a given square on the grid, following the path generated to get there.
=> h = the estimated movement cost to move from that given square on the grid to the final destination. This is often referred to as the heuristic,

So,  option D is correct.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Previous
Next