Home / Engineering / Artificial Intelligence and Robotics (AIR) MCQs / Page 3

Artificial Intelligence and Robotics (AIR) MCQs | Page - 3

Dear candidates you will find MCQ questions of Artificial Intelligence and Robotics (AIR) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Tutor II

`Q. 21) If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be`

(A) arc consistent
(B) i- consistent
(C) path consistent
(D) 2- consistent

M

Tutor II

`Q. 22) If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be `

(A) arc consistent
(B) i- consistent
(C) path consistent.
(D) 2- consistent

M

Tutor II

(A) (+,-,+)
(B) (-,+,-)
(C) (←,+,←)
(D) (←,←,←)

M

Tutor II

`Q. 24) ____________ Procedure selects a flaw in a given plan and looks for a resolver.`

(A) goal stack planning
(B) recursive goal stack planning
(C) the plan space planning
(D) partial order planning

M

Tutor II

`Q. 25) ____search regresses over goals and validate a plan before returning it.`

(A) backward state space
(B) forward state space
(C) goa stack
(D) none of these

M

Tutor II

`Q. 26) The working memory of the problem solver is like its `

(A) long term memory
(B) short term memory
(C) permanent memory
(D) none of these

M

Tutor II

`Q. 27) 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

M

Tutor II

(A) learning
(B) observing
(C) perceiving
(D) sensing

M

Tutor II

`Q. 29) _______ 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

M