UGC NET CS 2018-DEC Paper-2
November 26, 2023Question 4983 – Algorithms
November 26, 2023Question 4912 – Algorithms
Match List 1 with List 2 and choose the correct answer from the code given below
Correct Answer: B
Question 280 Explanation:
→ Greedy Best-first Search: Selects a node for expansion if optimal path to that node has been found. Best-first search is a search algorithm which explores a graph by expanding the most
promising node chosen according to a specified rule. Best-first search as estimating the promise of node n by a “heuristic evaluation function f(n) which, in general, may depend on the
description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain.”
→ A* Search: Time complexity depends upon the quality of heuristic.
→ Recursive Best-First Search: Suffers from excessive node generation. RBFS depends on how widely the promising nodes are separated in the search tree, and is harder to anticipate.
→ Iterative-deepening A* Search: Avoids substantial overhead associated with keeping the sorted queue of nodes
promising node chosen according to a specified rule. Best-first search as estimating the promise of node n by a “heuristic evaluation function f(n) which, in general, may depend on the
description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain.”
→ A* Search: Time complexity depends upon the quality of heuristic.
→ Recursive Best-First Search: Suffers from excessive node generation. RBFS depends on how widely the promising nodes are separated in the search tree, and is harder to anticipate.
→ Iterative-deepening A* Search: Avoids substantial overhead associated with keeping the sorted queue of nodes
(a)-(iv), (b)-(iii), (c) -(ii), (d)-(i)
(a)-(i), (b)-(iv), (c) -(iii), (d)-(ii)
(a)-(iv), (b)-(i), (c) -(ii), (d)-(iii)
(a)-(i), (b)-(ii), (c) -(iii), (d)-(iv)
Subscribe
Login
0 Comments