Question

Which characteristic ensures that an algorithm does not run forever?

• A. Accuracy
• B. Termination
• C. Storage
• D. Versatility

Hint:

Characteristics of an algorithm: \[ \boxed{ \begin{aligned} &\text{Input}\\ &\text{Output}\\ &\text{Definiteness}\\ &\text{Finiteness (Termination)}\\ &\text{Effectiveness} \end{aligned} } \]

Answer 1

The Correct Option is B

Step 1: List what a valid algorithm must have.
Every algorithm needs clear input, clear output, unambiguous steps, and it must finish after a finite number of steps.
Step 2: Focus on the finishing condition.
The property that guarantees the algorithm stops after finitely many steps, rather than looping forever, is called termination (or finiteness).
Step 3: Match to the option.
Accuracy, storage and versatility don't say anything about whether the process ever stops, so termination is the right fit.
\[ \boxed{\text{Termination}} \]