UGC NET CSE | December 2015 | Part 3 | Question: 47

Question

In constraint satisfaction problem, constraints can be stated as

• A. Arithmetic equations and inequalities that bind the values of variables
• B. Arithmetic equations and inequalities that does not bind any restriction over variables
• C. Arithmetic equations that impose restrictions over variables
• D. Arithmetic equations that discard constraints over the given variables

Answer 1

Answer A

remember map coloring problem, it is a Constraint satisfaction problem.

We need mathematical equations and inequalities. So C and D are not the answer.

Inequalities are must to check whther constraintes are fullfilled.

Equation specify the constarint.

In a nutshell, A should be the proper choice

Answer 2

clearly ans is A  constraints satisfaction probems like cryptoarithmetic  problem(e.g. CROSS +ROAD =DANGER or SEND+MORE=MONEY) bind values of alphabets from 0 to 9  and there are equations and inequality which imposes these restrictions