Q.1
##### _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
• a) Constraints Satisfaction Problems
• b) Uninformed Search Problems
• c) Local Search Problems
• d) All of the mentioned
Q.2
##### Which of the Following problems can be modeled as CSP?
• a) 8-Puzzle problem
• b) 8-Queen problem
• c) Map coloring problem
• d) All of the mentioned
Q.3
##### What among the following constitutes to the incremental formulation of CSP?
• a) Path cost
• b) Goal cost
• c) Successor function
• d) All of the mentioned
Q.4
##### 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.
• a) Forward search
• b) Backtrack search
• c) Hill algorithm
• d) Reverse-Down-Hill search
Q.5
##### To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________
• a) Forward Searching
• b) Constraint Propagation
• c) Backtrack after a forward search
• d) Omitting the constraints and focusing only on goals
Q.6
• a) True
• b) False
Q.7
##### Consider a problem of preparing a schedule for a class of student. What type of problem is this?
• a) Search Problem
• b) Backtrack Problem
• c) CSP
• d) Planning Problem
Q.8
##### Constraint satisfaction problems on finite domains are typically solved using a form of ___________
• a) Search Algorithms
• b) Heuristic Search Algorithms
• c) Greedy Search Algorithms
• d) All of the mentioned
Q.9
##### Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
• a) P complete
• b) NP complete
• c) NP hard
• d) Domain dependent
Q.10
##### ____________ 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.
• a) Static CSPs
• b) Dynamic CSPs
• c) Flexible CSPs
• d) None of the mentioned
Q.11
##### Flexible CSPs relax on _______
• a) Constraints
• b) Current State
• c) Initial State
• d) Goal State
Q.12
• a) Prolog
• b) C#
• c) C
• d) Fortrun
Q.13
##### Backtracking is based on ____________
• a) Last in first out
• b) First in first out
• c) Recursion
• d) Both Last in first out & Recursion
Q.14
• a) True
• b) False
Q.15
##### When do we call the states are safely explored?
• a) A goal state is unreachable from any state
• b) A goal state is denied access
• c) A goal state is reachable from every state
• d) None of the mentioned
Q.16