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

What is Astar Algorithm use for?

a: Sorting arrays Explanation

Explanation

b: Pathfinding Explanation

Explanation

c: Image recognition Explanation

Explanation

d: Speech synthesis Explanation

Explanation

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

a: Stack Explanation

Explanation

b: Queue Explanation

Explanation

c: Heap Explanation

Explanation

d: Linked list Explanation

Explanation

Which of the following is NOT a component of the A* algorithm's heuristic function?

a: The cost to reach the current node Explanation

Explanation

b: The estimated cost to reach the goal from the current node Explanation

Explanation

c: The estimated distance to the goal from the current node Explanation

Explanation

d: The total cost of the path from the start node to the current node Explanation

Explanation

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

a: It always finds the optimal path Explanation

Explanation

b: It may take a long time to find the optimal path Explanation

Explanation

c: It only works for small graphs Explanation

Explanation

d: It cannot handle graphs with negative edge weights Explanation

Explanation

Which of the following is a modification of the A* algorithm that guarantees finding the shortest path in a graph with non-negative edge weights?

a: Dijkstra's algorithm Explanation

Explanation

b: Bellman-Ford algorithm Explanation

Explanation

c: Floyd-Warshall algorithm Explanation

Explanation

d: Johnson's algorithm Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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