levo

Algorithms, Pseudo-Code and Programming Constructs

Sequence and selection

  • 3 things to know
  • Component 1

Overview

Nested IF, term condition and relational operators used in conditions.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Process

What is sequence?

Process

Why does the order of a sequence matter?

Key term

What is selection?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    What is sequence?

    Model answer

    Sequence means that instructions are carried out one after another in the order written. Each step finishes before the next begins.

  2. 2

    Why does the order of a sequence matter?

    Model answer

    A later step often depends on a value produced by an earlier one. Reordering the steps can therefore give a wrong result.

  3. 3

    What is selection?

    Model answer

    Selection means that a program chooses between different sets of instructions. The choice depends on whether a condition is true.

  4. 4

    Write pseudo-code for a simple IF statement.

    Model answer

    The form is IF mark ≥ 40 THEN OUTPUT pass, then END IF. Only a mark of 40 or more produces the output.

  5. 5

    Write pseudo-code for an IF statement with an alternative branch.

    Model answer

    The form is IF mark ≥ 40 THEN OUTPUT pass ELSE OUTPUT fail, then END IF. Exactly one of the two branches runs.

  6. 6

    What is a nested IF?

    Model answer

    A nested IF places one selection inside a branch of another. The second condition is tested only when the first has been met.

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book
2Open book
3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Data Structures: Arrays, Records and Hash Tables
Stacks, Queues, Linked Lists and Trees
Boolean Logic and Simplification
Algorithms, Pseudo-Code and Programming Constructs

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

KDW to HAT.
decryptsencryptscompresses

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

AThe two are not the same.
BOpen source refers to the availability of the code.
CMuch open source software is free of charge.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

Backup means the copy of the data.
TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Algorithms, Pseudo-Code and Programming Constructs, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Or £46 a year, about £3.83 a month. Cancel anytime.