Embedded Files
Pseudocode & Flowcharts
Pseudocode & Flowcharts
are tools for designing and describing algorithms.
An algorithm is: a step-by-step sequence of instructions to solve a specific problem in a finite amount of time
In the IGCSE CS course this fits under the Section 2.1, Algorithm design and problem-solving.
Official Pseudocode Guide
Official Pseudocode Guide
(Note: the exams don't always follow this guide)
Cambridge - 2017 - Pseudocode Guide for Teachers Cambridge IGCSE.pdfIGCSE Style Flowchart ↔ Pseudocode ↔ Python Dictionary & Examples
IGCSE Style Flowchart ↔ Pseudocode ↔ Python Dictionary & Examples
Python version is below. Java version is linked here.
Section 2.1.1
Section 2.1.1
- use top-down design, structure diagrams, flowcharts, pseudocode, library routines and sub-routines
- work out the purpose of a given algorithm
- explain standard methods of solution
- suggest and apply suitable test data
- use trace tables to find the value of variables at each step in an algorithm
- identify errors in given algorithms and suggest ways of removing these errors
- produce an algorithm for a given problem (either in the form of pseudocode or flowchart)
- comment on the effectiveness of a given solution
Section 2.1.2
Section 2.1.2
- understand and use pseudocode for assignment, using ←
- understand and use pseudocode, using the following conditional statements:
- IF … THEN … ELSE … ENDIF
- CASE … OF … OTHERWISE … ENDCASE
- understand and use pseudocode, using the following loop structures:
- FOR … TO … NEXT
- REPEAT … UNTIL
- WHILE … DO … ENDWHILE
- understand and use pseudocode, using the following commands and statements:
- INPUT and OUTPUT (e.g. READ and PRINT)
- totalling (e.g. Sum ← Sum + Number)
- counting (e.g. Count ← Count + 1)
- understand and use standard flowchart symbols to represent the above statements, commands and structures
Report abuse