levo

Algorithms, Pseudo-Code and Programming Constructs

Counts, totals and rogue values

  • 3 things to know
  • Component 1

Overview

Count in an algorithm, running total and term rogue value.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

What is a count in an algorithm?

Key term

How is a count initialised and updated?

Key term

What is a running total?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    What is a count in an algorithm?

    Model answer

    A count is a variable recording how many times something has happened. The count is increased by one at each occurrence.

  2. 2

    How is a count initialised and updated?

    Model answer

    A count is set to zero before the loop begins. The statement count = count + 1 increases it inside the loop.

  3. 3

    What is a running total?

    Model answer

    A running total is a variable that accumulates values as a loop runs. Each new value is added to the total already held.

  4. 4

    How is a running total initialised and updated?

    Model answer

    A total is set to zero before the loop begins. The statement total = total + value adds each item inside the loop.

  5. 5

    Why must a count or a total be initialised outside the loop?

    Model answer

    An initialisation placed inside the loop would reset the variable on every pass. The final value would then be wrong.

  6. 6

    Define the term rogue value.

    Model answer

    A rogue value is a value entered to signal the end of a set of data. The value is not part of the data and is not processed.

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.