Virtual Labs

Consider a Best-First Search algorithm applied to a search space with a branching factor of 3. If the maximum depth of the search space is 5, how many nodes will be expanded in the worst case scenario?

a: 15 Explanation

Explanation

b: 243 Explanation

Explanation

c: 45 Explanation

Explanation

d: 121 Explanation

Explanation

If h1 and h2 are two admissible heuristics for a given problem, then heuristic h3(n) = max(h1(n), h2(n)) for all states, n, must also be admissible.

a: True Explanation

Explanation

b: False Explanation

Explanation

Consider the problem of getting from Iasi to Fagaras in the simplified map of Romania (Figure 1). Which of the following will occur using BFS?

a: An optimal path will be found from Iasi to Fagaras. Explanation

Explanation

b: A non-optimal path will be found from Iasi to Fagaras. Explanation

Explanation

c: Fagaras will never be reached. Explanation

Explanation

d: None of the above Explanation

Explanation

In a Best-First Search algorithm, which of the following evaluation functions is not suitable for solving a maze navigation problem?

a: Number of steps taken from the start to the current node Explanation

Explanation

b: Manhattan distance from the current node to the goal node Explanation

Explanation

c: Euclidean distance from the current node to the goal node Explanation

Explanation

d: Randomly generated value assigned to each node Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)