Assess students' ability to apply Dijkstra's algorithm to compute shortest-path distances and predecessor trees in connected weighted graphs with non-negative edge weights. Tasks include step-by-step execution on small example graphs (adjacency list or matrix), tracing priority-queue operations and distance updates, reconstructing shortest paths, and briefly explaining time complexity and the algorithm's limitation with negative weights.