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

Accepted Answer

The working memory of a problem solver functions similarly to short-term memory, where information is temporarily held and manipulated for cognitive tasks.

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

Accepted Answer

Backward state space search starts with the goal and works backwards to see if it can reach the initial state, effectively validating a plan before it is returned. This contrasts with forward state space search, which starts from the initial state and works forward towards the goal.

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

Accepted Answer

B

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)(?,?,?)

Accepted Answer

The answer of Which of the following combination of labels...

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

Accepted Answer

Path consistency refers to the condition in a Constraint Satisfaction Problem (CSP) where for every pair of variables, any consistent assignment can be extended to a third variable without causing inconsistency.

Question 6

The __________algorithm explores the domain in a depth first manner.
A)backtracking
B)forward checking
C)arc consistency
D)strategic retreat

Accepted Answer

The backtracking algorithm explores the domain by trying to move forward and if it encounters a dead end, it backtracks to try other paths, effectively exploring in a depth-first manner.

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

Accepted Answer

Constraint satisfaction problems are defined by a set of objects whose state must satisfy various constraints or limitations, fitting the description given.

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

Accepted Answer

All of the mentioned problems (8-puzzle, 8-queen, and map coloring) can be modeled as Constraint Satisfaction Problems (CSPs) because they involve finding solutions that meet a set of constraints.

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

Accepted Answer

The answer of Backtracking is based on ____________
A)last in first...

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

Accepted Answer

The inference engine operates in a cycle known as "match-resolve-execute." This cycle involves matching rules against known facts or data, resolving which rule to apply when multiple rules are matched, and executing the selected rule to generate new knowledge or actions.

Question 11

The output of MATCH routine in Inference Engine is ______________
A)pattern set
B)conflict set (cs)
C)rule set
D)action set

Accepted Answer

The MATCH routine in an inference engine generates a conflict set, which is a collection of rules that are applicable based on the current state of the working memory.

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)

Accepted Answer

The correct sequence for the PUTDOWN operator involves first holding the object (x), then placing it on the table (ontable(x)) and ensuring the arm is empty (armempty), before it can hold another object. This sequence ensures that an object is successfully put down before another can be picked up, reflecting the logical steps involved in putting down an object and freeing the arm for the next action.

Question 13

Frame problem in STRIPS Domain can be solved by _____________________
A)operator
B)frame aximoms
C)precondition
D)action

Accepted Answer

The frame problem in the STRIPS (Stanford Research Institute Problem Solver) domain is addressed by using frame axioms. Frame axioms are used to specify which facts remain unchanged after an action is performed, helping to overcome the issue of having to explicitly state all conditions that do not change with each 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

Accepted Answer

PDDL stands for Planning Domain Description Language, which is a language used in artificial intelligence for expressing planning and scheduling problems.

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

Accepted Answer

PDDL (Planning Domain Definition Language) is based on first-order logic notation, which allows for the representation of actions, objects, and their relationships in a more expressive manner than propositional logic.

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

Accepted Answer

STRIPS operators consist of a precondition list (p), which specifies the conditions under which the action can be performed; an add list (a), which specifies the positive effects of the action; and a delete list (d), which specifies the negative effects of the action.

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

Accepted Answer

Depth-limited search imposes a fixed depth limit, meaning it explores the search tree to a specific depth limit and does not go beyond that, unlike depth-first search which can potentially go to infinite depth if the tree is infinite and there is no solution.

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

Accepted Answer

Production rules are a fundamental component of rule-based systems, representing procedural domain knowledge as if-then statements that guide the system's decision-making process.

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

Accepted Answer

A local maximum refers to a point in a function that is higher than the points directly around it, but not necessarily the highest point overall. This fits the description of being better than neighboring states but not necessarily better than states further away.

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

Accepted Answer

Local beam search maintains multiple states (k states) simultaneously as opposed to traditional search algorithms that keep track of a single state. This approach allows it to explore multiple paths in the search space concurrently, potentially finding solutions more efficiently.

Quiz 1: Problem Solving, Planning, and Expert Systems

The working memory of the problem solver is like its _________________

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

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

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

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

The __________algorithm explores the domain in a depth first manner.

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

Which of the Following problems can be modeled as CSP?

Backtracking is based on ____________

The inference engine goes through which cycle?

The output of MATCH routine in Inference Engine is ______________

Operator PUTDOWN has which of the following sequence of actions?

Frame problem in STRIPS Domain can be solved by _____________________

PDDL stands for_________________________

In PDDL,the Language is based on _______________________

STRIPS operators are made up of which three components:

Which search algorithm imposes a fixed depth limit on nodes?

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

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

___________ algorithm keeps track of k states rather than just one.