Stack
One word, taught differently in 2 fields. Each use is given apart.
In Systems & CS
An abstract data type operating on a Last In, First Out (LIFO) basis.
In Theory & Algos
A data structure that provides auxiliary storage where symbols can only be written or read at the top, and adding a new symbol pushes existing symbols down.
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
6Each in their own terms, from the easiest level.
Ana Bell
A collection data structure operating on a first-in, last-out (FILO) basis where elements are added and removed from the same end.Brian Yu
A last-in first-out data type where the last thing added to the frontier is the first thing removed.Julian Shun
A data structure used to manage function calls and local variables in a serial program.Hal Abelson & Gerald Jay Sussman
A memory structure that allows us to simulate the existence of an infinite machine using a recursive nest of many machines.Onur Mutlu
A memory area used to store local variables and temporary data, operating on a Last-In-First-Out (LIFO) basis.
In Theory & Algos
1Lectures that assume it
14The first 12 are shown.
- Explicit-Control Evaluator
- Races and Parallelism
- CF Pumping Lemma, Turing Machines
- Persistent Data Structures
- Savitch's Theorem and NL
- A Call-by-push-value Scheme
- A Syntomic Perspective on Integral Canonical Models
- The Cilk Runtime System
- Thread Switching
- Unlocking Stripped Go Binaries at Runtime
- RISC-V Calling Convention and Stack Frames
- Cybersecurity
Connections
30The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures21
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Parallel Storage Allocation
- Register Machines (SICP Lecture 9a)
- Python Classes
- Data Structures
- Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
Show 15 moreShow fewer
- Assembly Programming
- Explicit-Control Evaluator
- Races and Parallelism
- CF Pumping Lemma, Turing Machines
- Persistent Data Structures
- Savitch's Theorem and NL
- A Call-by-push-value Scheme
- A Syntomic Perspective on Integral Canonical Models
- The Cilk Runtime System
- Thread Switching
- Unlocking Stripped Go Binaries at Runtime
- RISC-V Calling Convention and Stack Frames
- Cybersecurity
- Optimising for Fast Builds with GHC
- Clean Code III: Functions