1. Starter: Program Flowchart & Trace Table
Devina Gillooly
Woodhouse College

2. Topic Aims Level Method
Technology
Aims
Getting Students to be independent leaners
Making Students aware of emerging technologies
Level
Level 3
Method
PowerPoint slides, all hand-outs. Slide 3 & 4 Questions – 5, 6 & 7 Answer slides. It is up to the Teacher/Lecturer whether they want to hide certain slides from students
Equipment
Laptop/Projector
Pens/Pencils
Paper/Note Pads
Duration
>30 Minutes

3. Program Flowchart & Trace Table
Question 1
Name:
Group:
First: Draw a program flowchart for making a cup of tea using the picture above
Second: Amend your flowchart to include adding sugar and milk to your tea
Note: This is a Hand-Out please print for the student
Hand-out please print

4. Program Flowchart & Trace Table
Question 2
Name:
Group:
(a) Explain what is meant by an algorithm. (2)
(b) One way of checking that an algorithm is correct is to complete a dry run. Dry run the algorithm in the figure below by completing the table below. Assume that x has a value of 7. The MOD operator calculates the remainder resulting from an integer division. (6)
Answer
Count
Remainder
True - 2 1 3 4 5 6
Note: This is a Hand-Out please could you print for the student
Answer ← True
FOR Count ← 2 To (x - 1) DO
Remainder ← x MOD Count
IF Remainder = 0 THEN
Answer ← False
ENDIF
ENDFOR
(c) What is the purpose of this algorithm. (1)
Hand-out please print

5. Program Flowchart
& Trace Table
ANSWERS

6. Program Flowchart & Trace Table
Answer 1:
( )

7. Program Flowchart & Trace Table
Answer 2
(a) Must have the concept of problem/task for the first mark
A (step-by-step) description of how to complete a task / a description of a process that achieves some task / a sequence of steps that solve a problem / A sequence of unambiguous instructions for solving a problem;
R Set of instructions
Independent of any programming language;
That can be completed in finite time; (Max 2)
(b) Mark as follows:
answer column;
A True instead of blank cells
R if no evidence that dry run has been attempted count column;
1 mark per correct value in remainder column; (6)
(c) Works out if x is a prime number //
Checks if x is divisible (with no remainder); 1 (9)

8. For further information please contact The STEM Alliance or visit