Constraints Satisfaction Problems Online Exam Quiz
Constraints Satisfaction Problems GK Quiz. Question and Answers related to Constraints Satisfaction Problems. MCQ (Multiple Choice Questions with answers about Constraints Satisfaction Problems
__ 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.
Options
A : Static CSPs
B : Dynamic CSPs
C : Flexible CSPs
D : None of the mentioned
___ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
Options
A : Constraints Satisfaction Problems
B : Uninformed Search Problems
C : Local Search Problems
D : All of the mentioned
An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called ___
Options
A : heuristic processing
B : cognitive science
C : relative symbolism
D : pattern matching
Backtracking is based on __
Options
A : Last in first out
B : First in first out
C : Recursion
D : Both Last in first out & Recursion
Consider a problem of preparing a schedule for a class of student. What type of problem is this?
Options
A : Search Problem
B : Backtrack Problem
C : CSP
D : Planning Problem
Constraint Propagation technique actually modifies the CSP problem.
Options
A : TRUE
B : FALSE
C : -
D : -
Constraint satisfaction problems on finite domains are typically solved using a form of ___
Options
A : Search Algorithms
B : Heuristic Search Algorithms
C : Greedy Search Algorithms
D : All of the mentioned
Flexible CSPs relax on ___
Options
A : Constraints
B : Current State
C : Initial State
D : Goal State
Language/Languages used for programming Constraint Programming includes __
Options
A : Prolog
B : C#
C : C
D : Fortrun
Nils Nilsson headed a team at SRI that created a mobile robot named ___
Options
A : Robotics
B : Dedalus
C : Shakey
D : Vax