Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Greedy Algorithms
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:
1
a)-(i); (b)-(ii); (c)-(iii)
2
(a)-(iii);(b)-(ii); (c)-(i)
3
(a)-(i); (b)-(iii); (c)-(ii)
4
(a)-(ii); (b)-(iii); (c)-(i)