Decorative notebook illustration

CIE A-Level Computer Science

Study Notes

1. Information Representation

1.1.1 Binary and Number Systems 1.1.2 Binary Operations and Overflow 1.1.3 Practical Applications

1.2.1 Bitmapped Graphics 1.2.2 Vector Graphics 1.2.3 Sound Representation

1.3.1 Need for and Use of Compression 1.3.2 Lossy vs. Lossless Compression 1.3.3 Compression Techniques

1.1.1 Binary and Number Systems 1.1.2 Binary Operations and Overflow 1.1.3 Practical Applications

1.2.1 Bitmapped Graphics 1.2.2 Vector Graphics 1.2.3 Sound Representation

1.3.1 Need for and Use of Compression 1.3.2 Lossy vs. Lossless Compression 1.3.3 Compression Techniques

2. Communication

2.1.1 Purpose and Benefits of Networking 2.1.2 LAN and WAN Characteristics

2.2.1 Client-Server and Peer-to-Peer 2.2.2 Thin-Client vs. Thick-Client

2.3.1 Network Topologies 2.3.2 Choosing and Justifying Topologies

2.4.1 Essentials of Cloud Computing

2.5.1 Wired vs. Wireless Networks 2.5.2 LAN Hardware Support 2.5.3 Router Functions

2.6.1 Ethernet and Traffic Management 2.6.2 Bit Streaming and Broadband

2.7.1 WWW vs. Internet 2.7.2 Internet Infrastructure 2.7.3 IP Addressing and Data Transmission 2.7.4 URL and DNS

2.1.1 Purpose and Benefits of Networking 2.1.2 LAN and WAN Characteristics

2.2.1 Client-Server and Peer-to-Peer 2.2.2 Thin-Client vs. Thick-Client

2.3.1 Network Topologies 2.3.2 Choosing and Justifying Topologies

2.4.1 Essentials of Cloud Computing

2.5.1 Wired vs. Wireless Networks 2.5.2 LAN Hardware Support 2.5.3 Router Functions

2.6.1 Ethernet and Traffic Management 2.6.2 Bit Streaming and Broadband

2.7.1 WWW vs. Internet 2.7.2 Internet Infrastructure 2.7.3 IP Addressing and Data Transmission 2.7.4 URL and DNS

3. Hardware

3.1.1 Input, Output, and Storage 3.1.2 Principal Operations of Hardware Devices 3.1.3 Buffers and Memory Usage 3.1.4 ROM Variants 3.1.5 Monitoring and Control Systems

3.2.1 Logic Gate Symbols and Functions 3.2.2 Truth Tables for Logic Gates 3.2.3 Logic Circuit Construction 3.2.4 Truth Table Construction 3.2.5 Logic Expression Construction

3.1.1 Input, Output, and Storage 3.1.2 Principal Operations of Hardware Devices 3.1.3 Buffers and Memory Usage 3.1.4 ROM Variants 3.1.5 Monitoring and Control Systems

3.2.1 Logic Gate Symbols and Functions 3.2.2 Truth Tables for Logic Gates 3.2.3 Logic Circuit Construction 3.2.4 Truth Table Construction 3.2.5 Logic Expression Construction

4. Processor Fundamentals

4.1.1 Von Neumann Model and Stored Program Concept 4.1.2 Role and Types of Registers 4.1.3 CPU Components and Functions 4.1.4 Data Transfer in the Computer System 4.1.5 Factors Affecting System Performance 4.1.6 Ports and Peripheral Connectivity 4.1.7 Fetch-Execute Cycle 4.1.8 Interrupts and Handling

4.2.1 Assembly Language and Machine Code 4.2.2 The Assembly Process 4.2.3 Assembly Language Program Tracing 4.2.4 Instruction Grouping 4.2.5 Addressing Modes 4.2.6 Assembly Language Instruction Set

4.3.1 Binary Shifts 4.3.2 Bit Manipulation for Device Control 4.3.3 Bitwise Operations 4.3.4 Shift Operations 4.3.5 Instruction Set and Labels

4.1.1 Von Neumann Model and Stored Program Concept 4.1.2 Role and Types of Registers 4.1.3 CPU Components and Functions 4.1.4 Data Transfer in the Computer System 4.1.5 Factors Affecting System Performance 4.1.6 Ports and Peripheral Connectivity 4.1.7 Fetch-Execute Cycle 4.1.8 Interrupts and Handling

4.2.1 Assembly Language and Machine Code 4.2.2 The Assembly Process 4.2.3 Assembly Language Program Tracing 4.2.4 Instruction Grouping 4.2.5 Addressing Modes 4.2.6 Assembly Language Instruction Set

