Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Perform and visualize A* Search

Choose difficulty:

Beginner

Intermediate

Advanced

Which of the following is the goal of the A* algorithm?

a: To find the shortest path between two points in a graph Explanation

Explanation

b: To find the longest path between two points in a graph Explanation

Explanation

c: To find all possible paths between two points in a graph Explanation

Explanation

d: To find the minimum spanning tree of a graph Explanation

Explanation

What is the heuristic function used in the A* algorithm?

a: Euclidean distance Explanation

Explanation

b: Manhattan distance Explanation

Explanation

c: Hamming distance Explanation

Explanation

d: Both a) and b) Explanation

Explanation

What is the significance of the A* algorithm's f-score?

a: It is the total cost of the path from the start node to the goal node. Explanation

Explanation

b: It is the heuristic estimate of the remaining cost from the current node to the goal node. Explanation

Explanation

c: It is the sum of the g-score and h-score of a node. Explanation

Explanation

d: It is the depth of a node in the search tree. Explanation

Explanation

Which data structure is used to store the open set in the A* algorithm?

a: A priority queue Explanation

Explanation

b: A stack Explanation

Explanation

c: A queue Explanation

Explanation

d: A linked list Explanation

Explanation

Which of the following is a drawback of the A* algorithm?

a: It always finds the shortest path between two points. Explanation

Explanation

b: It can get stuck in local optima. Explanation

Explanation

c: It is not suitable for large graphs Explanation

Explanation

d: It does not use a heuristic function. Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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