Question 47Asked in UGC NET Computer Science, December 2015 (Paper II & III, Selected Questions)
In constraint satisfaction problem, constraints can be stated as ______
AArithmetic equations and inequalities that bind the values of variables
BArithmetic equations and inequalities that doesn't bind any restriction over variables
CArithmetic equations that impose restrictions over variables
DArithmetic equations that discard constraints over the given variables
Show answerHide answer
Correct answer: (A) Arithmetic equations and inequalities that bind the values of variables
Explanation
In a constraint satisfaction problem (e.g. the map colouring problem), constraints are expressed as arithmetic equations and inequalities that bind (restrict) the values of the variables. So option (a) is the proper choice.
From UGC NET Computer Science PYQ, December 2015 (Paper II & III, Selected Questions)