AI and ES Unit 2

 Depth-First Search is implemented with _______ data structure.

• LIFO

• FIFO

• LILO

• Priority Queue

Best First search expands the node n with the __________

• Heuristic cost

• Average path cost

• lowest path cost

• highest path cost

When is breadth-first search optimal?

 

• when there is more number of nodes

• when there is less number of nodes

• when all step costs are unequal

• when all step costs are equal

Which data structure conveniently used to implement Best First Search?

• Queue

• linked list

• stacks

• priority queue

  What is the major component/components for measuring the performance of problem solving?

• Completeness

• optimality

• All of these

• time complexity

     Which is the best way to go for Game playing problem?

• Optimal approach

• Heuristic approach (Some knowledge is stored)

• Linear approach

• Random approach

What is Space Complexity of Depth First search algorithm?

• O(4b)

• O(b^2)
  

• O(b^b)
  

• O(bm)

The process of removing detail from a given state representation is called ______

• Abstraction

• Concrete

• Information Retrieval

• Extraction

 A* algorithm is based on __________

• Breadth first search

• Depth first search

• Best first search

• Uniform cost search

What is Time Complexity of Breadth First search algorithm?

 

• O(b^b)

• O(b^d)

• O(b*2)

• O(b*2d)