Menu

Problem Solving Questions

MCQ
81.
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
forum Discussion
MCQ
82.
Which of the Following problems can be modeled as CSP?
forum Discussion
MCQ
83.
What among the following constitutes to the incremental formulation of CSP?
forum Discussion
MCQ
84.
The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
forum Discussion
MCQ
85.
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________
forum Discussion
MCQ
86.
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure.
forum Discussion
MCQ
87.
Consider a problem of preparing a schedule for a class of student. What type of problem is this?
forum Discussion
MCQ
88.
Constraint satisfaction problems on finite domains are typically solved using a form of ___________
forum Discussion
MCQ
89.
Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
forum Discussion
MCQ
90.
____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.
forum Discussion
chevron_left BackPage 9 of 10Next chevron_right