Artificial Intelligence And Robotics Set 1

Computer Science Engineering (CSE)

Practice Mode Next
On This Page

This set of Artificial Intelligence and Robotics AIR Multiple Choice Questions & Answers (MCQs) focuses on Artificial Intelligence And Robotics Set 1

Q1 | The working memory of the problem solver is like its _________________
  • long term memory
  • short term memory
  • permanent memory
  • none of these
Answer: short term memory
Q2 | _____________search regresses over goals and validate a plan before returning it.
  • forward state space
  • backward state space
  • goa stack
  • none of these
Answer: backward state space
Q3 | _____________ Procedure selects a flaw in a given plan and looks for a resolver.
  • goal stack planning
  • the plan space planning
  • recursive goal stack planning
  • partial order planning
Answer: the plan space planning
Q4 | Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed
  • (+,-,+)
  • (-,+,-)
  • (←,+,←)
  • (←,←,←)
Answer: (←,←,←)
Q5 | 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.
  • 2- consistent
Answer: path consistent.
Q6 | The __________algorithm explores the domain in a depth first manner.
  • backtracking
  • forward checking
  • arc consistency
  • strategic retreat
Answer: backtracking
Q7 | _________________ 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
Answer: constraints satisfaction problems
Q8 | Which of the Following problems can be modeled as CSP?
  • 8-puzzle problemb.
  • 8-queen problem
  • map coloring problem
  • all of the mentioned
Answer: all of the mentioned
Q9 | Backtracking is based on ____________
  • last in first out
  • first in first out
  • recursion
  • both last in first out & recursion
Answer: both last in first out & recursion
Q10 | The inference engine goes through which cycle?
  • match-resolve-execute
  • execute-resolve-match
  • resolve match match
  • resolve match execute
Answer: match-resolve-execute
Q11 | The output of MATCH routine in Inference Engine is ______________
  • pattern set
  • conflict set (cs)
  • rule set
  • action set
Answer: conflict set (cs)
Q12 | Operator PUTDOWN has which of the following sequence of actions?
  • holding(x),ontable(x),holding(x)
  • holding(x),armempty, holding(x)
  • holding(x),ontable(x)
  • holding(x),ontable(x)^armempty, holding(x)
Answer: holding(x),ontable(x)^armempty, holding(x)
Q13 | Frame problem in STRIPS Domain can be solved by _____________________
  • operator
  • frame aximoms
  • precondition
  • action
Answer: frame aximoms
Q14 | PDDL stands for_________________________
  • path data description language
  • planning domain description language
  • planning data description language
  • path data deleted language
Answer: planning domain description language
Q15 | In PDDL,the Language is based on _______________________
  • propositional logic notation
  • second order logic notation
  • first order logic notation
  • all of these
Answer: first order logic notation
Q16 | 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
Answer: p: precondition list , a: add list , d:delete list
Q17 | Which search algorithm imposes a fixed depth limit on nodes?
  • depth-limited search
  • depth-first search
  • iterative deepening search
  • bidirectional search
Answer: depth-limited search
Q18 | In a rule-based system, procedural domain knowledge is in the form of:___________
  • production rules
  • rule interpreters
  • meta-rules
  • control rules
Answer: production rules
Q19 | _____________ 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
Answer: local maximum
Q20 | ___________ 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
Answer: local beam search
Q21 | Which is the most straightforward approach for planning algorithm?
  • best-first search
  • state-space search
  • depth-first search
  • hill-climbing search
Answer: state-space search
Q22 | _______ is/are the well known Expert System/s for medical diagnosis systems
  • mysin
  • caduceus
  • dendral
  • smh.pal
Answer: mysin
Q23 | Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
  • the boundary is defined as those nodes in closed that have at least one successor still in open
  • the nodes in closed that are not on the boundary are in the kernel
  • the number of relay nodes on each path is exactly one.
  • both a & b
Answer: both a & b
Q24 | Which of the following algorithm is generally used CSP search algorithm?
  • breadth-first search algorithm
  • depth-first search algorithm
  • hill-climbing search algorithm
  • none of the mentioned
Answer: depth-first search algorithm
Q25 | Which of the following conditions must hold for a solution to a CSP?
  • all relations in all constraints must hold
  • at least one relation in all constraints must hold.
  • more than one relation in all constraints must hold.
  • all relations in at least one constraint must hold.
Answer: at least one relation in all constraints must hold.
Next