CompSci 201: Data Structures & Algorithms
Recitation
Fall 2012
Date |
Assignment |
Code |
Notes |
|
| 8/31/2012 | Practice with loops and arrays | snarf/DrawCircles | Slides from class | |
| 9/7/2012 | ArrayLists, iterators, and clones | snarf/SimpleSort.java | Slides from class | |
| SimpleSort.java | ||||
| 9/14/2012 | Jotto and Coding | BasketWithApples.java | Slides from class | |
| 9/21/2012 | Hashing and compareTo | snarf/Recitation4 ThreeInts.java ComplexNumbers.java |
Slides from class | |
| 9/28/2012 | Recursion | snarf/Recitation5 | Slides from class | |
| 10/12/2012 | Linked Lists | snarf/Recitation6 | Slides from class | |
| 10/19/2012 | Interfaces | snarf/Recitation7 | Slides from class | |
| 10/26/2012 | Trees II | snarf/Recitation8 | Slides from class | |
| 11/2/2012 | Recurrence Relations | |||
| 11/9/2012 | Priority Queues, Recursive Backtracking, Heaps | snarf/Recitation10 | ||
| 11/15/2012 | Tries and Boggle | |||
| 11/30/2012 | Huffman | snarf/Assignments/Huff | Slides from class |