Data structures

About this lab: Data structures

Interactive simulation for Cambridge AS & A Level Computer Science 9618 topics 10.4, 13.2 and 19.1: push and pop a stack with its top pointer, enqueue and dequeue in a linear or circular queue, insert, delete and search a linked list stored in arrays with a free list, build a binary search tree and watch pre-order, in-order and post-order traversals, and store keys in a hash table with collisions handled by the next free slot or an overflow area.

A-Level Computer Science 9618, topics 10.4, 13.2 and 19.1. Stacks, linear and circular queues, linked lists with a free list, binary search trees with traversals, and hash tables, each shown as the arrays and pointers used in Cambridge exams.

Data structures is a free, browser-based simulation for Cambridge International AS & A Level Computer Science 9618 (topic 1 Information representation; topic 10 Data types and structures, section 10.4 Introduction to Abstract Data Types (ADT); topic 13 Data representation, section 13.2 File organisation and access; topic 19 Computational thinking and problem-solving, section 19.1 Algorithms). The same lab serves both Cambridge IGCSE Computer Science 0478 and AS & A Level Computer Science 9618; tabs marked A-Level go beyond the IGCSE syllabus. The course is assessed in Paper 1 (Theory Fundamentals), Paper 2 (Problem-solving and Programming), Paper 3 (Advanced Theory), Paper 4 (Practical). Syllabus for examination in 2027-2029. There are 5 tabs, each a self-contained experiment with its own controls and live readings, and nothing to install: it runs on a laptop, tablet or classroom projector.

Syllabus coverage

• 1.1 Data Representation. Lessons: Binary and decimal prefixes, Binary, denary, hexadecimal and BCD, Two's complement and binary arithmetic, Character sets: ASCII, extended ASCII and Unicode.
• 1.2 Multimedia: Graphics, Sound. Lessons: Bitmap and vector graphics, Sampled sound.
• 1.3 Compression. Lessons: Lossy and lossless compression, run-length encoding.
• 10.4 Introduction to Abstract Data Types (ADT). Lessons: Stacks, queues and linked lists.
• 13.2 File organisation and access. Lessons: File organisation, access and hashing.
• 19.1 Algorithms. Lessons: Binary search, Insertion sort and comparing sorts, Stacks, queues, linked lists and binary trees, Comparing algorithms: Big O notation.
• 9618 19.1 Algorithms. Lessons: Binary search, Insertion sort and comparing sorts, Stacks, queues, linked lists and binary trees.
• 9618 13.2 File organisation and access. Lessons: File organisation, access and hashing.

Full syllabus map: A Level Computer Science 9618 topic 1, A Level Computer Science 9618 topic 10, A Level Computer Science 9618 topic 13, A Level Computer Science 9618 topic 19, A Level Computer Science 9618 topic 19 and A Level Computer Science 9618 topic 13.

How to use this simulation

1. 1. Stack.
2. 2. Queue.
3. 3. Linked list.
4. 4. Binary tree.
5. 5. Hash table.
6. The buttons at the end of the tab strip give the scene the whole window (Full screen, Hide controls) and, on a dark stage, a projector-friendly palette (Light scene). Many scenes also have drag handles: drag them to change the set-up directly.

All simulation labs · A Level Computer Science 9618 · TheLucidSTEM home