Computer Science · Artificial Intelligence
Match List-I with List-II in the context of Constraint Satisfaction Problems (CSP): List I (A) Arc Consistency (AC-3) (B) MRV heuristic (Backtracking) (C) Min-Conflicts (D) Forward Checking List II (I) Eliminates values inconsistent along arcs until all arcs are consistent (II) Selects variable with fewest legal values remaining (III) Local-search repair strategy; quickly fixes conflicts in large CSPs (IV) After each assignment, prunes future domains inconsistent with it
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - I, B - II, C - III, D - IV✓
- 2A - I, B - II, C - IV, D - III
- 3A - IV, B - III, C - II, D - I
- 4A - III, B - IV, C - I, D - II
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!
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