Question 1

PDDL stands for_________________________

Accepted Answer

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

Question 2

Backtracking is based on ____________

Accepted Answer

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

Question 3

_____________ Procedure selects a flaw in a given plan and looks for a resolver.

Accepted Answer

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

Question 4

In a rule-based system, procedural domain knowledge is in the form of:___________

Accepted Answer

A) production rules 
B) rule interpreters 
C) meta-rules 
D) control rules 
A) production rules 
B) rule interpreters 
C) meta-rules 
D) control rules

Question 5

Which search algorithm imposes a fixed depth limit on nodes?

Accepted Answer

A) depth-limited search 
B) depth-first search 
C) iterative deepening search 
D) bidirectional search 
A) depth-limited search 
B) depth-first search 
C) iterative deepening search 
D) bidirectional search

Question 6

Which is the most straightforward approach for planning algorithm?

Accepted Answer

A) best-first search 
B) state-space search 
C) depth-first search 
D) hill-climbing search 
A) best-first search 
B) state-space search 
C) depth-first search 
D) hill-climbing search

Question 7

_______ is/are the well known Expert System/s for medical diagnosis systems

Accepted Answer

A) mysin 
B) caduceus 
C) dendral 
D) smh.pal 
A) mysin 
B) caduceus 
C) dendral 
D) smh.pal

Question 8

The output of MATCH routine in Inference Engine is ______________

Accepted Answer

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

Question 9

Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

Accepted Answer

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 
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

Question 10

Which of the Following problems can be modeled as CSP?

Accepted Answer

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

Question 11

STRIPS operators are made up of which three components:

Accepted Answer

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 
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

Question 12

In PDDL,the Language is based on _______________________

Accepted Answer

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

Question 13

Which of the following conditions must hold for a solution to a CSP?

Accepted Answer

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

Question 14

_____________ is a state that is better than all its neighboring states but is not better than some other states further away

Accepted Answer

A) plateau 
B) local maximum 
C) global maximum 
D) all of the above 
A) plateau 
B) local maximum 
C) global maximum 
D) all of the above

Question 15

_____________search regresses over goals and validate a plan before returning it.

Accepted Answer

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

Question 16

The inference engine goes through which cycle?

Accepted Answer

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

Question 17

The __________algorithm explores the domain in a depth first manner.

Accepted Answer

A) backtracking 
B) forward checking 
C) arc consistency 
D) strategic retreat 
A) backtracking 
B) forward checking 
C) arc consistency 
D) strategic retreat

Question 18

Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed

Accepted Answer

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

Question 19

Operator PUTDOWN has which of the following sequence of actions?

Accepted Answer

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) 
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)

Question 20

If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

Accepted Answer

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

PDDL stands for_________________________

Backtracking is based on ____________

_____________ Procedure selects a flaw in a given plan and looks for a resolver.

In a rule-based system, procedural domain knowledge is in the form of:___________

Which search algorithm imposes a fixed depth limit on nodes?

Which is the most straightforward approach for planning algorithm?

_______ is/are the well known Expert System/s for medical diagnosis systems

The output of MATCH routine in Inference Engine is ______________

Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

Which of the Following problems can be modeled as CSP?

STRIPS operators are made up of which three components:

In PDDL,the Language is based on _______________________

Which of the following conditions must hold for a solution to a CSP?

_____________ is a state that is better than all its neighboring states but is not better than some other states further away

_____________search regresses over goals and validate a plan before returning it.

The inference engine goes through which cycle?

The __________algorithm explores the domain in a depth first manner.

Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed

Operator PUTDOWN has which of the following sequence of actions?

If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

Knowledge Representation and Inference Mechanisms in Artificial Intelligence

Artificial Intelligence and Search Algorithms

State Space Planning and Ao Graph in AI

Filters

Exam 1: Problem Solving, Planning, and Expert Systems

PDDL stands for_________________________

Backtracking is based on ____________

_____________ Procedure selects a flaw in a given plan and looks for a resolver.

In a rule-based system, procedural domain knowledge is in the form of:___________

Which search algorithm imposes a fixed depth limit on nodes?

Which is the most straightforward approach for planning algorithm?

_______ is/are the well known Expert System/s for medical diagnosis systems

The output of MATCH routine in Inference Engine is ______________

Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

Which of the Following problems can be modeled as CSP?

STRIPS operators are made up of which three components:

In PDDL,the Language is based on _______________________

Which of the following conditions must hold for a solution to a CSP?

_____________ is a state that is better than all its neighboring states but is not better than some other states further away

_____________search regresses over goals and validate a plan before returning it.

The inference engine goes through which cycle?

The __________algorithm explores the domain in a depth first manner.

Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed

Operator PUTDOWN has which of the following sequence of actions?

If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

Knowledge Representation and Inference Mechanisms in Artificial Intelligence

Artificial Intelligence and Search Algorithms

State Space Planning and Ao Graph in AI

Filters