TutorChase logo
Login

AQA A-Level Computer Science

Study notes
1.1.1 Data types and data structures
1.1.2 Programming constructs and control flow
1.1.3 Arithmetic, relational and Boolean operations
1.1.4 Constants, variables, and scope
1.1.5 String-handling operations
1.1.6 Random number generation and exception handling
1.1.7 Subroutines: Definition, Use, and Parameters
1.2.1 The structured approach to programming
1.2.2 Hierarchy charts in program design
1.2.3 Advantages of the structured programming approach
2.1.1 Introduction to data structures
2.1.2 Arrays: single- and multi-dimensional
2.1.3 Fields and records
2.1.4 File handling: text and binary files
3.1.1 Problem definition and analysis
3.1.2 Design process and modular structure
3.1.3 Implementation and code development
3.1.4 Testing and validation
3.1.5 Evaluation of solutions
4.1.1 Problem-solving and logic
4.1.2 Understanding and writing algorithms
4.1.3 Representational and general abstraction
4.1.4 Information hiding
4.1.5 Procedural abstraction
4.1.6 Functional abstraction
4.1.7 Data abstraction
4.1.8 Problem abstraction/reduction
4.1.9 Decomposition
4.1.10 Composition
4.1.11 Automation and executable models
4.2.1 Introduction to finite state machines
4.2.2 Drawing state transition diagrams
4.2.3 Interpreting state transition diagrams
4.2.4 Constructing and interpreting state transition tables
4.2.5 Designing FSMs for simple problems
5.1.1 Natural numbers (ℕ)
5.1.2 Integer numbers (ℤ)
5.1.3 Rational numbers (ℚ)
5.1.4 Irrational numbers
5.1.5 Real numbers (ℝ)
5.1.6 Ordinal numbers
5.1.7 Counting and measurement
5.2.1 Understanding the concept of number bases
5.2.2 Decimal (base 10) system
5.2.3 Binary (base 2) system
5.2.4 Hexadecimal (base 16) system
5.2.5 Conversion between number bases
5.3.1 Bits and their role in information
5.3.2 Bytes and bit groupings
5.3.3 Bit combinations and representation capacity
5.3.4 Binary prefixes (powers of 2)
5.3.5 Decimal prefixes (powers of 10)
5.3.6 Historical context and terminology conflicts document
5.4.1 Understanding unsigned binary
5.4.2 Arithmetic with unsigned binary
5.4.3 Signed binary and two’s complement
5.4.4 Fixed-point binary and fractional representation
5.5.1 Character code vs binary representation
5.5.2 ASCII and Unicode character sets
5.5.3 Error detection and correction methods
5.6.1 Bit patterns and data representation
5.6.2 Analogue vs digital data and signals
5.6.3 Analogue to digital and digital to analogue conversion
5.6.4 Bitmapped graphics representation
5.6.5 Digital representation of sound
5.6.6 MIDI (Musical Instrument Digital Interface)
5.6.7 Data compression techniques
5.6.8 Encryption principles and methods
6.1.1 Understanding hardware and software
6.1.2 Classification of software
6.1.3 Types of system software
6.1.4 Operating system and resource management
6.2.1 Evolution and classification of programming languages
6.2.2 Low-level languages: machine code
6.2.3 Low-level languages: assembly language
6.2.4 High-level languages and imperative paradigm
6.2.5 Comparison: low-level vs high-level programming
6.3.1 Role of an assembler
6.3.2 Role of a compiler
6.3.3 Role of an interpreter
6.3.4 Compilation vs interpretation
6.3.5 Intermediate code and bytecode
6.3.6 Source code vs object code
6.4.1 Logic gate types and symbols
6.4.2 Constructing and interpreting logic gate circuits
6.4.3 Boolean expressions and logic circuits
6.4.4 Drawing circuits from Boolean expressions
6.5.1 Boolean algebra fundamentals
6.5.2 Boolean identities and simplification
6.5.3 De Morgan’s laws
6.5.4 Expression transformation and circuit simplification
7.1.1 Overview of internal components
7.1.2 Buses and system communication
7.1.3 Von Neumann architecture
7.1.4 Harvard architecture
7.1.5 Addressable memory
7.2.1 Definition and purpose of the stored program concept
7.2.2 Fetch–decode–execute cycle in context of stored program
7.2.3 Advantages of the stored program concept
7.2.4 Historical background and impact on modern systems
7.3.1 The role of the processor and its components
7.3.2 The Fetch–Decode–Execute (FDE) cycle
7.3.3 Processor instruction set and opcodes
7.3.4 Addressing modes
7.3.5 Assembly language operations
7.3.6 Factors affecting processor performance
7.4.1 Barcode readers
7.4.2 Digital cameras
7.4.3 Laser printers
7.4.4 RFID (Radio Frequency Identification)
7.4.5 The need for secondary storage
7.4.6 Hard disk drives (HDD)
7.4.7 Optical disks
7.4.8 Solid-state drives (SSD)
7.4.9 Comparison of storage devices
8.1.1 Overview of moral, ethical, legal and cultural considerations
8.1.2 Transformations in communication and information flow
8.1.3 Risks and opportunities in computing
8.1.4 The responsibility and power of computer scientists
8.1.5 Ethics in algorithm design and deployment
8.1.6 Scale and global impact
8.1.7 Legislative challenges in the digital age
8.1.8 Using hypotheticals and case studies
9.1.1 Serial and parallel transmission
9.1.2 Synchronous vs asynchronous transmission
9.1.3 Start and stop bits in asynchronous transmission
9.1.4 Communication terminology: baud rate, bit rate, bandwidth, latency, protocol
9.1.5 Relationship between bit rate and baud rate
9.1.6 Relationship between bit rate and bandwidth
9.2.1 Physical and logical network topologies
9.2.2 Peer-to-peer networking
9.2.3 Client-server networking
9.2.4 Purpose and components of WiFi networks
9.2.5 Wireless network security
9.2.6 CSMA/CA and RTS/CTS protocol
10.1.1 Built-in data types
10.1.2 Core programming constructs
10.1.3 Arithmetic operations
10.1.4 Relational operations
10.1.5 Boolean operations
10.1.6 Variables vs constants
10.1.7 String-handling operations
10.1.8 Random number generation
10.1.9 Exception handling
10.1.10 Subroutines
10.1.11 Parameters in subroutines
10.1.12 Returning values from subroutines
10.1.13 Local variables in subroutines
10.1.14 Global variables
10.1.15 Stack frames in subroutine calls
10.1.16 Recursion
10.2.1 Introduction to programming paradigms
10.2.2 Structured programming principles
10.2.3 Object-oriented programming foundations
10.2.4 Inheritance, aggregation, and composition
10.2.5 Polymorphism and method overriding
10.2.6 Object-oriented design principles
10.2.7 Practical implementation and class design
11.1.1 Introduction to data structures
11.1.2 Single-dimensional arrays
11.1.3 Multi-dimensional arrays
11.1.4 Records and fields
11.1.5 Reading and writing text files
11.1.6 Reading and writing binary files
11.1.7 Introduction to abstract data types (ADTs)
11.1.8 Using ADTs in code
11.1.9 Static vs dynamic structures
11.1.10 Queues: creation and maintenance
11.1.11 Stacks: creation and maintenance
11.1.12 Hash tables and dictionaries
11.1.13 Trees and graphs
11.2.1 Linear queues
11.2.2 Circular queues
11.2.3 Priority queues
11.2.4 Queue operations summary and comparison
11.3.1 Concept of a stack (LIFO)
11.3.2 Push operation
11.3.3 Pop operation
11.3.4 Peek/top operation
11.3.5 Testing for empty/full stack
11.3.6 Implementation and applications of stacks
11.4.1 Introduction to graphs
11.4.2 Types of graphs
11.4.3 Components and terminology
11.4.4 Adjacency matrix representation
11.4.5 Adjacency list representation
11.4.6 Comparison of adjacency matrix vs list
11.5.1 Introduction to trees
11.5.2 Rooted trees and parent-child relationships
11.5.3 Binary trees
11.5.4 Binary search trees (BSTs)
11.5.5 Applications of trees
11.6.1 Concept of a hash table
11.6.2 Hash functions and hashing algorithms
11.6.3 Collisions and rehashing
11.6.4 Applications and evaluation
11.7.1 Concept and structure of a dictionary
11.7.2 Dictionary operations
11.7.3 Simple applications of dictionaries
11.7.4 Implementation and usage in programming
11.8.1 Definition and representation of vectors
11.8.2 Representing vectors in programming languages
11.8.3 Visualising vectors geometrically
11.8.4 Vector operations: addition and scalar multiplication
11.8.5 Convex combination of vectors
11.8.6 Dot (scalar) product of vectors
11.8.7 Applications of the dot product
12.1.1 Introduction to graph traversal
12.1.2 Breadth-first search (BFS)
12.1.3 Depth-first search (DFS)
12.1.4 Comparing BFS and DFS
12.2.1 Introduction to tree traversal
12.2.2 Pre-order traversal
12.2.3 In-order traversal
12.2.4 Post-order traversal
12.2.5 Comparing traversal methods and their uses
12.3.1 Introduction to Reverse Polish Notation (RPN)
12.3.2 Converting infix to RPN
12.3.3 Converting RPN to infix
12.3.4 Uses and advantages of RPN
12.3.5 Evaluating RPN expressions using a stack
12.4.1 Linear Search
12.4.2 Binary Search
12.4.3 Binary Tree Search
12.5.1 Bubble Sort – Overview and concept
12.5.2 Bubble Sort – Tracing and implementation
12.5.3 Bubble Sort – Time complexity analysis
12.5.4 Merge Sort – Overview and concept
12.5.5 Merge Sort – Tracing and implementation
12.5.6 Merge Sort – Time complexity analysis
12.6.1 Introduction to optimisation problems
12.6.2 Understanding Dijkstra’s algorithm
12.6.3 Tracing Dijkstra’s algorithm step-by-step
12.6.4 Applications of Dijkstra’s algorithm
13.1.1 Problem-solving
13.1.2 Following and writing algorithms
13.1.3 Abstraction
13.1.4 Information hiding
13.1.5 Procedural abstraction
13.1.6 Functional abstraction
13.1.7 Data abstraction
13.1.8 Problem abstraction/reduction
13.1.9 Decomposition
13.1.10 Composition
13.1.11 Automation
13.2.1 FSMs with and without output
13.2.2 Set theory foundations for regular expressions
13.2.3 Regular expressions – syntax and usage
13.2.4 FSMs and regular expressions – equivalence
13.2.5 Regular language
13.3.1 Understanding context-free languages
13.3.2 Introduction to Backus-Naur Form (BNF)
13.3.3 Using BNF to define and parse syntax
13.3.4 Understanding syntax diagrams
13.3.5 Expressiveness of BNF vs regular expressions
13.4.1 Comparing algorithms
13.4.2 Maths for understanding Big-O notation
13.4.3 Order of complexity
13.4.4 Limits of computation
13.4.5 Classification of algorithmic problems
13.4.6 Computable and non-computable problems
13.4.7 Halting problem
13.5.1 Structure and concept of a Turing machine
13.5.2 Representation of transition rules
13.5.3 Hand-tracing simple Turing machines
13.5.4 Importance of Turing machines in computation
14.1.1 Natural numbers
14.1.2 Integer numbers
14.1.3 Rational numbers
14.1.4 Irrational numbers
14.1.5 Real numbers
14.1.6 Ordinal numbers
14.1.7 Counting and measurement
14.2.1 Understanding number bases
14.2.2 Decimal (base 10)
14.2.3 Binary (base 2)
14.2.4 Hexadecimal (base 16)
14.2.5 Converting between number bases
14.2.6 Applications of hexadecimal
14.3.1 Bits and Binary Concepts
14.3.2 Representing data with multiple bits
14.3.3 Binary prefixes – powers of 2
14.3.4 Decimal prefixes – powers of 10
14.3.5 Comparing binary and decimal units
14.3.6 Historical context and standards
14.4.1 Unsigned Binary Representation
14.4.2 Unsigned Binary Arithmetic
14.4.3 Signed Binary using Two’s Complement
14.4.4 Numbers with a Fractional Part
14.4.5 Rounding Errors
14.4.6 Absolute and Relative Errors
14.4.7 Range and Precision
14.4.8 Normalisation of Floating Point Form
14.4.9 Underflow and Overflow
14.5.1 Character Form of a Decimal Digit
14.5.2 ASCII and Unicode
14.5.3 Error Checking and Correction
14.6.1 Bit Patterns for Data
14.6.2 Analogue vs Digital
14.6.3 ADC and DAC
14.6.4 Bitmapped Graphics
14.6.5 Vector Graphics
14.6.6 Bitmap vs Vector
14.6.7 Digital Sound Representation
14.6.8 MIDI
14.6.9 Data Compression
14.6.10 Encryption
15.1.1 Definition and Relationship between Hardware and Software
15.1.2 Classification of Software
15.1.3 Types of System Software
15.1.4 Role of the Operating System (OS)
15.2.1 Historical Development and Classification
15.2.2 Low-Level Languages: Machine Code
15.2.3 Low-Level Languages: Assembly Language
15.2.4 High-Level Languages
15.2.5 Imperative High-Level Languages
15.2.6 Comparison of Language Types
15.3.1 Role of a Translator
15.3.2 Assembler
15.3.3 Compiler
15.3.4 Interpreter
15.3.5 Compilation vs Interpretation
15.3.6 Intermediate Code and Bytecode
15.3.7 Source Code vs Object Code
15.4.1 Basic Logic Gates
15.4.2 Logic Gate Circuits
15.4.3 Boolean Expressions
15.4.4 Gate Circuits from Boolean Expressions
15.4.5 Adders (Half-Adder and Full-Adder)
15.4.6 D-Type Flip-Flop
15.5.1 Boolean Algebra Basics
15.5.2 Boolean Identities
15.5.3 De Morgan’s Laws
15.5.4 Simplifying Boolean Expressions
15.5.5 Applications of Simplification
16.1.1 Overview of Internal Components
16.1.2 The Processor (CPU)
16.1.3 Main Memory
16.1.4 Buses
16.1.5 I/O Controllers
16.1.6 Communication Between Components
16.1.7 Von Neumann Architecture
16.1.8 Harvard Architecture
16.1.9 Von Neumann vs. Harvard Architecture
16.1.10 Addressable Memory
16.2.1 The Stored Program Concept – Definition
16.2.2 Fetch-Execute Model
16.2.3 Memory and Instruction Storage
16.2.4 Role of the Processor
16.2.5 Importance in Modern Computing
16.2.6 Benefits and Implications
16.3.1 Role of the Processor and Its Major Components
16.3.2 The Fetch-Execute Cycle
16.3.3 Instruction Set Architecture
16.3.4 Addressing Modes
16.3.5 Machine Code and Assembly Operations
16.3.6 Interrupts
16.3.7 Processor Performance Factors
16.4.1 Input Devices – Characteristics and Operation
16.4.2 Output Devices – Purposes and Suitability
16.4.3 Need for Secondary Storage
16.4.4 Secondary Storage Devices – Characteristics and Principles
16.4.5 SSD Architecture – Technical Insights
16.4.6 Media Comparison and Suitability
17.1.1 Moral and Ethical Implications
17.1.2 Social Impacts of Computing
17.1.3 Legal Implications
17.1.4 Cultural Considerations
17.1.5 Personal Data and Behavioural Monitoring
17.1.6 Dissemination and Communication of Information
17.1.7 Power and Responsibility in Technology
17.1.8 Scale of Impact
17.1.9 Role of Legislators and Legal Systems
17.1.10 Hypotheticals and Case Studies as Teaching Tools
17.1.11 Student Analysis of Scenarios
18.1.1 Serial and Parallel Transmission
18.1.2 Synchronous vs Asynchronous Transmission
18.1.3 Start and Stop Bits
18.1.4 Baud Rate
18.1.5 Bit Rate
18.1.6 Bandwidth
18.1.7 Latency
18.1.8 Protocol
18.1.9 Relationship Between Bit Rate and Baud Rate
18.1.9 Relationship Between Bit Rate and Baud Rate
18.2.1 Physical Star Topology
18.2.2 Logical Bus Network Topology
18.2.3 Peer-to-Peer Networking
18.2.4 Client-Server Networking
18.2.5 Purpose of WiFi
18.2.6 Components of Wireless Networking
18.2.7 Wireless Network Security
18.2.8 CSMA/CA Protocol
18.2.9 Service Set Identifier (SSID)
18.3.1 Structure of the Internet
18.3.2 Packet Switching and Routers
18.3.3 Gateways
18.3.4 Internet Routing
18.3.5 URLs and FQDNs
18.3.6 DNS and Domain Name Structure
18.3.7 Internet Registries
18.3.8 Firewalls and Internet Security
18.3.9 Encryption and Key Exchange
18.3.10 Digital Certificates and Signatures
18.3.11 Malware: Worms, Trojans, and Viruses
18.3.12 Prevention and Mitigation
18.4.1 The TCP/IP stack and its layers
18.4.2 Role of sockets in networking
18.4.3 Media Access Control (MAC) addresses
18.4.4 Well-known and client ports
18.4.5 Common application layer protocols
18.4.6 Web server and browser roles
18.4.7 Structure of an IP address
18.4.8 Subnet masking
18.4.9 Public vs private IP addresses
18.4.10 Dynamic Host Configuration Protocol (DHCP)
18.4.11 Network Address Translation (NAT)
18.4.12 Port forwarding document
18.4.13 Client-server model
18.4.14 WebSocket protocol
18.4.15 Web CRUD and REST principles
18.4.16 JSON vs XML
18.4.17 Thin vs thick client computing
19.1.1 Understanding entities and attributes
19.1.2 Constructing entity relationship diagrams (ERDs)
19.1.3 Developing data models from scenarios
19.2.1 Concept and Structure of a Relational Database
19.2.2 Attributes
19.2.3 Primary Key and Composite Primary Key
19.2.4 Foreign Key
19.3.1 Purpose and Concept of Normalisation
19.3.2 Steps of Normalisation (1NF to 3NF)
19.3.3 Application and Evaluation of Normalisation
19.4.1 SQL Data Query Language (DQL) – Retrieval of Data
19.4.2 SQL Data Manipulation Language (DML) – Modify Data
19.4.3 SQL Data Definition Language (DDL) – Create Table Structure
19.5.1 Concept and Structure of Client-Server Databases
19.5.2 The Need for and Challenges of Concurrent Access
19.5.3 Concurrency Control Techniques
20.1.1 Definition and Characteristics of Big Data
20.1.2 Machine Learning and Pattern Extraction
20.1.3 Distributed Processing and Scalability
20.1.4 Functional Programming for Big Data
20.1.5 Graph Schema and Fact-Based Data Models
21.1.1 Function type and mathematical notation
21.1.2 First-class objects
21.1.3 Function application
21.1.4 Partial function application
21.1.5 Function composition
21.2.1 Constructing simple functional programs
21.2.2 Higher-order functions
21.2.3 Use of map, filter, reduce/fold
21.3.1 Concept and structure of lists
21.3.2 List operations and transformations
21.3.3 Writing and testing list functions in a functional language
22.1.1 Problem Analysis and Requirement Gathering
22.1.2 Software Design Principles
22.1.3 Implementation and Development
22.1.4 Software Testing and Validation
22.1.5 Evaluation of the Final System

Hire a tutor

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

1/2
Your details
Alternatively contact us via
WhatsApp, Phone Call, or Email
Send WhatsApp Message
+44 (0)1865 306636
info@tutorchase.com