|
15-122 Principles of Imperative Computation
|
Date | Lecture or Recitation |
Reading | Code | Assignment | |||
---|---|---|---|---|---|---|---|
|
|||||||
Mon | May | 16 | Overview | 01-overview.pdf | code | ||
Tue | May | 17 | Recitation: C0 on Andrew | ||||
Tue | May | 17 | Contracts | 02-contracts.pdf | code | (Asst 0 out) | |
Wed | May | 18 | Recitation: Reasoning with Loop Invariants | ||||
Wed | May | 18 | Ints | 03-ints.pdf | code | ||
Thu | May | 19 | Recitation: Getting Started with Images | ||||
Thu | May | 19 | Arrays | code | Asst 1 out | ||
Fri | May | 20 | Linear Search | 05-linsearch.pdf | code | ||
|
|||||||
Mon | May | 23 | Binary Search | 06-binsearch.pdf | code | Asst 1 due, Asst 2 out |
|
Tue | May | 24 | Recitation: Reviewing Binary Search | ||||
Tue | May | 24 | Sorting and Merge Sort | 07-sorting.pdf | code | ||
Wed | May | 25 | |||||
Wed | May | 25 | Quicksort | 08-qsort.pdf | code | ||
Thu | May | 26 | |||||
Thu | May | 26 | More Quicksort | code | Asst 2 due | ||
Fri | May | 27 | Exam 1 | exam1.pdf | sample solution | Asst 3 out | |
|
|||||||
Mon | May | 30 | Memorial Day | ||||
Tue | May | 31 | |||||
Tue | May | 31 | Stacks and Queues | 09-queues.pdf | code | ||
Wed | Jun | 1 | Recitation: Memory Layout | ||||
Wed | Jun | 1 | Implementing Queues | 10-stacks.pdf | code | Asst 3 due, Asst 4 out |
|
Thu | Jun | 2 | |||||
Thu | Jun | 2 | Unbounded Arrays | 12-ubarrays.pdf | code | ||
Fri | Jun | 3 | Hash Tables | 13-hashtables.pdf | |||
|
|||||||
Mon | Jun | 6 | Interfaces | 14-interfaces.pdf | code | Asst 4 due, Asst 5 out |
|
Tue | Jun | 7 | |||||
Tue | Jun | 7 | Priority Queues | 15-priorqs.pdf | |||
Wed | Jun | 8 | |||||
Wed | Jun | 8 | Restoring Invariants | 16-resinvs.pdf | code | ||
Thu | Jun | 9 | |||||
Thu | Jun | 9 | Binary Search Trees | 17-bst.pdf, 18-avl.pdf |
code | Asst 5 due | |
Fri | Jun | 10 | Exam 2 | exam2.pdf | sample solution | Asst 6 out | |
|
|||||||
Mon | Jun | 13 | Polymorphism | 20-poly.pdf | code | Asst 6 due | |
Tue | Jun | 14 | |||||
Tue | Jun | 14 | Memory Management | 21-mem.pdf | code | Asst 7 out | |
Wed | Jun | 15 | |||||
Wed | Jun | 15 | The Golden Rule | 22-generic.pdf | code | ||
Thu | Jun | 16 | |||||
Thu | Jun | 16 | Function Pointers and Virtual Machines | 23-c0vm.pdf | Asst 8 out | ||
Fri | Jun | 17 | The C0VM | 23-c0vm.pdf | code | Asst 7 due | |
|
|||||||
Mon | Jun | 20 | More C0VM | 23-c0vm.pdf | code | ||
Tue | Jun | 21 | |||||
Tue | Jun | 21 | Tries | 24-tries.pdf | |||
Wed | Jun | 22 | |||||
Wed | Jun | 22 | Binary Decision Diagrams | 25-bdds.pdf | |||
Thu | Jun | 23 | |||||
Thu | Jun | 23 | Dynamic Programming | dynprog.pdf | code | Asst 8 due | |
Fri | Jun | 24 | Exam 3 | exam3.pdf | sample solution | ||
|
[ Home
| Schedule
| Assignments
| Resources
]
[
Blackboard
| academic.cs.15-122
]
wlovas@cs
William Lovas