Question 1

What is true aboout Iterative Deepening DFS?

Accepted Answer

A)  it does not perform dfs in a bfs fashion.
B)  it is the preferred informed search method
C)  it's a depth first search, but it does it one level at a time, gradually increasing the limit, until a goal is found.
D)  is a depth-first search with a fixed depth limit l C

Question 2

In Forward State Space Planning , Progress ( A, S) function returns ___________________

Accepted Answer

A)  the successor state s when action a is applied to state s.
B)  the predecessor state s when action a is applied to state s.
C)  both a & b
D)  none of the above A

Question 3

Tabu search is designed __________________________

Accepted Answer

A)  as it does not follow aspiration criteria
B)  to escape the trap of local optimality.
C)  to unrecord forbidden moves, which are referred to as tabu moves .
D)  all of the above B

Question 4

Production/Rule looks like________________

Accepted Answer

A)  pattern-->data
B)  action-->data
C)  pattern-->action
D)  none of the above

Question 5

Which is not problem in Hill climing?

Accepted Answer

A)  plateau
B)  ridges
C)  local maximum
D)  landscape

Question 6

What is Hyper-Edge in AO Graph?

Accepted Answer

A)  many edges together can be hyber edge
B)  those are and edges only
C)  both 1 and 2
D)  none of the above

Question 7

effects? (a) in Forward State Space Planning denotes ___________________

Accepted Answer

A)  denotes the set of negative effects of action a
B)  denotes the set of neutral effects of action a
C)  denotes the set of positive effects of action a
D)  none of the above

Question 8

What is used to lable primitive problems in AO problem?

Accepted Answer

A)  unvisited
B)  unsolved
C)  solved
D)  visited

Question 9

Plan representation in Plan Space Planning is done with__ -----------links

Accepted Answer

A)  binding links
B)  ordering links and casual link
C)  contigent link
D)  head step

Question 10

How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

Accepted Answer

A)  by traversing multiple node
B)  by deleting one of the node
C)  by addition of extra node
D)  none of the above

Question 11

Which are the first AI applications of AO graph?

Accepted Answer

A)  saint
B)  xcon
C)  dendral
D)  both a and c

Question 12

What arcs represents in AO Graph?

Accepted Answer

A)  subproblem to be solved individually
B)  solution
C)  path
D)  sequence of actions

Question 13

In Backward State Space Planning ,regress(A,G) that returns ______________________________

Accepted Answer

A)  the regressed goal over action a when applied to goal g.
B)  the goal state over action a when applied to goal g.
C)  the initial state over action a when applied to goal g.
D)  both a & b

Question 14

What are the drawbacks of Forward State Space Planning?

Accepted Answer

A)  fssp has very huge search space
B)  it includes the actions that have nothing go do with achieving the goal
C)  regression is used in forward state space planning
D)  both a & b

Question 15

What cost is assumed for arc while solving AO* progress example?

Accepted Answer

A)  0
B)  1
C)  2
D)  3

Question 16

What is true about Backward State Space Planning?

Accepted Answer

A)  goal states are often incompletely specified.
B)  expresses only what is desired in the final state, rather than a complete description of the final state.
C)  it uses regression
D)  all of the above

Question 17

What is the heuristic cost of SOLVED nodes in AO* example?

Accepted Answer

A)  0
B)  1
C)  2
D)  3

Question 18

Arc consistency in AO graph is concernd with ____________________________________

Accepted Answer

A)  nodes
B)  finding consistent values for pairs of variables.
C)  unary constraint
D)  all of the above

Question 19

A planning problem P in BSSP is defined as a _____________

Accepted Answer

A)  triple (s, g, o) 
B)  triple (s1, s2, o) 
C)  triple (g1, g, o) 
D)  none of the above

Question 20

Backward State Space Planning (BSSP)_______________________________

Accepted Answer

A)  simply explores the set of all future states in possible order
B)  start searching backwards from the goal
C)  leads to huge search space
D)  has no sense of direction

Exam 4: State Space Planning and Ao Graph in AI

What is true aboout Iterative Deepening DFS?

In Forward State Space Planning , Progress ( A, S) function returns ___________________

Tabu search is designed __________________________

Production/Rule looks like________________

Which is not problem in Hill climing?

What is Hyper-Edge in AO Graph?

effects? (a) in Forward State Space Planning denotes ___________________

What is used to lable primitive problems in AO problem?

Plan representation in Plan Space Planning is done with__ -----------links

How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

Which are the first AI applications of AO graph?

What arcs represents in AO Graph?

In Backward State Space Planning ,regress(A,G) that returns ______________________________

What are the drawbacks of Forward State Space Planning?

What cost is assumed for arc while solving AO* progress example?

What is true about Backward State Space Planning?

What is the heuristic cost of SOLVED nodes in AO* example?

Arc consistency in AO graph is concernd with ____________________________________

A planning problem P in BSSP is defined as a _____________

Backward State Space Planning (BSSP) _______________________________