QUESTION $1$

In depth$-$first search, which data structure is typically used for storing the frontier?

A$.$

Queue

B$.$

Stack

C$.$

Priority Queue

D$.$

Heap

$1$ points

QUESTION $2$

In breadth$-$first search, how are nodes expanded from the frontier?

A$.$

Nodes are expanded based on their depth in the search tree.

B$.$

Nodes are expanded based on their heuristic values.

C$.$

Nodes are expanded in a random order.

D$.$

Nodes are expanded in the order they were added to the frontier.

$1$ points

QUESTION $3$

What is the primary characteristic of Local Search algorithms?

A$.$

They guarantee to find the optimal solution.

B$.$

They systematically explore the entire search space.

C$.$

They focus on improving the current solution iteratively.

D$.$

They always expand nodes based on heuristic values.

$1$ points

QUESTION $4$

Which of the following statements about breadth$-$first search $($BFS$)$ is true?

A$.$

BFS is always faster than depth$-$first search.

B$.$

BFS guarantees the shortest path to the goal.

C$.$

BFS requires less memory compared to depth$-$first search.

D$.$

BFS is not suitable for infinite state spaces.

$1$ points

QUESTION $5$

In Genetic Algorithms, what does the term "mutation" refer to$?$

A$.$

The process of selecting individuals for reproduction.

B$.$

The process of generating new individuals by combining genetic material from parents.

C$.$

The process of randomly altering the genetic material of individuals.

D$.$

The process of evaluating the fitness of individuals in the population.

$1$ points

QUESTION $6$

Which of the following best describes the A$*$ algorithm's memory usage compared to other search algorithms?

A$.$

A$*$ uses more memory than uninformed search algorithms.

B$.$

A$*$ uses less memory than uninformed search algorithms.

C$.$

A$*$ uses the same amount of memory as uninformed search algorithms.

D$.$

A$*$ memory usage depends on the heuristic function used.

$1$ points

QUESTION $7$

What heuristic function is commonly used with the Greedy algorithm?

A$.$

Admissible heuristic

B$.$

Inadmissible heuristic

C$.$

Null heuristic

D$.$

Consistent heuristic

$1$ points

QUESTION $8$

Which characteristic distinguishes Simulated Annealing from other Local Search algorithms?

A$.$

It always moves to a neighboring state with a higher value.

B$.$

It uses temperature parameter to control the probability of accepting worse solutions.

C$.$

It explores the entire search space exhaustively.

D$.$

It guarantees to find the global optimum.

$1$ points

QUESTION $9$

What is the role of the heuristic function in A$*$ search?

A$.$

It provides an estimate of the cost from the start node to the current node.

B$.$

It determines the order in which nodes are expanded.

C$.$

It calculates the exact distance between nodes.

D$.$

It prevents the algorithm from exploring certain paths.

$1$ points

QUESTION $10$

What distinguishes Local Beam Search from other Local Search algorithms?

A$.$

It maintains multiple states and selects the best ones to continue the search.

B$.$

It always moves to the neighboring state with the highest value.

C$.$

It uses a population$-$based approach to explore the search space.

D$.$

It systematically explores the entire search space.

$1$ points

QUESTION $11$

Which heuristic is considered admissible in A$*$ search?

A$.$

One that underestimates the cost to reach the goal.

B$.$

One that overestimates the cost to reach the goal.

C$.$

One that provides an exact cost to reach the goal.

D$.$

One that is unrelated to the cost to reach the goal.

$1$ points

QUESTION $12$

What is the primary characteristic of an uninformed search algorithm?

A$.$

It explores the search space without considering the problem domain.

B$.$

It utilizes domain$-$specific knowledge.

C$.$

It prioritizes the expansion of nodes based on heuristic values.

D$.$

It always guarantees the optimal solution.

$1$ points

QUESTION $13$

Which uninformed search algorithm combines the advantages of both depth$-$first and breadth$-$first search?

A$.$

Uniform$-$Cost Search

B$.$

Bidirectional Search

C$.$

Iterative Deepening Search

D$.$

Greedy Best$-$First Search

$1$ points

QUESTION $14$

Which statement accurately describes the A$*$ algorithm?

A$.$

It is guaranteed to find the optimal solution.

B$.$

It expands nodes in a depth$-$first manner.

C$.$

It is admissible but not consistent.

D$.$

It is not suitable for problems with large search spaces.

$1$ points

QUESTION $15$

In Hill Climbing, what happens if no neighboring state has a higher value than the current state?

A$.$

The algorithm terminates.

B$.$

The algorithm moves to a random neighboring state.

C$.$

The algorithm moves to the highest$-$valued neighboring state found so far.

D$.$

The algorithm returns the