ALLInterview.com :: Home Page
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   Errors
   Testimonials Refer this Site  Refer This Site to Your Friends  Site Map  Contact Us      
   
 
 Categories >> Software >> Artificial Intelligence >> AI Robotics
 
Suggest New Category 
 


 

Question Asked @ Answers Views     Select
 ____________ 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 above    1  60
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    0  61
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) DFS/BFS Search Algorithms    0  46
Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem    0  72
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. a) True b) False    0  79
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    0  49
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    0  57
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    0  54
 What 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    0  47
Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku    0  52
_________________ 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)    0  59
___________ 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    0  54
Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above    0  40
Hill 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    0  53
Stochastic 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    0  52
E-Mail New Answers        Answer Selected Questions        Post New ai-robotics Questions
 [1]   2   3   4   5   6   7    Next
 
 
 
 
 
Un-Answered Questions
 
 Question Views   Select
 
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned 16
he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data 30
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned 23
Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c 20
Which is used to select the particular environment to run the agent? a) Environment creator b) Environment Generator c) Both a & b d) None of the mentioned 28
 What is the expansion if PEAS in task environment? a) Peer, Environment, Actuators, Sense b) Perceiving, Enivornment, Actuators, Sensors c) Performance, Environment, Actuators, Sensors, d) None of the mentioned 29
How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c 32
What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned 35
 What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned 39
Hill 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 53
Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned 19
The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) Both a) and b) d) Neither a) nor b) 26
 What 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 47
What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n) 16
Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit 60
E-Mail New Answers        Answer Selected Questions