Array
One word, taught differently in 2 fields. Each use is given apart.
In Systems & CS
A collection of data values that are stored contiguously in the computer's memory.
In Music & Film
A collection class that represents a singular ordered object containing multiple items accessed via numerical indices.
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.
In Systems & CS
1David J. Malan
In Music & Film
1Lectures that assume it
49The first 12 are shown.
- Priority Queues, Binary Heaps & O(n) Build-Max-Heap
- Binary Search Trees & Runway Reservation Scheduling
- Insertion Sort, Binary Insertion & Merge Sort Recurrences
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
- Inventing on Principle
- Breadth-First Search (BFS)
- The Raft Consensus Algorithm: Leader Election & Log Replication
- A Practical Guide to Data-Oriented Design
- Cache-Oblivious Algorithms
- Hardness within P
Connections
62The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures53
- Fundamentals of Creative Audio Coding I: SuperCollider Environment and Core Programming Concepts (MUS 403, Week 1)
- Arrays
- Algorithms
- Data Structures
- Priority Queues, Binary Heaps & O(n) Build-Max-Heap
- Binary Search Trees & Runway Reservation Scheduling
Show 47 moreShow fewer
- Insertion Sort, Binary Insertion & Merge Sort Recurrences
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Hashing with Chaining, Simple Uniform Hashing & Universal Families
- Static & Dynamic Hash Tables (Linear Probe, Robin Hood, Cuckoo, Extendible)
- Inventing on Principle
- Breadth-First Search (BFS)
- The Raft Consensus Algorithm: Leader Election & Log Replication
- A Practical Guide to Data-Oriented Design
- Cache-Oblivious Algorithms
- Hardness within P
- Amortization: Amortized Analysis
- Bentley Rules for Optimizing Work
- Bit Hacks
- Storage Allocation
- Graph Optimization
- Integer Models
- Table Doubling, Karp-Rabin
- Open Addressing, Cryptographic Hashing
- Static Trees
- Algorithmic Thinking & Peak Finding in 1D and 2D
- Models of Computation, Random Access Machine & Document Distance
- Cache-Oblivious Structures I
- Symbolic Execution
- Introduction to Parallel Programming with OpenMP (Part 2)
- CS61B Lecture 6: Testing
- GPU Architectures II & Memory Overview and Technology (ETH Zürich, Digital Design and Computer Architecture, Lecture 20)
- Spelled-Out Intro to Language Modeling: Building makemore (Bigram & Cross-Entropy)
- Divide & Conquer: Van Emde Boas Trees
- Memory Management, Pointers, and Buffer Overflows
- Making Sound: SuperCollider Audio Server Fundamentals (MUS 403, Week 2)
- Modern Systems Programming in Pure C: Memory Ownership, APIs & Debugging
- Memory
- Asymptotic Complexity and Peak Finding (MIT 6.006, Recitation 1)
- Cache-Oblivious Structures II
- Massive Open Online Courses (MOOCs): How Do They Work?
- Python
- Data Parallel Haskell
- Virtual Memory for Applications
- Rotate, Compute, Rotate
- Software Engineering II Lecture
- Making Sound (cont.) - Envelopes, Multichannel Expansion, Synth & SynthDef in SuperCollider
- Assembly Programming
- Programming Clusters (MPI) and GPUs
- Sequencing (cont.) - Creative Audio Coding I (MUS 403, Week 8)
- Sampling (Cont.): Envelopes, Phasor UGen, Chorus Effects, and Buffer Recording UGens
- Cybersecurity
- Scan at the Speed of Light