Computer Science AS CIE
-
data-representation as5 主题
-
multimedia as3 主题
-
compression as2 主题
-
networks-and-the-internet as11 主题
-
computers-and-components as5 主题
-
logic-gates-and-logic-circuits as2 主题
-
central-processing-unit-cpu-architecture as6 主题
-
assembly-language- as4 主题
-
bit-manipulation as1 主题
-
operating-systems as3 主题
-
language-translators as2 主题
-
data-security as3 主题
-
data-integrity as1 主题
-
ethics-and-ownership as3 主题
-
database-concepts as3 主题
-
database-management-systems-dbms- as1 主题
-
data-definition-language-ddl-and-data-manipulation-language-dml as1 主题
-
computational-thinking-skills as1 主题
-
algorithms as4 主题
-
data-types-and-records as2 主题
-
arrays as2 主题
-
files as1 主题
-
introduction-to-abstract-data-types-adt as1 主题
-
programming-basics as1 主题
-
constructs as2 主题
-
structured-programming as1 主题
-
program-development-life-cycle as1 主题
-
program-design- as2 主题
-
program-testing-and-maintenance as3 主题
algorithm-basics as
Exam code:9618
Definition of algorithm
What is an algorithm?
-
An algorithm is a solution to a problem expressed as a sequence of defined steps
-
Methods of writing an algorithm before attempting to program a solution include:
-
Structured English
-
Pseudocode
-
Flowcharts
-
Structured English
-
Structured English is a human-readable method for describing algorithms using a combination of natural English language and programming logic
-
It uses clear English phrases to describe each step
-
Logic structures like IF…THEN, REPEAT, and WHILE may appear, but without strict syntax rules
-
Often used in the early planning stages before converting to pseudocode
-
Ask the user to enter their age
If the age is 18 or over
→ Display a welcome message
Otherwise
→ Display an access denied message
Pseudocode
-
Pseudocode is a precise, structured, and language-independent way of describing an algorithm that resembles a programming language
-
It follows specific exam-board-defined syntax
-
It includes formal elements like
IF,THEN,ELSE,WHILE,REPEAT,DECLARE, and←for assignment -
Students must follow CIE’s pseudocode format in exams
-
INPUT Age
IF Age >= 18 THEN OUTPUT "Welcome to the site"
ELSE OUTPUT "Sorry, this site is for users 18 and over"
ENDIF
Flowcharts
-
Flowcharts are a visual tool that uses shapes to represent different functions to describe an algorithm
-
Used to visualise the flow of control in a system
-
Standard symbols include:
-
Oval for Start/End
-
Parallelogram for Input/Output
-
Rectangle for Processes
-
Diamond for Decisions
-
-
Arrows show the sequence of operations

Identifier tables
What is an identifier table?
-
An identifier table is used when writing pseudocode to keep track of all the identifier names used in an algorithm
-
An identifier is the name given to a variable, constant, array, procedure, or any other named element in the pseudocode
Why use an identifier table?
-
It helps you stay organised when designing an algorithm
-
Ensures consistent naming
-
Makes it easier to understand what each identifier stores or does
-
Useful in exam questions when you are asked to declare variables clearly
Identifier naming rules
-
Must start with a letter (A–Z or a–z)
-
Can include letters, digits (0–9), and underscores (_)
-
Accented characters and symbols are not allowed
-
Identifiers are case sensitive (e.g.
Totalandtotalare NOT treated the same)
|
Identifier |
Description |
|---|---|
|
|
Stores a student’s full name |
|
|
Holds a test score value |
|
|
Maximum score allowed |
|
|
Stores names in a form group |
Responses