Artificial Intelligence and Robotics (AIR) MCQs and Notes

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 1. 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 hold

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 2. 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 3. 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 4. ____ is/are the well known Expert System/s for medical diagnosis systems

(A) mysin

(B) caduceus

(C) dendral

(D) smh.pal

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 5. 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 6. ________ 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 7. ___________ 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 8. 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 9. 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

I

Indresh Gehalot • 10.11K Points
Tutor II

Q 10. STRIPS operators are made up of which three components:

(A) p: precondition list , a: add list , d:delete list

(B) p: postcondition list , a: add list , d:delete list

(C) p: precondition list , s: sub list , d:delete list

(D) p: postcondition list , s: sub list , d:delete list