Sign inSign in
ConceptSystems & CS

Stack discipline

The orderly protocol of saving and restoring only the necessary values on a stack in matching pairs.
Watch it explained

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.

Memory management1Recursion1Stack data structure1Subroutine calls1

Lecturers

2

Each in their own terms, from the easiest level.

  • Julian Shun

    MIT · Undergraduate

    A memory allocation pattern where memory is allocated before a recursive call and freed immediately after, allowing for efficient reuse.
    • 30:38Parallel Storage Allocation

Connections

3

The lectures that define it or assume it, and the concepts next to it.

Concept1

Lectures2

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.