4.3.1 Binary Shifts 4.3.2 Bit Manipulation for Device Control 4.3.3 Bitwise Operations 4.3.4 Shift Operations 4.3.5 Instruction Set and Labels

5. System Software

5.1.1 Purpose of Operating Systems 5.1.4 Program Libraries

5.2.1 Need for Language Translators 5.2.2 Compiler vs. Interpreter 5.2.3 Integrated Development Environment (IDE) Features

5.1.1 Purpose of Operating Systems 5.1.4 Program Libraries

5.2.1 Need for Language Translators 5.2.2 Compiler vs. Interpreter 5.2.3 Integrated Development Environment (IDE) Features

6. Security, Privacy, and Data Integrity

6.1.1 Security, Privacy, and Integrity 6.1.2 Security Needs 6.1.3 Security Measures for Computer Systems 6.1.4 Threats from Networks and the Internet 6.1.5 Risk Mitigation Methods 6.1.6 Data Security Methods

6.2.1 Data Validation and Verification 6.2.2 Methods of Data Validation 6.2.3 Methods of Data Verification

6.1.1 Security, Privacy, and Integrity 6.1.2 Security Needs 6.1.3 Security Measures for Computer Systems 6.1.4 Threats from Networks and the Internet 6.1.5 Risk Mitigation Methods 6.1.6 Data Security Methods

6.2.1 Data Validation and Verification 6.2.2 Methods of Data Validation 6.2.3 Methods of Data Verification

7. Ethics and Ownership
Premium

7.1.1 Professional Ethics 7.1.2 Ethical Bodies and Membership 7.1.3 Ethical Actions and Implications 7.1.4 Copyright Legislation 7.1.5 Software Licensing

7.2.1 Understanding AI 7.2.2 Impact of AI 7.2.3 Applications of AI

7.1.1 Professional Ethics 7.1.2 Ethical Bodies and Membership 7.1.3 Ethical Actions and Implications 7.1.4 Copyright Legislation 7.1.5 Software Licensing

7.2.1 Understanding AI 7.2.2 Impact of AI 7.2.3 Applications of AI

8. Databases
Premium

8.1.1 Relational Databases vs. File-Based Systems 8.1.2 Fundamentals of Relational Databases 8.1.3 Normalization and Database Design

8.2.1 DBMS Features and Advantages 8.2.2 Practical Use of DBMS Tools

8.3.1 Role of DDL in DBMS 8.3.2 Role of DML in DBMS 8.3.3 Industry Standard SQL 8.3.4 Writing SQL Statements 8.3.5 SQL Script Creation

8.1.1 Relational Databases vs. File-Based Systems 8.1.2 Fundamentals of Relational Databases 8.1.3 Normalization and Database Design

8.2.1 DBMS Features and Advantages 8.2.2 Practical Use of DBMS Tools

8.3.1 Role of DDL in DBMS 8.3.2 Role of DML in DBMS 8.3.3 Industry Standard SQL 8.3.4 Writing SQL Statements 8.3.5 SQL Script Creation

9. Algorithm Design
Premium

9.1.1 Understanding Abstraction 9.1.2 Applying Abstraction 9.1.3 Decomposition

9.2.1 Understanding Algorithms 9.2.2 Identifier Names and Tables 9.2.3 Writing Pseudocode 9.2.4 Algorithm Documentation 9.2.5 Stepwise Refinement 9.2.6 Logic in Algorithms

9.1.1 Understanding Abstraction 9.1.2 Applying Abstraction 9.1.3 Decomposition

9.2.1 Understanding Algorithms 9.2.2 Identifier Names and Tables 9.2.3 Writing Pseudocode 9.2.4 Algorithm Documentation 9.2.5 Stepwise Refinement 9.2.6 Logic in Algorithms

10. Data Types and Structures
Premium

10.1.1 Appropriate Data Type Selection 10.1.2 Understanding Record Structures 10.1.3 Defining Record Structures in Pseudocode 10.1.4 Manipulating Record Structures

10.2.1 Array Terminology 10.2.2 Choosing Data Structures 10.2.3 Pseudocode for Arrays 10.2.4 Processing Array Data

10.3.1 Understanding Files 10.3.2 File Handling in Pseudocode

10.4.1 Concept of ADT 10.4.2 Common ADTs: Stack, Queue, Linked List 10.4.3 Using ADTs for Data Storage 10.4.4 Implementing ADTs with Arrays

10.1.1 Appropriate Data Type Selection 10.1.2 Understanding Record Structures 10.1.3 Defining Record Structures in Pseudocode 10.1.4 Manipulating Record Structures

