Data Structures & Databases is a core part of IB Computer Science. Revise the key concepts and common mistakes below, then lock them in with the free games.
Key concepts
StackLIFO structure with push/pop; used in call stacks, expression evaluation, undo features.
QueueFIFO structure with enqueue/dequeue; used in scheduling, breadth-first search, print spoolers.
Linked listSequence of nodes with data and pointer to next; dynamic size; O(n) access.
Binary treeHierarchical structure with up to two children per node; balanced trees give O(log n) operations.
Hash tableKey-value store using hash function; average O(1) lookup; collisions handled by chaining or open addressing.
GraphVertices and edges; directed/undirected, weighted; algorithms include Dijkstra (1959) shortest path.
TableRelation: rows and named columns.
Row/TupleSingle record in a table.
Primary keyUnique identifier for each row.
Foreign keyReferences primary key of another table.
EntityReal-world object represented as a table.
ER diagramModels entities and their relationships.
1NFAtomic values, no repeating groups.
2NF1NF + no partial dependence on key.
L
Learn Data Structures & Databases step by step
Free interactive mini-lessons: short screens, worked examples and quick checks. Pick your exam board:
