Computer Science I / Structured Program Design
Practice question · Select all that apply

Select every statement that is a consequence of the structured program theorem as the lesson states it.

Hints
  1. The theorem is a claim about what CAN be expressed, not about quality or speed.
  2. Ask which options add a promise the theorem never made.
Show the answer
  • B. Any computation can be expressed using only sequence, selection and iteration
  • C. Arbitrary jumps are never necessary, however complicated the task
  • D. A goto-free program can still be badly designed
Why

The theorem says the three constructs are sufficient, so jumps are never needed, but sufficiency says nothing about correctness or speed, and a goto-free program can still have terrible cohesion and coupling. Reading 'structured' as 'good' is the pitfall: structure is measured by cohesion, coupling and single-entry blocks, not by the absence of one keyword.

Read the lesson: Structured Program Design →

Practise Structured Program Design

The app has 7 more questions on this lesson, and keeps your place in the course. Computer Science I is free to start.

More questions on Structured Program Design