Top 50+ Solved Artificial Intelligence and Robotics (AIR) MCQ Questions Answer
Q. Which search algorithm imposes a fixed depth limit on nodes?
a. depth-limited search
b. depth-first search
c. iterative deepening search
d. bidirectional search
Q. In a rule-based system, procedural domain knowledge is in the form of:___________
a. production rules
b. rule interpreters
c. meta-rules
d. control rules
Q. _____________ is a state that is better than all its neighboring states but is not better than some other states further away
a. plateau
b. local maximum
c. global maximum
d. all of the above
Q. ___________ 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
Q. Which is the most straightforward approach for planning algorithm?
a. best-first search
b. state-space search
c. depth-first search
d. hill-climbing search
Q. _______ is/are the well known Expert System/s for medical diagnosis systems
a. mysin
b. caduceus
c. dendral
d. smh.pal
Q. Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
a. the boundary is defined as those nodes in closed that have at least one successor still in open
b. the nodes in closed that are not on the boundary are in the kernel
c. the number of relay nodes on each path is exactly one.
d. both a & b
Q. Which of the following algorithm is generally used CSP search algorithm?
a. breadth-first search algorithm
b. depth-first search algorithm
c. hill-climbing search algorithm
d. none of the mentioned
Q. Which of the following conditions must hold for a solution to a CSP?
a. all relations in all constraints must hold
b. at least one relation in all constraints must hold.
c. more than one relation in all constraints must hold.
d. all relations in at least one constraint must hol
Q. Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).
a. bss finds the optimal path while dcbss does not.
b. dcbss finds the optimal path while bss does not.
c. both bss and dcbss find the optimal path
d. neither bss and dcbss find the optimal path
Q. The performance of an agent can be improved by __________
a. learning
b. observing
c. perceiving
d. sensing
Q. __________ 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
Q. Which of the following is an extension of the semantic network?
a. expert systems
b. rule based expert systems
c. decision tree based networks
d. partitioned networks
Q. Tabu search is designed __________________________
a. as it does not follow aspiration criteria
b. to escape the trap of local optimality.
c. to unrecord forbidden moves, which are referred to as tabu moves .
d. all of the above