Question 11 : 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. State whether True or False.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 12 : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
1. Forward Searching
2. Constraint Propagation
3. Backtrack after a forward search
4. Omitting the constraints and focusing only on goals
View Answer   Discuss with Members

Question 13 : 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.
1. Forward search
2. Backtrack search
3. Hill algorithm
4. Reverse-Down-Hill search
View Answer   Discuss with Members

Question 14 : What among the following constitutes to the incremental formulation of CSP?
1. Path cost
2. Goal cost
3. Successor function
4. All of the mentioned
View Answer   Discuss with Members

Question 15 : Which of the Following problems can be modeled as CSP?
1. 8-Puzzle problem
2. 8-Queen problem
3. Map coloring problem
4. All of the mentioned
View Answer   Discuss with Members

Question 16 : _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
1. Constraints Satisfaction Problems
2. Uninformed Search Problems
3. Local Search Problems
4. All of the mentioned
View Answer   Discuss with Members

Question 17 : Searching using query on Internet is, use of ___________ type of agent
1. Offline agent
2. Online agent
3. Both Offline & Online agent
4. Goal Based & Online agent
View Answer   Discuss with Members

Question 18 : Mark two main features of Genetic Algorithm
1. Fitness function & Crossover techniques
2. Crossover techniques & Random mutation
3. Individuals among the population & Random mutation
4. Random mutation & Fitness function
View Answer   Discuss with Members

Question 19 : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 20 : ___________ algorithm keeps track of k states rather than just one.
1. Hill-Climbing search
2. Local Beam search
3. Stochastic hill-climbing search
4. Random restart hill-climbing search
View Answer   Discuss with Members