Unit 1 lesson 1.3

Question 1

Abstract step

Answer 1

A high-level action in an algorithm that describes what needs to be done without detailing how to do it.

Question 2

Algorithm

Answer 2

A step-by-step set of instructions designed to perform a specific task or solve a problem.

Question 3

Branch

Answer 3

A point in an algorithm where a decision is made, leading to different actions based on conditions (e.g., if-then statements)

Question 4

Infinite loop

Answer 4

A loop that never ends because the termination condition is never met or is incorrectly written.

Question 5

Input

Answer 5

Data that are provided to a program for processing.

Question 6

Loop control variable

Answer 6

A variable that determines whether the loop will continue running or stop, often incremented or modified within the loop.

Question 7

Nested structure

Answer 7

A programming construct where one control structure (like a loop or a conditional statement) is placed inside another.

Question 8

Output

Answer 8

Data that are produced by a program and presented to the user or another system.

Question 9

Pretest loop

Answer 9

A loop that evaluates its condition before executing the body of the loop, such as a while loop.

Question 10

Pseudocode

Answer 10

A simplified, human-readable version of a program’s code that outlines the logic without strict syntax rules.

Question 11

Repetition (iteration)

Answer 11

The act of executing a set of instructions multiple times, typically using loops.

Question 12

Selection

Answer 12

A control structure that allows a program to choose between different actions based on conditions.