Artificial Intelligence Quiz2-INFORMED SEARCH

What is the main advantage of the A* search algorithm compared to traditional search algorithms?

• It only considers the cost of the current node

• It provides an optimal path

• It focuses on the longest path

• It explores the graph randomly

Answer explanation

The main advantage of the A* search algorithm compared to traditional search algorithms is that it provides an optimal path.

Which two search algorithms does A* combine the advantages of?

• Dijkstra's algorithm and Greedy Best-First Search

• Breadth-First Search and Depth-First Search

• A* Search and Hill Climbing

• Simulated Annealing and Stochastic hill climbing

Answer explanation

A* combines the advantages of Dijkstra's algorithm (guarantees shortest path) and Greedy Best-First Search (uses heuristic to guide search).

What does the heuristic function h(n) estimate in the A* algorithm?

• The actual cost to get from the initial node to node n

• The estimated cost of getting from any given node n to the destination node

• The sum of the costs of node n outgoing edges

• The cost of moving from the current node to the destination node

Answer explanation

The estimated cost of getting from any given node n to the destination node

What does the evaluation function f(n) in A* algorithm represent?

• The combination of g(n) and h(n)

• The sum of the costs of node n outgoing edges

• The heuristic cost from node n to the destination node

• The actual cost to get from the initial node to node n

Answer explanation

The evaluation function f(n) in A* algorithm represents the combination of g(n) and h(n), where g(n) is the actual cost to get from the initial node to node n, and h(n) is the heuristic cost from node n to the destination node.

How does Riyaan select the courses to be enrolled in?

• Based on the highest value of difficulty level

• Randomly

• Based on the highest value of interest level

• Based on the lowest value of interest level

Answer explanation

Based on the lowest value of f(n)

What is the main idea behind A* algorithm's evaluation of each node?

• To evaluate based on the lowest h(n) value

• To evaluate based on the lowest f(n) value

• To evaluate based on the highest f(n) value

• To evaluate based on the highest g(n) value

Answer explanation

To evaluate based on the lowest f(n) value

What is the advantage of A* algorithm in terms of memory efficiency?

• It stores all nodes in the priority queue

• It stores only a limited number of nodes in the priority queue

• It stores all nodes in the closed list

• It stores only a limited number of nodes in the closed list

Answer explanation

The advantage of A* algorithm in terms of memory efficiency is that it stores only a limited number of nodes in the priority queue.

What is the main disadvantage of the A* search algorithm related to heuristic accuracy?

• It depends on the accuracy of the g(n) value

• It may not find an optimal path if the heuristic is unacceptable

• It depends on the accuracy of the h(n) value

• It may not find an optimal path if the heuristic is consistent

Answer explanation

The main disadvantage of the A* search algorithm related to heuristic accuracy is that it may not find an optimal path if the heuristic is unacceptable.

What is the bottleneck issue that can occur with the A* algorithm?

• Not exploring enough nodes

• Finding the optimal path too quickly

• Not reaching the destination node

• Exploring nodes far from the destination before reaching it

Answer explanation

Exploring nodes far from the destination before reaching it

What is the main advantage of Hill Climbing algorithm in terms of memory usage?

• It stores all visited nodes in memory

• It uses much less RAM compared to tree search methods

• It requires a large amount of memory

• It stores all nodes in the search tree

Answer explanation

The main advantage of Hill Climbing algorithm in terms of memory usage is that it uses much less RAM compared to tree search methods.