AI: Search Methods for Problem Solving · End Term · 31 Aug 2025 · May 2025 term · Set QDB1

Question 26: CONSTRAINT SATISFACTION Consider a map colouring problem…

Question 26

+1 markOne correct option

CONSTRAINT SATISFACTION

Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent to each other, and the regions are being processed in the order A,B,C.

The domains are:

$D_A = \{r, b, g\}$

$D_B = \{r, b\}$

$D_C = \{r, b\}$

Draw the constraint graph for the above problem and answer the sub-questions.

Is the given CSP arc consistent?

A
Yes
B
No
C
Cannot be determined

Show answer

Correct answer

A
Yes

See the whole paper Take it as a mock test

Question 26 of 28 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA AN EXAM QDD3 31 Aug 2025). It carries 1 mark.

More questions from this paper

Q1Figure question
Q2What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO…
Q3NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.\ Answer format: S,X,Y,Z
Q4What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.\ …
Q5For the given map, which algorithm finds the shortest path from S to G?
Q6Select the correct statement(s) about the given graph.
Q7TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
Q8TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
Q9TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
Q10TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
Q11TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
Q12GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
Q13GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
Q14GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
Q15GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
Q16PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
Q17PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
Q18PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
Q19RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
Q20RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
Q21RULE BASED EXPERT SYSTEMS\ A Rete Net for a rule based system to identify engines, turbines and motors is shown in the …
Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
Q25AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Based on the…
Q27CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…
Q28CONSTRAINT SATISFACTION Consider a map colouring problem with 3 regions {A,B,C}, where all three regions are adjacent t…