Search this site
Skip to main content
Skip to navigation
Computing
Home
Year 7
Year 7 Term 1A
Year 7 Term 1B
Year 7 Term 2
Year 7 Term 3
Year 8
Year 8 - Term-1
Year 8 - Term 2
Year 8 - Term 3
Hardware
Year 9
Year 9 Term 1A
Year 9 - Term 2
Year 9 Term 2B
Year 9 - Term 2C
Year 9 - Term 3 A
Year 9 - Term 3 B
Year 9 Elective
GCSE
8525 CS
3.1 Fundamentals of algorithms
3.1.1 Representing algorithms.
3.1.1 Pseudo-code and flowcharts
3.1.2 Efficiency of algorithms
3.1.3 Searching algorithms
3.1.4 Sorting algorithms
3.2 Programming (8525)
Python basics
3.3 Fundamentals of data representations (8525)
3.4 Computer systems (8525)
3.5 Fundamentals of computer networks (8525)
3.6 Cyber security (8525)
3.7 Relational databases and structured query language (SQL) (8525)
3.8 Ethical, legal and environmental impacts (8525)
SoL
Revision and support (8525)
Mastery
Term 2A
Computing e-text book
Transition to Alevel
A- level
NEA
Analysis
Design
Technical solution
Testing
Evaluation
Paper 1
Skills workshop
4.1 Fundamentals of programming (Yr13)
Python basics
4.1.1 Programming challenges.
4.1.1 Programming
4.1 Programming videos
4.1.1.1 Data types
4.1.1.2. Programming concepts
4.1.1.3 Arithmetic operations in a programming language
4.1.1.4 Relational operations in a programming language
4.1.1.5 Boolean operations in a programming language
4.1.1.6 Constants and variables in a programming language
4.1.1.7 String-handling operations
4.1.1.8 Random number generations
4.1.1.9 Exception handling
4.1.1.10 Subroutines (Procedures/ Functions)
4.1.1.11 Parameters of subroutines
4.1.1.12 Returning a value/ values from a subroutine
4.1.1.13 Local variables in subroutines
4.1.1.14 Global variables in a programming language
4.1.1.15 Role of stack frames in subroutine calls
4.1.1.16 Recursive techniques
4.1.2 Programming paradigms
4.1.2.1 Programming paradigms
4.1.2.2 Procedural-oriented programming
4.1.2.3 Object-oriented programming
4.2 Fundamentals of data structures
4.2.1.1. Data structures
4.2.1.2 Single and multidimensional arrays
4.2.1.3 Field, records and files
4.2.1.4 Abstract data types/ structures
4.2.2 Queues
4.2.3 Stacks
4.2.4 Graphs
4.2.5 Trees
4.2.6 Hash tables
4.2.7 Dictionaries
4.2.8 Vectors
4.3 Fundamentals of algorithms
4.3.1 Graph traversal
4.3.2 Tree-traversal
4.3.3 Reverse Polish
4.3.6 Optimisation algorithms
4.3.4 Searching algorithms
4.3.4.1 Linear search
4.3.4.2 Binary search
4.3.4.3 Binary tree search
4.3.5 Sorting algorithms
4.3.5.1 Bubble sort
4.3.5.2 Merge sort
4.4 Theory of Computation
4.4.1 Abstraction and automation
4.4.1.1 Problem solving
4.4.1.2 Following and writing algorithms
4.4.1.3 Abstraction
4.4.1.4 Information hiding
4.4.1.5 Procedural abstraction
4.4.1.6 Functional abstraction
4.4.1.7 Data abstraction
4.4.1.8 Problem abstraction/ reduction
4.4.1.9 Decomposition
4.4.1.10 Composition
4.4.1.11 Automation
4.4.2 Regular languages
4.4.2.1 Finite state machines (FSMs) with and without output
4.4.2.2. Maths for regular expressions
4.4.2.3 Regular expressions
4.4.2.4 Regular languages
4.4.3. Context-free languages
4.4.4 Classification of algorithms
4.4.4.1 Comparing algorithms
4.4.4.2 Maths for understanding Big-0 notation
4.4.4.3 Order of complexity
4.4.4.4. Limits of computation
4.4.4.5 Classification of algorithmic problems
4.4.4.6 Computable and non-computable problems
4.4.4.7 Halting problem
4.4.5. A model of computing
4.13 Systematic approach to problem solving
Preliminary material
AS Mock 2024
A2 June 2024 Preliminary material
2023 AS Mock Preliminary material
2023 A2 Preliminary material
2022A2 Preliminary material
2021 A2 Preliminary
2020 A2 Preliminary material
2022 AS Mock March
2021 AS Mock
2019 AS Preliminary material
2018 AS Preliminary prep
Paper 2
4.5 Fundamentals of Data Representation
4.5.1. Number systems
4.5.2 Number bases
4.5.3 Units of information
4.5.4 Binary number system
4.6 Fundamentals of computer systems
4.7 Fundamentals of computer organisation and architecture
4.8 Consequences of uses of computing
4.10 Fundamentals of Databases
4.9 Fundamentals of Communication and Networking
4.11 Big Data
4.12 Fundamentals of Functional Programming
Scheme of learning
Revision
Applying for CS at Uni
CS Interview preparation
Transition to University
A level (CIE)
Paper 1
1. Information Representation
2. Communication
3 Hardware
4. Processor fundamentals
5. System Software
6. Security, privacy & data integrity
7 Ethics and Ownership
8 Databases
Paper 2
9. Algorithm design & problem solving
10. Data Types and structures
11. Programming
12. Software development
Paper 3
13 Data representation
14 Communication and Internet technologies
15 Hardware and virtual machines
16 System Software
17 Security
18 Artificial Intelligence (AI)
Paper 4
19. Computational thinking and problem solving
20. Further programming
Ebooks
Revision and support
Applying for CS at Uni 2
Enrichment
A conversation with
Additional resources
Competitions
KLASS Kode for Kindness
Tokyo Inter-School Hackathon 2021
Perse coding competition 2020
KL Coding cup
Cyber security
Digital stars in CS
Opportunities
Stretch and Challenge
Up skilling
CS JAWS Jan 2024
Tedx KLASS Youth
Virtual reality
Department Page
Gateway
Computing
Home
Year 7
Year 7 Term 1A
Year 7 Term 1B
Year 7 Term 2
Year 7 Term 3
Year 8
Year 8 - Term-1
Year 8 - Term 2
Year 8 - Term 3
Hardware
Year 9
Year 9 Term 1A
Year 9 - Term 2
Year 9 Term 2B
Year 9 - Term 2C
Year 9 - Term 3 A
Year 9 - Term 3 B
Year 9 Elective
GCSE
8525 CS
3.1 Fundamentals of algorithms
3.1.1 Representing algorithms.
3.1.1 Pseudo-code and flowcharts
3.1.2 Efficiency of algorithms
3.1.3 Searching algorithms
3.1.4 Sorting algorithms
3.2 Programming (8525)
Python basics
3.3 Fundamentals of data representations (8525)
3.4 Computer systems (8525)
3.5 Fundamentals of computer networks (8525)
3.6 Cyber security (8525)
3.7 Relational databases and structured query language (SQL) (8525)
3.8 Ethical, legal and environmental impacts (8525)
SoL
Revision and support (8525)
Mastery
Term 2A
Computing e-text book
Transition to Alevel
A- level
NEA
Analysis
Design
Technical solution
Testing
Evaluation
Paper 1
Skills workshop
4.1 Fundamentals of programming (Yr13)
Python basics
4.1.1 Programming challenges.
4.1.1 Programming
4.1 Programming videos
4.1.1.1 Data types
4.1.1.2. Programming concepts
4.1.1.3 Arithmetic operations in a programming language
4.1.1.4 Relational operations in a programming language
4.1.1.5 Boolean operations in a programming language
4.1.1.6 Constants and variables in a programming language
4.1.1.7 String-handling operations
4.1.1.8 Random number generations
4.1.1.9 Exception handling
4.1.1.10 Subroutines (Procedures/ Functions)
4.1.1.11 Parameters of subroutines
4.1.1.12 Returning a value/ values from a subroutine
4.1.1.13 Local variables in subroutines
4.1.1.14 Global variables in a programming language
4.1.1.15 Role of stack frames in subroutine calls
4.1.1.16 Recursive techniques
4.1.2 Programming paradigms
4.1.2.1 Programming paradigms
4.1.2.2 Procedural-oriented programming
4.1.2.3 Object-oriented programming
4.2 Fundamentals of data structures
4.2.1.1. Data structures
4.2.1.2 Single and multidimensional arrays
4.2.1.3 Field, records and files
4.2.1.4 Abstract data types/ structures
4.2.2 Queues
4.2.3 Stacks
4.2.4 Graphs
4.2.5 Trees
4.2.6 Hash tables
4.2.7 Dictionaries
4.2.8 Vectors
4.3 Fundamentals of algorithms
4.3.1 Graph traversal
4.3.2 Tree-traversal
4.3.3 Reverse Polish
4.3.6 Optimisation algorithms
4.3.4 Searching algorithms
4.3.4.1 Linear search
4.3.4.2 Binary search
4.3.4.3 Binary tree search
4.3.5 Sorting algorithms
4.3.5.1 Bubble sort
4.3.5.2 Merge sort
4.4 Theory of Computation
4.4.1 Abstraction and automation
4.4.1.1 Problem solving
4.4.1.2 Following and writing algorithms
4.4.1.3 Abstraction
4.4.1.4 Information hiding
4.4.1.5 Procedural abstraction
4.4.1.6 Functional abstraction
4.4.1.7 Data abstraction
4.4.1.8 Problem abstraction/ reduction
4.4.1.9 Decomposition
4.4.1.10 Composition
4.4.1.11 Automation
4.4.2 Regular languages
4.4.2.1 Finite state machines (FSMs) with and without output
4.4.2.2. Maths for regular expressions
4.4.2.3 Regular expressions
4.4.2.4 Regular languages
4.4.3. Context-free languages
4.4.4 Classification of algorithms
4.4.4.1 Comparing algorithms
4.4.4.2 Maths for understanding Big-0 notation
4.4.4.3 Order of complexity
4.4.4.4. Limits of computation
4.4.4.5 Classification of algorithmic problems
4.4.4.6 Computable and non-computable problems
4.4.4.7 Halting problem
4.4.5. A model of computing
4.13 Systematic approach to problem solving
Preliminary material
AS Mock 2024
A2 June 2024 Preliminary material
2023 AS Mock Preliminary material
2023 A2 Preliminary material
2022A2 Preliminary material
2021 A2 Preliminary
2020 A2 Preliminary material
2022 AS Mock March
2021 AS Mock
2019 AS Preliminary material
2018 AS Preliminary prep
Paper 2
4.5 Fundamentals of Data Representation
4.5.1. Number systems
4.5.2 Number bases
4.5.3 Units of information
4.5.4 Binary number system
4.6 Fundamentals of computer systems
4.7 Fundamentals of computer organisation and architecture
4.8 Consequences of uses of computing
4.10 Fundamentals of Databases
4.9 Fundamentals of Communication and Networking
4.11 Big Data
4.12 Fundamentals of Functional Programming
Scheme of learning
Revision
Applying for CS at Uni
CS Interview preparation
Transition to University
A level (CIE)
Paper 1
1. Information Representation
2. Communication
3 Hardware
4. Processor fundamentals
5. System Software
6. Security, privacy & data integrity
7 Ethics and Ownership
8 Databases
Paper 2
9. Algorithm design & problem solving
10. Data Types and structures
11. Programming
12. Software development
Paper 3
13 Data representation
14 Communication and Internet technologies
15 Hardware and virtual machines
16 System Software
17 Security
18 Artificial Intelligence (AI)
Paper 4
19. Computational thinking and problem solving
20. Further programming
Ebooks
Revision and support
Applying for CS at Uni 2
Enrichment
A conversation with
Additional resources
Competitions
KLASS Kode for Kindness
Tokyo Inter-School Hackathon 2021
Perse coding competition 2020
KL Coding cup
Cyber security
Digital stars in CS
Opportunities
Stretch and Challenge
Up skilling
CS JAWS Jan 2024
Tedx KLASS Youth
Virtual reality
Department Page
Gateway
More
Home
Year 7
Year 7 Term 1A
Year 7 Term 1B
Year 7 Term 2
Year 7 Term 3
Year 8
Year 8 - Term-1
Year 8 - Term 2
Year 8 - Term 3
Hardware
Year 9
Year 9 Term 1A
Year 9 - Term 2
Year 9 Term 2B
Year 9 - Term 2C
Year 9 - Term 3 A
Year 9 - Term 3 B
Year 9 Elective
GCSE
8525 CS
3.1 Fundamentals of algorithms
3.1.1 Representing algorithms.
3.1.1 Pseudo-code and flowcharts
3.1.2 Efficiency of algorithms
3.1.3 Searching algorithms
3.1.4 Sorting algorithms
3.2 Programming (8525)
Python basics
3.3 Fundamentals of data representations (8525)
3.4 Computer systems (8525)
3.5 Fundamentals of computer networks (8525)
3.6 Cyber security (8525)
3.7 Relational databases and structured query language (SQL) (8525)
3.8 Ethical, legal and environmental impacts (8525)
SoL
Revision and support (8525)
Mastery
Term 2A
Computing e-text book
Transition to Alevel
A- level
NEA
Analysis
Design
Technical solution
Testing
Evaluation
Paper 1
Skills workshop
4.1 Fundamentals of programming (Yr13)
Python basics
4.1.1 Programming challenges.
4.1.1 Programming
4.1 Programming videos
4.1.1.1 Data types
4.1.1.2. Programming concepts
4.1.1.3 Arithmetic operations in a programming language
4.1.1.4 Relational operations in a programming language
4.1.1.5 Boolean operations in a programming language
4.1.1.6 Constants and variables in a programming language
4.1.1.7 String-handling operations
4.1.1.8 Random number generations
4.1.1.9 Exception handling
4.1.1.10 Subroutines (Procedures/ Functions)
4.1.1.11 Parameters of subroutines
4.1.1.12 Returning a value/ values from a subroutine
4.1.1.13 Local variables in subroutines
4.1.1.14 Global variables in a programming language
4.1.1.15 Role of stack frames in subroutine calls
4.1.1.16 Recursive techniques
4.1.2 Programming paradigms
4.1.2.1 Programming paradigms
4.1.2.2 Procedural-oriented programming
4.1.2.3 Object-oriented programming
4.2 Fundamentals of data structures
4.2.1.1. Data structures
4.2.1.2 Single and multidimensional arrays
4.2.1.3 Field, records and files
4.2.1.4 Abstract data types/ structures
4.2.2 Queues
4.2.3 Stacks
4.2.4 Graphs
4.2.5 Trees
4.2.6 Hash tables
4.2.7 Dictionaries
4.2.8 Vectors
4.3 Fundamentals of algorithms
4.3.1 Graph traversal
4.3.2 Tree-traversal
4.3.3 Reverse Polish
4.3.6 Optimisation algorithms
4.3.4 Searching algorithms
4.3.4.1 Linear search
4.3.4.2 Binary search
4.3.4.3 Binary tree search
4.3.5 Sorting algorithms
4.3.5.1 Bubble sort
4.3.5.2 Merge sort
4.4 Theory of Computation
4.4.1 Abstraction and automation
4.4.1.1 Problem solving
4.4.1.2 Following and writing algorithms
4.4.1.3 Abstraction
4.4.1.4 Information hiding
4.4.1.5 Procedural abstraction
4.4.1.6 Functional abstraction
4.4.1.7 Data abstraction
4.4.1.8 Problem abstraction/ reduction
4.4.1.9 Decomposition
4.4.1.10 Composition
4.4.1.11 Automation
4.4.2 Regular languages
4.4.2.1 Finite state machines (FSMs) with and without output
4.4.2.2. Maths for regular expressions
4.4.2.3 Regular expressions
4.4.2.4 Regular languages
4.4.3. Context-free languages
4.4.4 Classification of algorithms
4.4.4.1 Comparing algorithms
4.4.4.2 Maths for understanding Big-0 notation
4.4.4.3 Order of complexity
4.4.4.4. Limits of computation
4.4.4.5 Classification of algorithmic problems
4.4.4.6 Computable and non-computable problems
4.4.4.7 Halting problem
4.4.5. A model of computing
4.13 Systematic approach to problem solving
Preliminary material
AS Mock 2024
A2 June 2024 Preliminary material
2023 AS Mock Preliminary material
2023 A2 Preliminary material
2022A2 Preliminary material
2021 A2 Preliminary
2020 A2 Preliminary material
2022 AS Mock March
2021 AS Mock
2019 AS Preliminary material
2018 AS Preliminary prep
Paper 2
4.5 Fundamentals of Data Representation
4.5.1. Number systems
4.5.2 Number bases
4.5.3 Units of information
4.5.4 Binary number system
4.6 Fundamentals of computer systems
4.7 Fundamentals of computer organisation and architecture
4.8 Consequences of uses of computing
4.10 Fundamentals of Databases
4.9 Fundamentals of Communication and Networking
4.11 Big Data
4.12 Fundamentals of Functional Programming
Scheme of learning
Revision
Applying for CS at Uni
CS Interview preparation
Transition to University
A level (CIE)
Paper 1
1. Information Representation
2. Communication
3 Hardware
4. Processor fundamentals
5. System Software
6. Security, privacy & data integrity
7 Ethics and Ownership
8 Databases
Paper 2
9. Algorithm design & problem solving
10. Data Types and structures
11. Programming
12. Software development
Paper 3
13 Data representation
14 Communication and Internet technologies
15 Hardware and virtual machines
16 System Software
17 Security
18 Artificial Intelligence (AI)
Paper 4
19. Computational thinking and problem solving
20. Further programming
Ebooks
Revision and support
Applying for CS at Uni 2
Enrichment
A conversation with
Additional resources
Competitions
KLASS Kode for Kindness
Tokyo Inter-School Hackathon 2021
Perse coding competition 2020
KL Coding cup
Cyber security
Digital stars in CS
Opportunities
Stretch and Challenge
Up skilling
CS JAWS Jan 2024
Tedx KLASS Youth
Virtual reality
Department Page
Gateway
4.4.2.2. Maths for regular expressions
1-maths-for-regular-expressions
Maths for regular expression
Lesson presentation
Maths for regular expression.pdf
Excerpt from the text book
Flipped learning maths for RE
Flipped learning presentation
Maths for regular expression (part 1)
Maths for regular expression (Part 2)
Wikibook
How to create sets in Python
Set symbols
www.programiz.com/python-programming/set
Report abuse
Report abuse
