ConceptSystems & CS
Linked list
A data structure consisting of a sequence of nodes, where each node contains data and a pointer to the next node in the sequence.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
20The first 12 are shown.
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
- Breadth-First Search (BFS)
- Read-Copy-Update (RCU)
- Computational Objects
- Storage Allocation
- Graph Optimization
- Randomization: Universal & Perfect Hashing
- Dictionaries
- Cache-Oblivious Structures I
- Storage Allocation and Garbage Collection
- Persistent Data Structures
Connections
28The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures21
- Data Structures
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
- Breadth-First Search (BFS)
- Read-Copy-Update (RCU)
- Computational Objects
Show 15 moreShow fewer
- Storage Allocation
- Graph Optimization
- Randomization: Universal & Perfect Hashing
- Dictionaries
- Cache-Oblivious Structures I
- Storage Allocation and Garbage Collection
- Persistent Data Structures
- The Architecture and Bytecode Virtual Machine of SQLite
- Cryptocurrency: An Overview and Critique
- Randomization: Skip Lists
- The DEC VT100 Terminal: An 8-Bit Computer Deep Dive
- Memory Hierarchy Models
- Data Tracking
- Storage Allocation and Garbage Collection
- Cybersecurity