Which concept describes selections or loops inside each other?

Study for the IGCSE Algorithms and Pseudocode exam to demonstrate mastery of computing foundations. Enhance learning with quizzes, in-depth explanations, and custom study plans. Begin your journey to success now!

Multiple Choice

Which concept describes selections or loops inside each other?

Explanation:
Nesting control structures describes selections or loops inside each other. When you place one control structure inside another—such as a loop inside a loop or a conditional inside a loop—you create nested statements. This lets you perform actions at multiple levels of decision or repetition. For example: for i in range(n): for j in range(m): if grid[i][j] == 1: process(i, j) In this case, the inner loop and the if statement are inside the outer loop, so they execute for every combination of i and j. That’s nesting in action. The other ideas refer to things like prewritten functions (library routines), data that can be accessed from anywhere in the program (global variables), or a simple list of values (one-dimensional arrays). They aren’t about putting control flow inside other control flow.

Nesting control structures describes selections or loops inside each other. When you place one control structure inside another—such as a loop inside a loop or a conditional inside a loop—you create nested statements. This lets you perform actions at multiple levels of decision or repetition.

For example:

for i in range(n):

for j in range(m):

if grid[i][j] == 1:

process(i, j)

In this case, the inner loop and the if statement are inside the outer loop, so they execute for every combination of i and j. That’s nesting in action.

The other ideas refer to things like prewritten functions (library routines), data that can be accessed from anywhere in the program (global variables), or a simple list of values (one-dimensional arrays). They aren’t about putting control flow inside other control flow.

Subscribe

Get the latest from Examzify

You can unsubscribe at any time. Read our privacy policy