CS 15-122: Principles of Imperative Computation
(Fall 2024)

Course Material and Assessments  [  Course material  |  Assessments  ]

Course Material

Lecture Notes
Part 1: Deliberate Programming
  1. Contracts code slides
  2. Ints code slides
  3. Arrays code slides
  4. Searching Arrays code slides
  5. Big-O code slides
  6. Binary Search code slides
  7. Quicksort code slides
Part 2: Data Structures
  1. Libraries code slides
  2. Stacks and Queues code slides
  3. Linked Lists code slides
  4. Unbounded Arrays code slides
  5. Hashing code slides
  6. Hash Dictionaries code slides
      code void* slides
  7. Genericity code slides
      code function pointers slides
  8. Binary Search Trees code slides
  9. AVL Trees code slides
  10. Priority Queues code slides
  11. Restoring Invariants code slides
Part 3: Transitioning to C
  1. Introduction to C code slides
  2. C's Memory Model code slides
  3. Types in C code slides
  4. Virtual Machines code slides
  5. Graph Representation code slides
  6. Graph Search code slides
  7. Spanning Trees code slides
  8. Union-Find code slides
Guides to Success
Part 1: Using Office Hours Effectively
Part 2: Infrastructure
Part 3: General Tips and Tricks
Part 4: Debugging C0 Code
Part 5: Debugging C Code
Practice Exams
Final published on

Assessments

Assessments will become visible on their release date. Precept solutions will become visible 24 hours after the precepts themselves. Make sure to refresh your browser to see them!

Practice Problems
Extra Practice Problems
Checkins
Programming Assignments
Precepts
2024 Iliano Cervesato