AI UNIT 2

Which of the following is the evaluation function in the A* technique?

• (A). Heuristic function

• (B). Path cost from the start node to the current node

• (C). Path cost from the start node to current node + Heuristic cost

• (D). Average of Path cost from the start node to the current node and Heuristic cost

We can implement the Best First search with the help of which data structure

• (A). Queue

• (B). Stack

• (C). Priority Queue

• (D). Circular Queue

A* algorithm is based on which of the following?

• (A). Breadth-First-Search

• (B). Depth-First –Search

• (C). Best-First-Search

• (D). Hill climbing

Heuristic function h(n) is …….?

• (A). Lowest path cost

• (B). The cheapest path from the root to the goal node

• (C). The estimated cost of the cheapest path from the root to the goal node

• (D). Average path cost

How many types are available in uninformed search method?

• 3

• 4

• 5

• 6

Answer explanation

The five types of uninformed search methods are breadth-first, Uniform cost, depth-first) depth-limited and bidirectional search

Among the given options, which search algorithm requires less memory?

• 1. Optimal Search

• 2. Depth First Search

• 1. Breadth-First Search

• 1. Linear Search

Which algorithm is used in the Game tree to make decisions of Win/Lose?

• 1. Heuristic Search Algorithm

• 1. DFS/BFS algorithm

• 1. Greedy Search Algorithm

• 1. Min/Max algorithm

The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final output is known as__.

4. None of the above

• 1. Depth-first search

• 1. Breadth-first search

• 1. Alpha-beta pruning

• 1. None of the above

The maximum depth to which the alpha-beta pruning can be applied.

• 1. Eight states

• 1. Six states

• 1. Ten states

• 1. Any depth

Which statement is valid for the Heuristic function?

• 1. he heuristic function is used to solve mathematical problems.

• 1. The heuristic function takes parameters of type string and returns an integer value.

• 1. The heuristic function does not have any return type.

• 1. The heuristic function calculates the cost of an optimal path between the pair of states.