A route-planning algorithm for autonomous delivery drones initially uses a brute-force approach to evaluate all possible routes. Which outcome occurs when the number of delivery locations increases substantially?

💡 Explanation

As the number of delivery locations grows, the number of possible routes increases factorially. The brute-force algorithm's runtime therefore grows factorially with the number of locations, because it must examine every possible route. Rather than memory decreasing or time decreasing, the computational cost explodes.

• If a cognitive architecture implements Bayesian probability theory to model beliefs, which outcome will occur if the architecture receives conflicting sensory data?
• An algorithm plots the convex hull of points representing drone flight paths; if two hulls intersect in 3D space, which outcome is most likely?
• A database system utilizes relational algebra. If a query involving a union operation results in increased cardinality, which cause explains this outcome?
• 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?
• What happens to the computational cost for an attacker when a cryptographic hash function loses its second preimage resistance?
• A cryptographic system relies on prime numbers exceeding 2^512. If a computationally weak random number generator occasionally produces composite numbers, which consequence follows?