Virtual Labs

What makes A* different from Dijkstra’s algorithm?

a: A* only works on unweighted graphs Explanation

Explanation

b: A* uses a heuristic to guide the search Explanation

Explanation

c: A* does not guarantee shortest path Explanation

Explanation

d: A* ignores actual path cost Explanation

Explanation

What condition ensures A* finds the optimal path?

a: Heuristic is admissible (never overestimates) Explanation

Explanation

b: Heuristic is always zero Explanation

Explanation

c: Graph has no cycles Explanation

Explanation

d: Graph is unweighted Explanation

Explanation

Which of the following is a drawback of A*?

a: It always fails on large graphs Explanation

Explanation

b: It may take high memory and time Explanation

Explanation

c: It cannot handle positive edge weights Explanation

Explanation

d: It ignores heuristics Explanation

Explanation

If h(n) = 0 for all nodes, A* becomes:

a: Greedy Best First Search Explanation

Explanation

b: Breadth First Search Explanation

Explanation

c: Dijkstra’s Algorithm Explanation

Explanation

d: Depth First Search Explanation

Explanation

Which type of heuristic makes A* efficient and optimal?

a: Overestimating heuristic Explanation

Explanation

b: Admissible heuristic Explanation

Explanation

c: Random heuristic Explanation

Explanation

d: Non-monotonic heuristic Explanation

Explanation

Which data structure is typically used to implement the OPEN list?

a: Stack Explanation

Explanation

b: Queue Explanation

Explanation

c: Priority Queue (Min-Heap) Explanation

Explanation

d: Hash Table Explanation

Explanation

In pathfinding on a grid, Manhattan distance is best used when:

a: Diagonal moves are allowed Explanation

Explanation

b: Only horizontal and vertical moves are allowed Explanation

Explanation

c: Graph is weighted Explanation

Explanation

d: Graph is unweighted Explanation

Explanation

What is the formula used in A* search?

a: f(n) = g(n) + h(n) Explanation

Explanation

b: f(n) = g(n) - h(n) Explanation

Explanation

c: f(n) = g(n) * h(n) Explanation

Explanation

d: f(n) = h(n) - g(n) Explanation

Explanation

Which of the following is an application of A*?

a: Sorting numbers Explanation

Explanation

b: Pathfinding in GPS systems Explanation

Explanation

c: Data compression Explanation

Explanation

d: Text translation Explanation

Explanation

Which part of the evaluation function ensures real path cost?

a: f(n) Explanation

Explanation

b: g(n) Explanation

Explanation

c: h(n) Explanation

Explanation

d: Both g(n) and h(n) Explanation

Explanation

Perform and visualize A* Search