AI searching techniques

What is the general term of Blind searching?

• Informed Search

• Uninformed Search

• Informed & Unformed Search

• Heuristic Search

Which of the following is/are Uninformed Search technique/techniques?

• Breadth First Search (BFS)

• Depth First Search (DFS)

• Bidirectional Search

• All of the mentioned

Which data structure conveniently used to implement BFS?

• Stacks

• Queues

• Priority Queues

• All of the mentioned

Which data structure conveniently used to implement DFS?

• Stacks

• Queues

• Priority Queues

• All of the mentioned

uniform-cost search expands the node n with the __________

• Lowest path cost

• Heuristic cost

• Highest path cost

• Average path cost

The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node.

• True

• False

What is Branching Factor?

• Length of the shortest path from initial state to goal state.

• The average number of child nodes in the problem space graph.

• A property of an algorithm to always find an optimal solution.

• None of the Above

What is Space Complexity of Depth First search algorithm?

• b

• b^2

• b^b

• b^m

Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?

• Uniform Cost Search

• Iterative Deepening Depth-First Search

• Bidirectional Search

• None of the Above

How many types are available in uninformed search method?

• 2

• 3

• 4

• 5