Title  

The working memory of the problem solver is like its _________________The working memory of the problem solver is like its _________________
The answer is:
B. short term memory


_____________search regresses over goals and validate a plan before returning it_____________search regresses over goals and validate a plan before returning it
The answer is:
B. backward state space


Which of the following combination of labels is not allowed for W joint in scene labelling is not allowedWhich of the following combination of labels is not allowed for W joint in scene labelling is not allowed
The answer is:
D. (←,←,←)


If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________
The answer is:
C. path consistent.


The __________algorithm explores the domain in a depth first mannerThe __________algorithm explores the domain in a depth first manner
The answer is:
A. backtracking


_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations
The answer is:
A. constraints satisfaction problems


Which of the Following problems can be modeled as CSP?Which of the Following problems can be modeled as CSP?
The answer is:
D. all of the mentioned


Backtracking is based on ____________Backtracking is based on ____________
The answer is:
D. both last in first out & recursion


The inference engine goes through which cycle?The inference engine goes through which cycle?
The answer is:
A. matchresolveexecute


The output of MATCH routine in Inference Engine is ______________The output of MATCH routine in Inference Engine is ______________
The answer is:
B. conflict set (cs)


Operator PUTDOWN has which of the following sequence of actions?Operator PUTDOWN has which of the following sequence of actions?2
The answer is:
D. holding(x),ontable(x)^armempty, holding(x)


Frame problem in STRIPS Domain can be solved by _____________________Frame problem in STRIPS Domain can be solved by _____________________
The answer is:
B. frame aximoms


PDDL stands for_________________________PDDL stands for_________________________
The answer is:
B. planning domain description language


planning data description language
The answer is:
C. first order logic notation


STRIPS operators are made up of which three components:
The answer is:
A. p: precondition list , a: add list , d:delete list


Which search algorithm imposes a fixed depth limit on nodes?
The answer is:
A. depthlimited search


In a rulebased system, procedural domain knowledge is in the form of:___________In a rulebased system, procedural domain knowledge is in the form of:___________
The answer is:
A. production rules


_____________ is a state that is better than all its neighboring states but is not better than some other states further away_____________ is a state that is better than all its neighboring states but is not better than some other states further away
The answer is:
B. local maximum


___________ algorithm keeps track of k states rather than just one___________ algorithm keeps track of k states rather than just one
The answer is:
B. local beam search


Which is the most straightforward approach for planning algorithm?Which is the most straightforward approach for planning algorithm?
The answer is:
B. statespace search

MCQs
Views
Best Answers
Points