Ten questions on what computation can and cannot do: a state machine traced symbol by symbol, a counting job no number of states will ever manage, an…
10 questions • Zestly
• A finite state machine has three states: S0, S1, and S2. S0 is the start state, and S2 is the only accepting state. The transitions are…
• Why is it impossible for a finite state machine to determine if a string contains an equal number of zeros and ones, given that the number…
• A software engineer breaks a large project into smaller, manageable modules. Later, the same engineer creates a simplified model of a…
• Algorithm A has a growth rate of order n squared, and Algorithm B has a growth rate of order n log n. For a very small input size…
• A firm finds that an algorithm with a worse order of growth finishes faster on their specific, small-scale dataset than an algorithm with a…
• A function performs a slow calculation that always returns the same result for the same key, and the same keys come up again and again. A…
• An algorithm has an exponential running time. As the input size increases, the time required becomes impractical. What is the most accurate…
• When using a heuristic to solve a complex problem, what is the nature of the result provided?
Want to prepare for an exam — or set one for someone else?
Create your own exam
See the full breakdown →
