Artificial Intelligence and Robotics (AIR) solved MCQs

Title
The working memory of the problem solver is like its _________________ The working memory of the problem solver is like its _________________ long term memory short term memory permanent memory none of these discuss 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 forward state space backward state space goa stack none of these discuss 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 allowed Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed (+,-,+) (-,+,-) (←,+,←) (←,←,←) discuss 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 _________________ arc consistent i- consistent path consistent. consistent discuss The answer is: C. path consistent.
The __________algorithm explores the domain in a depth first manner The __________algorithm explores the domain in a depth first manner backtracking forward checking arc consistency strategic retreat discuss 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 constraints satisfaction problems uninformed search problems local search problems all of the mentioned discuss 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? 8-puzzle problemb. 8-queen problem map coloring problem all of the mentioned discuss The answer is: D. all of the mentioned
Backtracking is based on ____________ Backtracking is based on ____________ last in first out first in first out recursion both last in first out & recursion discuss The answer is: D. both last in first out & recursion
The inference engine goes through which cycle? The inference engine goes through which cycle? match-resolve-execute execute-resolve-match resolve match match resolve match execute discuss The answer is: A. match-resolve-execute
The output of MATCH routine in Inference Engine is ______________ The output of MATCH routine in Inference Engine is ______________ pattern set conflict set (cs) rule set action set discuss 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 holding(x),ontable(x),holding(x) holding(x),armempty, holding(x) holding(x),ontable(x) holding(x),ontable(x)^armempty, holding(x) discuss 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 _____________________ operator frame aximoms precondition action discuss The answer is: B. frame aximoms
PDDL stands for_________________________ PDDL stands for_________________________ path data description language planning domain description language planning data description language planning data description language discuss The answer is: B. planning domain description language
planning data description language planning data description language second order logic notation first order logic notation all of these discuss The answer is: C. first order logic notation
STRIPS operators are made up of which three components: p: precondition list , a: add list , d:delete list p: postcondition list , a: add list , d:delete list p: precondition list , s: sub list , d:delete list p: postcondition list , s: sub list , d:delete list discuss The answer is: A. p: precondition list , a: add list , d:delete list
Which search algorithm imposes a fixed depth limit on nodes? depth-limited search depth-first search iterative deepening search bidirectional search discuss The answer is: A. depth-limited search
In a rule-based system, procedural domain knowledge is in the form of:___________ In a rule-based system, procedural domain knowledge is in the form of:___________ production rules rule interpreters meta-rules control rules discuss 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 plateau local maximum global maximum all of the above discuss 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 hill-climbing search local beam search stochastic hill-climbing search random restart hill-climbing search discuss 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? best-first search state-space search depth-first search hill-climbing search discuss The answer is: B. state-space search

Title