algorithms
Correctness and termination
taught
Taught in
-
Correctness and termination
Discrete Mathematics I — Logic, Proof, and Structure
Requires
- reading-and-writing-pseudocode required
Required by
- Loop invariants required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.