10.2.1 Array Terminology 10.2.2 Choosing Data Structures 10.2.3 Pseudocode for Arrays 10.2.4 Processing Array Data

10.3.1 Understanding Files 10.3.2 File Handling in Pseudocode

10.4.1 Concept of ADT 10.4.2 Common ADTs: Stack, Queue, Linked List 10.4.3 Using ADTs for Data Storage 10.4.4 Implementing ADTs with Arrays

11. Programming
Premium

11.1.1 Translating Designs to Pseudocode 11.1.2 Pseudocode for Data Handling 11.1.3 Using Functions and Libraries 11.1.4 String Manipulation

11.2.1 Conditional Statements 11.2.2 'CASE' Structure 11.2.3 Loop Structures 11.2.4 Loop Selection Justification

11.3.1 Defining and Using Procedures 11.3.2 Procedure Parameters 11.3.3 Defining and Using Functions 11.3.4 Terminology of Procedures and Functions 11.3.5 Writing Efficient Pseudocode

11.1.1 Translating Designs to Pseudocode 11.1.2 Pseudocode for Data Handling 11.1.3 Using Functions and Libraries 11.1.4 String Manipulation

11.2.1 Conditional Statements 11.2.2 'CASE' Structure 11.2.3 Loop Structures 11.2.4 Loop Selection Justification

11.3.1 Defining and Using Procedures 11.3.2 Procedure Parameters 11.3.3 Defining and Using Functions 11.3.4 Terminology of Procedures and Functions 11.3.5 Writing Efficient Pseudocode

12. Software Development
Premium

12.1.1 Purpose of Development Life Cycles 12.1.2 Choosing a Development Life Cycle 12.1.3 Life Cycle Methodologies 12.1.4 Stages of Development

12.2.1 Structure Charts 12.2.2 Constructing Structure Charts 12.2.3 Pseudocode from Structure Charts 12.2.4 State-Transition Diagrams

12.3.1 Identifying and Correcting Errors 12.3.2 Testing Methods and Data 12.3.3 Test Strategies and Plans 12.3.4 Maintenance Needs and Types 12.3.5 Enhancing Program Functionality

12.1.1 Purpose of Development Life Cycles 12.1.2 Choosing a Development Life Cycle 12.1.3 Life Cycle Methodologies 12.1.4 Stages of Development

12.2.1 Structure Charts 12.2.2 Constructing Structure Charts 12.2.3 Pseudocode from Structure Charts 12.2.4 State-Transition Diagrams

12.3.1 Identifying and Correcting Errors 12.3.2 Testing Methods and Data 12.3.3 Test Strategies and Plans 12.3.4 Maintenance Needs and Types 12.3.5 Enhancing Program Functionality

13. Data Representation (A Level)

13.1.1 Necessity of User-defined Types 13.1.2 Non-composite User-defined Types 13.1.3 Composite User-defined Types 13.1.4 Designing User-defined Types

13.2.1 Methods of File Organisation 13.2.2 Methods of File Access 13.2.3 Hashing Algorithms

13.3.1 Binary Floating-Point Format 13.3.2 Bit Allocation Effects 13.3.3 Conversion between Binary and Denary 13.3.4 Normalisation of Floating-point Numbers 13.3.5 Approximation and Consequences 13.3.6 Underflow and Overflow 13.3.7 Rounding Errors

13.1.1 Necessity of User-defined Types 13.1.2 Non-composite User-defined Types 13.1.3 Composite User-defined Types 13.1.4 Designing User-defined Types

13.2.1 Methods of File Organisation 13.2.2 Methods of File Access 13.2.3 Hashing Algorithms

13.3.1 Binary Floating-Point Format 13.3.2 Bit Allocation Effects 13.3.3 Conversion between Binary and Denary 13.3.4 Normalisation of Floating-point Numbers 13.3.5 Approximation and Consequences 13.3.6 Underflow and Overflow 13.3.7 Rounding Errors

14.Communication and Internet Technologies (A Level)

14.1.1 The Necessity of Protocols 14.1.2 Protocol Stacks 14.1.3 TCP/IP Protocol Suite 14.1.4 Specific Protocols and Purposes

14.2.1 Understanding Circuit Switching 14.2.2 Understanding Packet Switching 14.2.3 Function of Routers 14.2.4 Packet Switching in Networks

14.1.1 The Necessity of Protocols 14.1.2 Protocol Stacks 14.1.3 TCP/IP Protocol Suite 14.1.4 Specific Protocols and Purposes

14.2.1 Understanding Circuit Switching 14.2.2 Understanding Packet Switching 14.2.3 Function of Routers 14.2.4 Packet Switching in Networks

15.Boolean Algebra and Logic Circuits (A Level)

