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

# Artificial Intelligence and Robotics (AIR) MCQs | Page - 2

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. 11) In PDDL,the Language is based on _______________________`

(A) propositional logic notation
(B) second order logic notation
(C) first order logic notation
(D) all of these

M

Tutor II

## `Q. 12) PDDL stands for_________________________`

(A) path data description language
(B) planning domain description language
(C) planning data description language
(D) path data deleted language

M

Tutor II

## `Q. 13) Frame problem in STRIPS Domain can be solved by _____________________`

(A) operator
(B) frame aximoms
(C) precondition
(D) action

M

Tutor II

## `Q. 14) Operator PUTDOWN has which of the following sequence of actions?`

(A) holding(x),ontable(x),holding(x)
(B) holding(x),armempty, holding(x)
(C) holding(x),ontable(x)
(D) holding(x),ontable(x)^armempty, holding(x)

M

Tutor II

## `Q. 15) The output of MATCH routine in Inference Engine is `

(A) pattern set
(B) conflict set (cs)
(C) rule set
(D) action set

M

Tutor II

## `Q. 16) The inference engine goes through which cycle?`

(A) match-resolve-execute
(B) execute-resolve-match
(C) resolve match match
(D) resolve match execute

M

Tutor II

## `Q. 17) Backtracking is based on ___________`

(A) last in first out
(B) first in first out
(C) recursion
(D) both last in first out & recursion

M

Tutor II

## `Q. 18) Which of the Following problems can be modeled as CSP?`

(A) 8-puzzle problemb.
(B) 8-queen problem
(C) map coloring problem
(D) all of the mentioned

M

Tutor II

## `Q. 19) ________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.`

(A) constraints satisfaction problems
(B) uninformed search problems
(C) local search problems
(D) all of the mentioned

M