Graph Algorithms Core

Assess paths trees and traversals.

1. Which graph traversal algorithm uses a queue to explore nodes level by level?
2. Which algorithm finds the shortest path from a single source to all other nodes in a weighted graph with non-negative edge weights?
3. Which data structure is optimal for representing a dense graph (many edges)?
4. Topological sorting is applicable to which type of graph?
5. Which MST algorithm grows the tree from a single node by adding the cheapest connecting edge?
6. Which traversal detects cycles in undirected graphs by tracking parent nodes?
7. Which algorithm detects negative weight cycles in a graph?
8. A graph with E = O(V) edges is classified as:
9. Which algorithms use a priority queue in their standard implementation?
10. Which are applications of Depth-First Search (DFS)?
11. Properties of a Minimum Spanning Tree (MST) include:
12. Valid graph representations include:
13. Algorithms that handle negative weight edges (no negative cycles) for shortest paths:
14. DFS uses a stack (explicitly or via recursion) to track nodes to visit.
15. Kruskal's algorithm uses union-find to avoid cycles when building an MST.
16. A single-node graph (no edges) has an MST with one edge.
17. A DAG has exactly one unique topological sort.
18. What does 'BFS' stand for in graph traversal?
19. Name the all-pairs shortest path algorithm (full name).
20. Abbreviation for the data structure Kruskal's uses to manage disjoint sets.
Answered 0 of 0 — 0 correct