Computer Studies·Algorithms · NSSCO 4.4
Algorithms: pseudocode, flowcharts, constructs & trace tables
Narrated lesson · press play
An algorithm is a clear list of steps that solves a problem. In this lesson Miss Maria shows you how to plan one with pseudocode and flowcharts, use sequence, selection and iteration, work with MOD and DIV, and dry-run an algorithm in a trace table to find and fix errors.
What you'll learn in this lesson
By the end you should be able to (NSSCO Computer Studies 4.4):
- Produce a simple logic network from a given statement; e.g. if X AND Y are on then the light will be on
- Solve problems in a structured way, using logic and reason
- Develop algorithms using algorithm tools such as: pseudocode, flowchart
- Design algorithms which relate clearly to the requirements of the system where the problem has been observed
- Define the scope of separate modules
- Use the following algorithmic constructs of sequence, selection, and repetition to solve problems: decision structures (if...then...else...end if or equivalent; case of...otherwise...end case or equivalent); loops or iteration (while...do...end while; repeat...until; for...do or equivalent)
- Appropriately apply operators +, -, *, /, MOD and DIV to solve problems
- Select appropriate test data and compare actual test results to expected results
- Use a trace table to dry run an algorithm containing one loop/iteration and at least one decision structure
- Identify where there is an error; suggest ways of removing the errors
Loading your lesson…
You're watching a free 3-minute preview — create a free account to keep going.
Quick revision
Revise this in 5 minutes
Miss Maria and Mike talk through the whole topic — with the figure and working drawn live.