Question

question 25 of 25
which option is an example of iteration in an algorithm?

a. instructing the computer to use a certain amount of its memory to
save the algorithms data

b. including an if - then statement to account for a specific condition

c. instructing the computer to repeat a step over and over while a
certain condition is met

d. including a rigid sequence of events that the computer must
perform in an exact order

Explanation:

To determine the example of iteration in an algorithm, we analyze each option:

• Option A: Memory usage for data storage is not iteration. Iteration is about repeating steps, not memory management.
• Option B: An if - then statement is for conditional branching (selection), not repetition (iteration).
• Option C: Repeating a step while a condition is met is the definition of iteration (e.g., a loop in programming that repeats as long as a condition holds).
• Option D: A rigid sequence of events in order is a sequential execution, not iteration (iteration involves repetition, not just a fixed order of non - repeated steps).

Answer:

C. Instructing the computer to repeat a step over and over while a certain condition is met