QUESTION $16$

In the A$*$ algorithm, the cost function consists of:

A$.$

g$($n$)$

B$.$

h$($n$)$

C$.$

Both g$($n$)$ and h$($n$)$

D$.$

Neither g$($n$)$ nor h$($n$)$

$1$ points

QUESTION $17$

A$*$ algorithm can degenerate into a breadth$-$first search if:

A$.$

The heuristic function is admissible.

B$.$

The heuristic function is consistent.

C$.$

The heuristic function is inadmissible.

D$.$

The heuristic function is null.

$1$ points

QUESTION $18$

Which uninformed search algorithm is guaranteed to find the optimal solution if all step costs are identical?

A$.$

Depth$-$First Search

B$.$

Breadth$-$First Search

C$.$

Uniform$-$Cost Search

D$.$

Greedy Best$-$First Search

$1$ points

QUESTION $19$

A$*$ algorithm is complete if:

A$.$

There is a finite solution path.

B$.$

There are no loops in the search space.

C$.$

The heuristic function is admissible.

D$.$

The heuristic function is consistent.

$1$ points

QUESTION $20$

Which of the following best describes the Greedy algorithm in informed search?

A$.$

It expands the node that is estimated to be closest to the goal.

B$.$

It expands all nodes uniformly across the search space.

C$.$

It randomly selects nodes for expansion.

D$.$

It explores nodes based on their depth in the search tree.