### questions

Title
###### The working memory of the problem solver is like its _________________

The working memory of the problem solver is like its _________________

1. long term memory
2. short term memory
3. permanent memory
4. none of these
###### _____________search regresses over goals and validate a plan before returning it

_____________search regresses over goals and validate a plan before returning it

1. forward state space
2. backward state space
3. goa stack
4. none of these
###### Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed

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

1. (+,-,+)
2. (-,+,-)
3. (←,+,←)
4. (←,←,←)
###### If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

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

1. arc consistent
2. i- consistent
3. path consistent.
4. consistent
###### The __________algorithm explores the domain in a depth first manner

The __________algorithm explores the domain in a depth first manner

1. backtracking
2. forward checking
3. arc consistency
4. strategic retreat
###### _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations

_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations

1. constraints satisfaction problems
2. uninformed search problems
3. local search problems
4. all of the mentioned
###### Which of the Following problems can be modeled as CSP?

Which of the Following problems can be modeled as CSP?

1. 8-puzzle problemb.
2. 8-queen problem
3. map coloring problem
4. all of the mentioned
###### Backtracking is based on ____________

Backtracking is based on ____________

1. last in first out
2. first in first out
3. recursion
4. both last in first out & recursion
###### The inference engine goes through which cycle?

The inference engine goes through which cycle?

1. match-resolve-execute
2. execute-resolve-match
3. resolve match match
4. resolve match execute
###### The output of MATCH routine in Inference Engine is ______________

The output of MATCH routine in Inference Engine is ______________

1. pattern set
2. conflict set (cs)
3. rule set
4. action set
###### Operator PUTDOWN has which of the following sequence of actions?

Operator PUTDOWN has which of the following sequence of actions?2

1. holding(x),ontable(x),holding(x)
2. holding(x),armempty, holding(x)
3. holding(x),ontable(x)
4. holding(x),ontable(x)^armempty, holding(x)
###### Frame problem in STRIPS Domain can be solved by _____________________

Frame problem in STRIPS Domain can be solved by _____________________

1. operator
2. frame aximoms
3. precondition
4. action
###### PDDL stands for_________________________

PDDL stands for_________________________

1. path data description language
2. planning domain description language
3. planning data description language
4. planning data description language
###### planning data description language

1. planning data description language
2. second order logic notation
3. first order logic notation
4. all of these
###### STRIPS operators are made up of which three components:

1. p: precondition list , a: add list , d:delete list
2. p: postcondition list , a: add list , d:delete list
3. p: precondition list , s: sub list , d:delete list
4. p: postcondition list , s: sub list , d:delete list
###### Which search algorithm imposes a fixed depth limit on nodes?

1. depth-limited search
2. depth-first search
3. iterative deepening search
4. bidirectional search
###### In a rule-based system, procedural domain knowledge is in the form of:___________

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

1. production rules
2. rule interpreters
3. meta-rules
4. control rules
###### _____________ is a state that is better than all its neighboring states but is not better than some other states further away

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

1. plateau
2. local maximum
3. global maximum
4. all of the above
###### ___________ algorithm keeps track of k states rather than just one

___________ algorithm keeps track of k states rather than just one

1. hill-climbing search
2. local beam search
3. stochastic hill-climbing search
4. random restart hill-climbing search
###### Which is the most straightforward approach for planning algorithm?

Which is the most straightforward approach for planning algorithm?

1. best-first search
2. state-space search
3. depth-first search
4. hill-climbing search

MCQs

Views

Points