PYQ UGC NET 2019
Match List-I with List-II:
List-IList-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)\begin{array}{c} {} & \text{List-I} & {} & \text{List-II} \\ (a) & \text{Greedy best-first} & (i) & \text{Minimal cost } (p)+h(p) \\ (b) & \text{Lowest cost-first} & (ii) & \text{Minimal } h(p) \\ (c) & A^* \text{ algorithm} & (iii) & \text{Minimal cost } (p) \\ \end{array}(a)(b)(c)List-IGreedy best-firstLowest cost-firstA∗ algorithm(i)(ii)(iii)List-IIMinimal cost (p)+h(p)Minimal h(p)Minimal cost (p)
Choose the correct option from those given below:
(a)– (i);(b)– (ii);(c) – (iii)(a) – (i) ; (b) – (ii); (c) – (iii) (a)– (i);(b)– (ii);(c) – (iii)
(a)– (iii);(b)– (ii);(c) – (i)(a) – (iii) ; (b) – (ii); (c) – (i) (a)– (iii);(b)– (ii);(c) – (i)
(a)– (i);(b)– (iii);(c) – (ii)(a) – (i) ; (b) – (iii); (c) – (ii) (a)– (i);(b)– (iii);(c) – (ii)
(a)– (ii);(b)– (iii);(c) – (i)(a) – (ii) ; (b) – (iii); (c) – (i)(a)– (ii);(b)– (iii);(c) – (i)
Attempted by 158 students.
Sign up free to check your answer
Question 4 of 10 Q4620 in PYQ Questions (A* Search Algorithm).
Explore the full course: Nta Ugc Net Paper 2