AI Unit-1 Quiz

Which data structure will be used in BFS

• list

• queue

• stack

• all

Which data structure is used in DFS

• list

• stack

• queue

• all

Which search technique increases depth in each iteration

• BFS

• DFS

• DFID

• Bidirectional search

Which search technique searches in two directions simultaneously

• BFS

• DFS

• Bidirectional

• DFID

Which of the following is not a heuristic search

• Hill Climbing

• Best First search

• DFID

• Branch and Bound

In A* algorithm, F=g+h. What is g

• estimated cost from start node to current node

• Estimated cost from current node to goal node

• cost from start node to current node

• cost from current node to goal node

In alpha-beta pruning what is the condition to stop the process

• β>=α

• α<=β

• α>=β

• all

In which search technique only W best nodes will be considered at each level

• Beam search

• Bidirectional Search

• Best First Search

• BFS

Uniform Cost Search is the other name for _____ search

• Hill Climbing

• Branch and Bound

• Best First

• Beam

What is the condition for MAX winning

• All Successors are WIN

• Any of Successors WIN

• All Successors are LOSS

• Any of Successors LOSS