Computer Science · Artificial Intelligence
Match List-I (Search Algorithms) with List-II (Core Data Structures / Principles): List-IList-II A. Depth-First SearchI. Uses a priority queue based on a heuristic function B. Breadth-First SearchII. Combines the advantages of DFS and BFS space/time complexities C. Best-First SearchIII. Uses a FIFO queue data structure D. Iterative Deepening SearchIV. Uses a LIFO stack data structure Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-IV, B-III, C-I, D-II✓
- 2A-I, B-III, C-IV, D-II
- 3A-II, B-I, C-IV, D-III
- 4A-I, B-II, C-III, D-IV
Correct answer
A-IV, B-III, C-I, D-II
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Artificial Intelligence MCQs →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