Comprehensive ADT revision for Cambridge A Level Computer Science 9618 Paper 2. This Exam Excellence Series resource covers every abstract data type on the specification — from stack and queue to binary search trees and graphs — with pseudocode implementations and exam-focused practice.

What’s included:
• Learning Objectives aligned to 9618 syllabus
• Syllabus Mapping (Paper 2, Sections 4.1 & 4.2)
• Knowledge Organiser — all 6 ADTs with key principles and use cases
• Complete Revision Notes — Stack (LIFO, PUSH/POP with array), Queue (FIFO, circular queue), Linked List, Binary Search Tree (BST, in-order traversal), Graph (adjacency matrix vs list), Hash Table
• Worked Examples — tracing PUSH and POP operations with pointer values at each step
• Common Mistakes — LIFO vs FIFO confusion, pointer update errors, BST insertion errors
• Examiner Tips — always show pointer values at each step in trace questions
• Exam Technique — for 6-mark questions: definition + operations + diagram + use case
• Exam-Style Questions (BST construction, stack pseudocode)
• Topic 91¶¶Òõt
• Mini Mock Exam
• Full Mock Exam
• Detailed Mark Scheme
• Model Answers
• Revision Checklist
• Progress Tracker
• Glossary (6 key terms)

Covers Cambridge 9618 Paper 2 ADT requirements in full.

If you found this useful, please leave a review. it really helps!

Check out my other resources and bundles in my TES shop.