a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned Answer: d ...
View QuestionConsider 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 Answer: c
View QuestionTo 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 ...
View QuestionThe 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 Answer: b Explanation: ...
View QuestionWhat among the following constitutes to the incremental formulation of CSP?
a) Path cost b) Goal cost c) Successor function d) All of the mentioned Answer: ...
View QuestionWhich 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 Answer: d Explanation: ...
View Question_________________ 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 ...
View QuestionA* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.
a) true b) false Answer: a Explanation: A* is optimal if h(n) is an admissible ...
View QuestionWhat is the evaluation function in A* approach?
a) Heuristic function b) Path cost from start node to current node c) Path cost from start node ...
View QuestionWhat is the space complexity of Greedy search?
a) O(b) b) O(bl) c) O(m) d) O(bm) Answer: d Explanation: O(bm) is the space complexity where ...
View Question