Loop
One word, taught differently in 2 fields. Each use is given apart.
In Systems & CS
The ability in Python and other programming languages to do something again and again in a cycle.
In Mathematics
A closed path formed by a subset of edges in a graph.
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 Mathematics
1Lectures that assume it
46The first 12 are shown.
Connections
57The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures50
Show 44 moreShow fewer
- Cache-Oblivious Algorithms
- Functions as Objects
- Decomposition, Abstraction, and Functions
- Hardness within P
- Bentley Rules for Optimizing Work
- Races and Parallelism
- SQL & Relational Databases
- Recursion
- Reasoning About Programs
- Timing Programs and Counting Operations
- Go Concurrency Patterns, Condition Variables & Raft Prep
- Advanced Branch Prediction
- List Comprehension, Functions as Objects, Testing, and Debugging in Python
- Multicore Programming
- Arrays
- Algorithms
- What Compilers Can and Cannot Do
- Introduction to Parallel Programming with OpenMP (Part 2)
- Iterators, Iterable, equals, toString
- Storage Allocation and Garbage Collection
- Big Oh and Theta Notation for Algorithmic Efficiency
- Knots, Chern-Simons Gauge Theory, and Quantum Physics
- Yang-Mills and the Mass Gap
- Loops over Strings, Guess-and-Check, and Binary
- File I/O
- Analysis of Multithreaded Algorithms
- Digital Design and Computer Architecture: Problem Solving III (ETH Zürich, Lecture 28)
- Plotting
- Et Cetera
- Three-Dimensional Geometry and Topology: On Mathematics and Its Communication
- Vectorized Query Execution Using SIMD
- Python
- Constraint Satisfaction Problems (CSPs) Part 2/2
- Data Parallel Haskell
- Join Algorithms
- SIMD Architectures
- Software Engineering II Lecture
- Digital Design and Computer Architecture: Problem Solving I (ETH Zürich, Spring 2025, Lecture 26)
- Complexity Classes Examples
- Assembly Programming
- Programming Clusters (MPI) and GPUs
- Mercury Multi-GPU Operator Optimization
- List Access, Hashing, Simulations, and Course Wrap-Up
- Design Patterns in Functional Programming