15.1.1 RISC vs. CISC Processors 5.1.2 OS Management Tasks 5.1.3 Utility Software 15.1.4 Computer Architectures 15.1.5 Massively Parallel Computers 15.1.6 Concept of Virtual Machines 15.1.7 Benefits and Limitations of Virtual Machines

15.2.1 Truth Tables for Logic Circuits 15.2.2 Understanding Flip-Flops 15.2.3 Boolean Algebra and De Morgan’s Laws 15.2.4 Karnaugh Maps (K-map)

15.1.1 RISC vs. CISC Processors 5.1.2 OS Management Tasks 5.1.3 Utility Software 15.1.4 Computer Architectures 15.1.5 Massively Parallel Computers 15.1.6 Concept of Virtual Machines 15.1.7 Benefits and Limitations of Virtual Machines

15.2.1 Truth Tables for Logic Circuits 15.2.2 Understanding Flip-Flops 15.2.3 Boolean Algebra and De Morgan’s Laws 15.2.4 Karnaugh Maps (K-map)

16. System Software (A Level)

16.1.1 Resource Optimization 16.1.2 User Interface Simplification 16.1.3 Process Management 16.1.4 Memory Management

16.2.1 Interpreters 16.2.2 Compilation Stages 16.2.3 Language Grammar Representation 16.2.4 Reverse Polish Notation (RPN)

16.1.1 Resource Optimization 16.1.2 User Interface Simplification 16.1.3 Process Management 16.1.4 Memory Management

16.2.1 Interpreters 16.2.2 Compilation Stages 16.2.3 Language Grammar Representation 16.2.4 Reverse Polish Notation (RPN)

17. Security (A Level)
Premium

17.1.1 Encryption Mechanisms 17.1.2 Quantum Cryptography 17.1.3 Secure Socket Layer (SSL)/Transport Layer Security (TLS)17.1.4 Digital Certificates and Signatures

17.1.1 Encryption Mechanisms 17.1.2 Quantum Cryptography 17.1.3 Secure Socket Layer (SSL)/Transport Layer Security (TLS)17.1.4 Digital Certificates and Signatures

18. Artificial Intelligence (AI) (A Level)
Premium

18.1.1 Graphs in AI 18.1.2 Artificial Neural Networks 18.1.3 Deep Learning and Machine Learning 18.1.4 Machine Learning Categories 18.1.5 Learning Algorithms and Techniques

18.1.1 Graphs in AI 18.1.2 Artificial Neural Networks 18.1.3 Deep Learning and Machine Learning 18.1.4 Machine Learning Categories 18.1.5 Learning Algorithms and Techniques

19. Computational Thinking and Problem-solving (A Level)
Premium

19.1.1 Searching Methods 19.1.2 Sorting Methods 19.1.3 Abstract Data Types (ADT)19.1.4 Graphs as an ADT 19.1.5 Implementation of ADTs 19.1.6 Algorithm Efficiency and Comparison

19.2.1 Understanding Recursion 19.2.2 Expressing Recursion in Programming 19.2.3 Writing Recursive Algorithms 19.2.4 Benefits of Recursion 19.2.5 Compiling Recursive Code

19.1.1 Searching Methods 19.1.2 Sorting Methods 19.1.3 Abstract Data Types (ADT)19.1.4 Graphs as an ADT 19.1.5 Implementation of ADTs 19.1.6 Algorithm Efficiency and Comparison

19.2.1 Understanding Recursion 19.2.2 Expressing Recursion in Programming 19.2.3 Writing Recursive Algorithms 19.2.4 Benefits of Recursion 19.2.5 Compiling Recursive Code

20. Further Programming (A Level)
Premium

20.1.1 Understanding Programming Paradigms 20.1.2 Low-level Paradigm 20.1.3 Imperative (Procedural) Paradigm 20.1.4 Object-Oriented Paradigm 20.1.5 Declarative Paradigm

20.2.1 File-Processing Operations 20.2.2 Understanding Exceptions 20.2.3 When to Use Exception Handling 20.2.4 Implementing Exception Handling

20.1.1 Understanding Programming Paradigms 20.1.2 Low-level Paradigm 20.1.3 Imperative (Procedural) Paradigm 20.1.4 Object-Oriented Paradigm 20.1.5 Declarative Paradigm

20.2.1 File-Processing Operations 20.2.2 Understanding Exceptions 20.2.3 When to Use Exception Handling 20.2.4 Implementing Exception Handling

Hire a tutor

Please fill out the form and we'll find a tutor for you.

Alternatively contact us via

WhatsApp, Phone Call, or Email

Send WhatsApp Message

+44 (0)1865 306636

info@tutorchase.com