OCR A-Level (H466)

Computer Science

From the #1 on the SmartRevise Leaderboards
*as of 15/03/2026 (score+mastery) and 01/01/2026 (questions)

#1

Score, Mastery, Question Attempts*
(SmartRevise)

Latest Post

Web Tech (1.3.4)

This page will cover the following (a) HTML, CSS and Javascript (b) Search engine indexing (c) PageRank Algorithm (d) Server and client side processing Throughout this post the following example is used: Harry Styles Together Together Tour Setlist Viewer Which is available here: https://drive.google.com/drive/folders/101mGdi8SFa3Wcn1U66WKqUPyRT-TSNwb?usp=sharing HTML HTML is Hyper Text Markup Language. It's used to define the structure and elements on a web page. Elements are

Quick Links

All Posts

Web Tech (1.3.4)

This page will cover the following (a) HTML, CSS and Javascript (b) Search engine indexing (c) PageRank Algorithm (d) Server and client side processing Throughout this post the following example is used: Harry Styles Together Together Tour Setlist Viewer Which is available here: https://drive.google.com/drive/folders/101mGdi8SFa3Wcn1U66WKqUPyRT-TSNwb?usp=sharing HTML HTML is Hyper Text Markup Language. It's used to define the structure and elements on a web page. Elements are

Data Structures - Linked Lists (1.4.2)

This post covers the following topics: Linked Lists Linked Lists Linked lists are the most common type of dynamic data structure, as they are dynamic they can grow to any size that is required. Their size isn't declared at the beginning on the program. Linked lists are made up of nodes and pointers, each node stores the pointer to the next node, this makes them extremely flexible and powerful data structured. They can implement all types of data stores. Here's an example of a

Data Structures - Stacks and Queues (1.4.2)

This post covers the following topics: Stacks Queues Stacks (LIFO) A stack handles linear lists of data, stacks follow Last-In First-Out (LIFO) . This means that the most recent piece of data to be placed onto the stack is the first piece to be taken off of it. Example of Last-In First-Out (Stack) To add data to a stack it's pushing to the stack and to take data off the stack it's popping . Stacks can be implemented easily using an array or linked list and a variable to poin

Data structures - Arrays, tuples, lists and records (1.4.2)

This post covers the following topics: Static vs Dynamic Arrays Tuples Records Static vs Dynamic In static data structures the size of the structure is set at the beginning of the program when the data structure is created, the size cannot be changed. This makes the data structures easier to implement but they are more limited. In dynamic data structures there is no size limit and they can expand and shrink as needed. This does make them more complex than static data structur

Databases (1.3.1)

This post covers the following topics: Database Table Record Field Entities and relationships Use of keys: primary key, foreign key, secondary key, composite key Database tools: query, form, report Methods of importing external data into a database Flatfile vs relational database Data redundancy Types of validations Validation vs verification DBMS (database management system) ERD (Entity Relationship Modelling - degrees of relationships, issues with M:M relationships and how

Scheduling (1.2.1)

Scheduling is how and when a process (can be referred to as a "job") is swapped in and out of the CPU (given time slices) to allow for multitasking. A schedular handles this, it manages which process to execute next and it manages the length of time the next process can execute for. The ready queue is where all processes are kept, then a process is removed from the queue and enteres a running state where the CPU is executing it. A process can either finish execution and leav

Paging, Segmentation and Interrupts (1.2.1)

Paging and Segmentation Similarities and Differences of Paging and Segmentation. From Craig n' Dave (incl in end of topic test) Pages are all fixed size , pages are physical divisions made to fit sections of memory. Paging doesn't take into account how it splits the program, only that it's split into fixed-size pages. Could split within a looping condition which wouldn't be very efficient, it's better to keep thse instructions together. Segments are different sizes , they ar

Use of object oriented techniques. (2.2.1)

This post covers the following from the specification (2.2.1): (a) Programming constructs: sequence, iteration, branching. (b) Recursion, how it can be used and compares to an iterative approach. (c) Global and local variables. (d) Modularity, functions and procedures, parameter passing by value and by reference. (e) Use of an IDE to develop/debug a program. (f) Use of object oriented techniques. (the bold init within these notes is due to wix applying markdown formatting an

1.2.1 - Systems Software - Operating Systems

What do they do? An operating system is software that manages and provides interfaces to the hardware of the computer system such as hardware management (including memory management, CPU scheduling for time slices). Using this interface it means that applications can run on top of the operating system and handle tasks such as memory management and storing data to secondary storage, as the Operating System provides interfaces for these that will then interact with the hardware

Software methodologies

Part 1 - What is the Software development lifecycle (SDLC)? The software development lifecycle contains the following stages: Feasibility - Can the problem be solved? Requirements - The things the solution needs to do. Analysis and design - Working out how the solution needs to do it Implementation - Creating the solution Testing - Ensuring it works Deployment - Setting it up in a production environment Evaluation - Checking that the user is happy with the solution and it mee

2

Found an issue?

If you've found a mistake on ocr2.org.uk please report them here. This form takes all sorts of mistakes like spelling mistakes (there is none don't even try), content mistakess, etc.

OCR A-Level (H466)

Computer Science

From the #1 on the SmartRevise Leaderboards *as of 15/03/2026 (score+mastery) and 01/01/2026 (questions)

#1

Score, Mastery, Question Attempts* (SmartRevise)

Latest Post

Web Tech (1.3.4)

Quick Links

All Posts

Web Tech (1.3.4)

Data Structures - Linked Lists (1.4.2)

Data Structures - Stacks and Queues (1.4.2)

Data structures - Arrays, tuples, lists and records (1.4.2)

Databases (1.3.1)

Scheduling (1.2.1)

Paging, Segmentation and Interrupts (1.2.1)

Use of object oriented techniques. (2.2.1)

1.2.1 - Systems Software - Operating Systems

Software methodologies

Found an issue?

From the #1 on the SmartRevise Leaderboards
*as of 15/03/2026 (score+mastery) and 01/01/2026 (questions)

Score, Mastery, Question Attempts*
(SmartRevise)