Computer Science · Artificial Intelligence
Match List-I (AI Concepts / Algorithms) with List-II (Descriptions / Limitations): List-IList-II A. Minimax AlgorithmI. Used in adversarial search problems like two-player games B. Alpha-Beta PruningII. Reduces the number of nodes evaluated in the search tree C. Hill ClimbingIII. May get stuck in local maxima or plateaus D. Simulated AnnealingIV. Uses randomness to escape local extrema based on a temperature schedule Choose the correct answer from the options given below:
- 1A-I, B-III, C-II, D-IV
- 2A-III, B-IV, C-I, D-II
- 3A-II, B-I, C-IV, D-III
- 4A-I, B-II, C-III, D-IV✓
Correct answer
A-I, B-II, C-III, D-IV
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