Conquer

The AcademyWelcome back

Skip to content

ConquerYOUR A LEVELS

Subjects

CCambridge EPearson Edexcel AQAAQA OCROCR

Competitive Study space Mistake Bank AI Marking

Log in Create free account

Study space Mistake Bank AI Marking

Subjects

CCambridge EPearson Edexcel AQAAQA OCROCR

Competitive Log in Create free account

Computer Science · 9618

Advanced Theory

01Data Representation

User-defined Data Types5

User-defined and enumerated types Pointers and dereferencing Records and composite types Sets and membership Classes and objects

File Organisation and Access3

Serial, sequential and random files Sequential and direct access Hashing and collisions

Floating-point Representation5

Binary fractions and floating point Floating-point conversion Floating-point normalisation Floating-point precision and range Approximation and rounding errors

02Communication and Internet Technologies

Protocols4

TCP/IP protocol stack HTTP and FTP Email protocols BitTorrent file sharing

Switching and Routing2

Circuit and packet switching Routers and hop limits

03Hardware and Virtual Machines

Processors and Virtual Machines4

RISC and CISC Pipelining and interrupts Parallel processing Virtual machines

Boolean Algebra and Circuits5

Boolean algebra and De Morgan's laws Half and full adders SR and JK flip-flops Karnaugh maps Four-variable K-maps

04System Software

Operating Systems6

OS resources and user interface Process states and interrupts FCFS and shortest job first Round robin and shortest remaining time Paging and segmentation Virtual memory and page replacement

Translation Software3

Interpreters and compilation BNF and syntax diagrams Reverse Polish Notation

05Security

Encryption and Authentication5

Symmetric and asymmetric encryption Digital signatures Digital certificates SSL and TLS Quantum Key Distribution

06Artificial Intelligence

Artificial Intelligence7

Graphs and search states Dijkstra shortest-path search A* search Machine learning categories Neural networks and back propagation Regression models Reinforcement learning

07Computational Thinking and Problem-solving

Algorithms and Data Structures12

Linear search implementation Binary search implementation Bubble sort implementation Insertion sort implementation ADT interfaces and implementations Stack implementation Circular queue implementation Linked-list implementation Binary search tree implementation Dictionary implementation Big O time and space Recursion and call stacks

08Further Programming

Programming Paradigms7

Programming paradigms Advanced addressing and low-level code Procedural programming Classes, objects and encapsulation Inheritance and polymorphism Aggregation and class design Declarative facts, rules and goals

File Processing and Exception Handling4

Serial text-file processing Sequential file insertion Random-file processing Exception handling

Revision Notes Practice Questions Topical Past Paper Questions Past Papers

Resources

Revision Notes Practice Questions Topical Past Paper Questions Past Papers

Advanced Theory/Further Programming

Procedural programming

Practise Further Programming

Contents

Computer Science · 9618

Advanced Theory

01Data Representation

User-defined Data Types5

User-defined and enumerated types Pointers and dereferencing Records and composite types Sets and membership Classes and objects

File Organisation and Access3

Serial, sequential and random files Sequential and direct access Hashing and collisions

Floating-point Representation5

Binary fractions and floating point Floating-point conversion Floating-point normalisation Floating-point precision and range Approximation and rounding errors

02Communication and Internet Technologies

Protocols4

TCP/IP protocol stack HTTP and FTP Email protocols BitTorrent file sharing

Switching and Routing2

Circuit and packet switching Routers and hop limits

03Hardware and Virtual Machines

Processors and Virtual Machines4

RISC and CISC Pipelining and interrupts Parallel processing Virtual machines

Boolean Algebra and Circuits5

Boolean algebra and De Morgan's laws Half and full adders SR and JK flip-flops Karnaugh maps Four-variable K-maps

04System Software

Operating Systems6

OS resources and user interface Process states and interrupts FCFS and shortest job first Round robin and shortest remaining time Paging and segmentation Virtual memory and page replacement

Translation Software3

Interpreters and compilation BNF and syntax diagrams Reverse Polish Notation

05Security

Encryption and Authentication5

Symmetric and asymmetric encryption Digital signatures Digital certificates SSL and TLS Quantum Key Distribution

06Artificial Intelligence

Artificial Intelligence7

Graphs and search states Dijkstra shortest-path search A* search Machine learning categories Neural networks and back propagation Regression models Reinforcement learning

07Computational Thinking and Problem-solving

Algorithms and Data Structures12

Linear search implementation Binary search implementation Bubble sort implementation Insertion sort implementation ADT interfaces and implementations Stack implementation Circular queue implementation Linked-list implementation Binary search tree implementation Dictionary implementation Big O time and space Recursion and call stacks

08Further Programming

Programming Paradigms7

Programming paradigms Advanced addressing and low-level code Procedural programming Classes, objects and encapsulation Inheritance and polymorphism Aggregation and class design Declarative facts, rules and goals

File Processing and Exception Handling4

Serial text-file processing Sequential file insertion Random-file processing Exception handling

Search resources