Deck 1: Problem Solving, Planning, and Expert Systems

Question 1

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

Answer 1

short term memory

Question 2

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

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

Answer 2

backward state space

Question 3

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

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

Answer 3

the plan space planning

Question 4

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

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

Question 5

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

Question 6

The __________algorithm explores the domain in a depth first manner.

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

Question 7

_________________ 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

Question 8

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

Question 9

Backtracking is based on ____________

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

Question 10

The inference engine goes through which cycle?

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

Question 11

The output of MATCH routine in Inference Engine is ______________

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

Question 12

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)

Question 13

Frame problem in STRIPS Domain can be solved by _____________________

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

Question 14

PDDL stands for_________________________

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

_____________ 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

Question 20

___________ 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

Question 21

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

Question 22

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

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

Question 23

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

Question 24

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

Question 25

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.