Question

which concept, when applied in an algorithm, allows the computer to manage data so that it can be referred to at any time?

a. sequencing

b. iteration

c. selection

d. storage

Explanation:

To solve this, we analyze each option:

• Option A: Sequencing is about the order of steps in an algorithm, not data management for future reference.
• Option B: Iteration involves repeating a set of instructions, not data storage or management for later access.
• Option C: Selection is about making decisions (like if - else statements) in an algorithm, not data management.
• Option D: Storage in algorithms refers to the concept of saving data so that it can be accessed or referred to at any time during the execution of the algorithm or later.

Answer:

D. Storage