Computer-science_A-level_Cie
-
computers-and-components6 主题
-
logic-gates-and-logic-circuits2 主题
-
central-processing-unit-cpu-architecture6 主题
-
assembly-language-4 主题
-
bit-manipulation1 主题
-
operating-systems3 主题
-
language-translators2 主题
-
data-security3 主题
-
data-integrity1 主题
-
ethics-and-ownership3 主题
-
database-concepts3 主题
-
database-management-systems-dbms-1 主题
-
data-definition-language-ddl-and-data-manipulation-language-dml1 主题
-
computational-thinking-skills1 主题
-
algorithms14 主题
-
data-types-and-records2 主题
-
arrays2 主题
-
files1 主题
-
introduction-to-abstract-data-types-adt1 主题
-
programming-basics1 主题
-
constructs2 主题
-
structured-programming1 主题
-
program-development-life-cycle2 主题
-
program-design-2 主题
-
program-testing-and-maintenance3 主题
-
user-defined-data-types1 主题
-
file-organisation-and-access-3 主题
-
floating-point-numbers-representation-and-manipulation3 主题
-
protocols2 主题
-
circuit-switching-packet-switching1 主题
-
processors-parallel-processing-and-virtual-machines5 主题
-
boolean-algebra-and-logic-circuits4 主题
-
purposes-of-an-operating-system-os3 主题
-
translation-software3 主题
-
encryption-encryption-protocols-and-digital-certificates3 主题
-
artificial-intelligence-ai4 主题
-
recursion1 主题
-
programming-paradigms4 主题
-
object-oriented-programming7 主题
-
file-processing-and-exception-handling2 主题
-
data-representation5 主题
-
multimedia3 主题
-
compression2 主题
-
networks-and-the-internet11 主题
algorithm-basics
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