If a programmer uses dynamic programming to solve the all-pairs shortest path problem for a directed graph, what memory scaling behavior occurs relative to the number of vertices?

💡 Explanation

The Floyd-Warshall algorithm, a dynamic programming approach for the all-pairs shortest path, stores a distance matrix. Because the matrix requires space for each pair of vertices, the memory scales quadratically, O(V^2); therefore quadratic scaling is correct, rather than linear, logarithmic, or exponential scaling.

• A recursive function calculates factorials. What happens if the base case (n=0) is omitted, causing infinite recursion?
• Which outcome occurs when a context-free grammar (CFG) is used to define a formal language with inherently ambiguous structures?
• If a digital elevation model (DEM) representing mountainous terrain is simplified by successively removing vertices, which effect ultimately compromises accurate pathfinding?
• A Las Vegas algorithm searches a linked list. If re-sampling a random node takes too long, what occurs?
• If implementing a Tower of Hanoi solver, which outcome occurs when the base case lacks a stopping condition?
• An engineer is designing a compiler that translates regular expressions into finite automata. If the regular expression contains nested quantifiers, which effect dominates during automaton construction?