LM18-Searching with Partial Observations- Constraint Satisfaction Problems

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

1. Which of the Following problems can be modeled as CSP? 8-Puzzle problem 8-Queen problem Map coloring problem All of the mentioned

   All of the mentioned

2. What among the following constitutes to the incremental formulation of CSP? Path cost Goal cost Successor function All of the mentioned

   All of the mentioned

3. 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.

   Backtrack search

4. To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ______

   Forward Searching

5. Consider a problem of preparing a schedule for a class of student. What type of problem is this?

   CSP