Computer Science · Artificial Intelligence
Match List-I (Search Algorithms) with List-II (Characteristics/Evaluation Functions): List-IList-II A. A* SearchI. Uses only heuristic function h(n) B. Greedy Best-First SearchII. Uses both heuristic and path cost (f(n) = g(n) + h(n)) C. Uniform Cost SearchIII. Search fails if the limit is smaller than the goal depth D. Depth-Limited SearchIV. Expands the node with the lowest path cost g(n) Choose the correct answer from the options given below:
- 1A-II, B-III, C-I, D-IV
- 2A-I, B-III, C-II, D-IV
- 3A-II, B-I, C-IV, D-III✓
- 4A-I, B-II, C-III, D-IV
Correct answer
A-II, B-I, C-IV, D-III
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Artificial Intelligence?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Artificial Intelligence