____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.
a) Static CSPs
b) Dynamic CSPs
c) Flexible CSPs
d) None of the above

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
a) P complete
b) NP complete
c) NP hard
d) Domain dependent

Constraint satisfaction problems on finite domains are typically solved using a form of ___________.
a) Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) DFS/BFS Search Algorithms

Consider a problem of preparing a schedule for a class of student. This problem is a type of
a) Search Problem
b) Backtrack Problem
c) CSP
d) Planning Problem

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False.
a) True
b) False

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
a) Forward Searching
b) Constraint Propagation
c) Backtrack after a forward search
d) Omitting the constraints and focusing only on goals

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
a) Forward search
b) Backtrack search
c) Hill algorithm
d) Reverse-Down-Hill search

What among the following constitutes to the incremental formulation of CSP?
a) Path cost
b) Goal cost
c) Successor function
d) Objective function
e) Initial state

_________________ 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) Only a) and b)

___________ 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

Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next.
a) Needy local search
b) Heuristic local search
c) Greedy local search
d) Optimal local search

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.
a) True
b) False

Satellite Image Analysis System is (Choose the one that is not applicable).
a) Episodic
b) Semi-Static
c) Single agent
d) Partially Observable

36

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
a) P complete
b) NP complete
c) NP hard
d) Domain dependent

82

In A* approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

29

How the new states are generated in genetic algorithm?
a) Composition
b) Mutation
c) Cross-over
d) Both b & c

42

What is called as exploration problem?
a) State and actions are unknown to the agent
b) State and actions are known to the agent
c) Only actions are known to agent
d) Both b & c

78

Specify the agent architecture name that is used to capture all kinds of actions.
a) Complex
b) Relational
c) Hybrid
d) None of the mentioned

34

A problem solving approach works well for
a) 8-Puzzle problem
b) 8-queen problem
c) Finding a optimal path from a given source to a destination
d) Mars Hover (Robot Navigation)

39

In A* approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

29

Consider a problem of preparing a schedule for a class of student. This problem is a type of
a) Search Problem
b) Backtrack Problem
c) CSP
d) Planning Problem

133

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False.
a) True
b) False

126

Hill-Climbing algorithm terminates when,
a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) Local Min/Max is achieved

44

In which state spaces does the online-dfs-agent will work?
a) Irreversible state spaces
b) Reversible state spaces
c) searchable state spaces
d) All of the mentioned

37

What among the following constitutes to the incremental formulation of CSP?
a) Path cost
b) Goal cost
c) Successor function
d) Objective function
e) Initial state

69

Where does the performance measure is included?
a) Rational agent
b) Task environment
c) Actuators
d) Sensor

32

Agents behavior can be best described by
a) Perception sequence
b) Agent function
c) Sensors and Actuators
d) Environment in which agent is performing