Teach-ICT OCR GCSE Computing - Control Flow, algorithms, sequences, iteration

THE education site for computer science and ICT

SITE HOME

GCSE Computing

GCSE Computing Home Page

Unit A451 Topics

GCSE Computing Quizzes

CONTROL FLOW

control Flow Home

THEORY

Introduction

1. Introduction

sequence

Selection in an algorithm

3. Selection in an algorithm

IF .. THEN .. ELSE .. END

4. IF .. THEN .. ELSE .. END

SWITCH / CASE Statement

5. SWITCH / CASE Statement

Iteration - part 1

6. Iteration - part 1

Iteration - part 2

7. Iteration - part 2

1. Introduction

Specification point:

Control Flow in imperative languages

i) Understand and use sequence within an algorithm

ii) Understand and use selection in an algorithm (IF and CASE statements)

iii) Understand and use iteration in an algorithm (FOR WHILE REPEAT loops)

We have covered algorithms already to some extent but this section explores their structure in more detail. This section is to do with 'imperative languages' which is a style of programming where the CPU is instructed step by step as to what to do next. These instructions are in the form of statements set out in sequence.