Interested to Buy Any Domain ? << Click Here >> for more details...
In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b
2813Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution
2250A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False
2051_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search
1 2854Hill-Climbing algorithm terminates when, a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) Local Min/Max is achieved
4229One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution
2149Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False
1963Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search
1 3638Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above
3926___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
3766_________________ 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) Only a) and b)
2155Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku
3272What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state
2230The 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
1 3966To 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
2252Post New AI Robotics Questions
Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS (MicroElectroMechanical System) d) None of the mentioned
What is the degree of freedom in the robotics?
What is travelling salesman problem?
What is lisp?
Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
In inductive logic programming what needed to be satisfied?
What are the laws of the robotics?
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned
What is “generality” in ai ?
What do you understand by 'humanoid robot'?
Mention the difference between statistical ai and classical ai ?
One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution
What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned
In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned
