If a Las Vegas algorithm runs for an unusually long duration on an embedded system, which consequence follows?

💡 Explanation

A Las Vegas algorithm always produces a correct result, but its runtime is probabilistic. Therefore, when it exceeds a time threshold, the embedded system's scheduling mechanism restarts the algorithm with a new random seed, rather than risking an incorrect result after an abnormally long computation.

• An algorithm repeatedly processes a dataset. If a potential function, defined as the sum of unprocessed data elements, strictly decreases with each iteration, which consequence follows?
• If a web server experiences a power outage independent of network connectivity, which outcome reflects their conditional independence?
• What happens to the chromatic number of a directed acyclic graph when the number of nodes doubles?
• An automated lumber mill uses decision trees to classify wood. Which outcome occurs when a decision tree excessively branches in classifying lumber?
• A cryptographic system uses prime numbers to generate keys. If a key generation algorithm mistakenly uses two numbers that share a common prime factor, which security outcome results?
• If a cryptographic key generation algorithm relies heavily on multiplying very large prime numbers, which security risk increases most if the primes are too close in magnitude?