|
15-122 Principles of Imperative Computation
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Date | Lecture/Recitation | Reading | Code | Assignment | |||
|---|---|---|---|---|---|---|---|
| |
|||||||
| Mon | Aug | 27 | Tutorial on C0 on Andrew | ||||
| Tue | Aug | 28 | Overview | 01-overview.pdf | code | ||
| Wed | Aug | 29 | Recitation: Basic Building Blocks of C0 | [J.Zimmerman] | |||
| Thu | Aug | 30 | Contracts | 02-contracts.pdf | code | ||
| Fri | Sep | 1 | Recitation: Reasoning with Loop Invariants | [J.Zimmerman] | |||
| |
|||||||
| Mon | Sep | 3 | Labor Day | ||||
| Tue | Sep | 4 | Ints | 03-ints.pdf | |||
| Wed | Sep | 5 | Recitation: Modular Arithmetic | [A.Cappiello] [E.Davis] [J.Zimmerman] | |||
| Thu | Sep | 6 | Arrays | 04-arrays.pdf | code | Asst 0 due | |
| Fri | Sep | 7 | Recitation: Bitwise Ops, Arrays and Contracts | [A.Cappiello] [E.Davis] [J.Zimmerman] | Quiz 1 | ||
| |
|||||||
| Mon | Sep | 10 | |||||
| Tue | Sep | 11 | Linear Search | 05-linsearch.pdf | code | ||
| Wed | Sep | 12 | Recitation: C0 Debugging, Linear Search | [A.Cappiello] [E.Davis] [J.Zimmerman] | |||
| Thu | Sep | 13 | Binary Search | 06-binsearch.pdf | code | Asst 1 due | |
| Fri | Sep | 14 | Recitation: Binary Search, Proofs | [A.Cappiello] [E.Davis] [J.Zimmerman] | Quiz 2 | ||
| |
|||||||
| Mon | Sep | 17 | |||||
| Tue | Sep | 18 | Sorting | 07-sorting.pdf | code | ||
| Wed | Sep | 19 | Recitation: Big-O, Unit Testing | [E.Davis] [J.Zimmerman] | code | ||
| Thu | Sep | 20 | Quicksort | 08-qsort.pdf | code | ||
| Fri | Sep | 21 | Recitation: Quicksort Invariants | [J.Zimmerman] | |||
| |
|||||||
| Mon | Sep | 24 | Asst 2 due | ||||
| Tue | Sep | 25 | Queues | 09-queues.pdf | code | ||
| Wed | Sep | 26 | Recitation: Structs, Pointers, Linked Lists | [E.Davis] [J.Zimmerman] | |||
| Thu | Sep | 27 | Stacks | 10-stacks.pdf | code | ||
| Fri | Sep | 28 | Recitation: Library vs. Client, Clac | [J.Zimmerman] | Quiz 3 | ||
| |
|||||||
| Mon | Oct | 1 | |||||
| Tue | Oct | 2 | Testing | code | |||
| Wed | Oct | 3 | Recitation: Memory Layout, Recursion | [E.Davis] [J.Zimmerman] | |||
| Thu | Oct | 4 | Unbounded Arrays | 12-ubarrays.pdf | code | Asst 3 due | |
| Fri | Oct | 5 | Recitation: Midterm Review | [J.Zimmerman] [N.Chopra] | |||
| |
|||||||
| Mon | Oct | 8 | |||||
| Tue | Oct | 9 | Midterm 1 | sample solution | |||
| Wed | Oct | 10 | Recitation: Unbounded Arrays, Amortized Analysis | [J.Zimmerman] | |||
| Thu | Oct | 11 | Hash Tables | 13-hashtables.pdf | code (L.14) | ||
| Fri | Oct | 12 | Quiz 4 | ||||
| |
|||||||
| Mon | Oct | 15 | |||||
| Tue | Oct | 16 | Interfaces | 14-interfaces.pdf | code | ||
| Wed | Oct | 17 | Recitation: Hash Tables | [J.Zimmerman] [E.Davis] | |||
| Thu | Oct | 18 | Priority Queues | 15-priorqs.pdf | code (L.16) | Asst 4 due | |
| Fri | Oct | 19 | Midsemester Break | ||||
| |
|||||||
| Mon | Oct | 22 | |||||
| Tue | Oct | 23 | Restoring Invariants | 16-resinvs.pdf | code | ||
| Wed | Oct | 24 | Recitation: Priority Queues, Backtracking Search | [J.Zimmerman] [N.Chopra] [E.Davis] | |||
| Thu | Oct | 25 | Binary Search Trees | 17-bst.pdf | code | ||
| Fri | Oct | 26 | Recitation: Binary Search Trees | [J.Zimmerman] [E.Davis] [N.Chopra] | Quiz 5 | ||
| |
|||||||
| Mon | Oct | 29 | Asst 5 due | ||||
| Tue | Oct | 30 | AVL Trees | 18-avl.pdf | code | ||
| Wed | Oct | 31 | Recitation: AVL trees | [J.Zimmerman] [E.Davis] [N.Chopra] | |||
| Thu | Nov | 1 | Polymorphism | 19-poly.pdf | code | ||
| Fri | Nov | 2 | Recitation: C, a first look | [J.Zimmerman] [E.Davis] | Quiz 6 | ||
| |
|||||||
| Mon | Nov | 5 | |||||
| Tue | Nov | 6 | Memory Management | 20-mem.pdf | code | ||
| Wed | Nov | 7 | Recitation: Memory in C | [J.Zimmerman] | |||
| Thu | Nov | 8 | Tries | 21-tries.pdf | code | Asst 6 due | |
| Fri | Nov | 9 | Recitation: Midterm Review | [N.Chopra] [E.Davis] [J.Zimmerman] | |||
| |
|||||||
| Mon | Nov | 12 | |||||
| Tue | Nov | 13 | Midterm 2 | sample solution | |||
| Wed | Nov | 14 | Recitation: Tries | [J.Zimmerman] [E.Davis] | |||
| Thu | Nov | 15 | Generic Data Structures | 22-generic.pdf | code | ||
| Fri | Nov | 16 | Recitation: More on C | [E.Davis] [J.Zimmerman] | Quiz 7 | ||
| |
|||||||
| Mon | Nov | 19 | Asst 7 due | ||||
| Tue | Nov | 20 | Virtual Machines | 23-c0vm.pdf, handout | code | ||
| Wed | Nov | 21 | Thanksgiving Break | ||||
| Thu | Nov | 22 | Thanksgiving Break | ||||
| Fri | Nov | 23 | Thanksgiving Break | ||||
| |
|||||||
| Mon | Nov | 26 | |||||
| Tue | Nov | 27 | Search in Graphs | 24-search.pdf | code | ||
| Wed | Nov | 28 | Recitation: Graph Search | [N.Chopra] [E.Davis] [J.Zimmerman] | |||
| Thu | Nov | 29 | Spanning Trees | 25-spanning.pdf | none | ||
| Fri | Nov | 30 | Recitation: Kruskal's Algorithm | [N.Chopra] [E.Davis] [J.Zimmerman] | Quiz 8 | ||
| |
|||||||
| Mon | Dec | 3 | |||||
| Tue | Dec | 4 | Union-Find | 26-unionfind.pdf | code | ||
| Wed | Dec | 5 | Recitation: C0VM | ||||
| Thu | Dec | 6 | Garbage Collection | [Wilson94], pp.1-17 | none | Asst 8 due | |
| Fri | Dec | 7 | Recitation: Union-Find | [E.Davis] [J.Zimmerman] | |||
| |
|||||||
| Fri | Dec | 14 | Final, 8:30am-11:30am Sections A-G: McConomy Auditorium (University Center) Sections H-J: Porter Hall 100 |
||||
| |
|||||||
[ Home
| Schedule
| Assignments
| Resources
]
[
Piazza
| Blackboard
]
fp@cs
Frank Pfenning