Detailed Schedule
Don’t forget to see Piazza for lecture notes and code (Resources and/or various followup posts.)
| Dates | Topics | Resources | Collectables |
|---|---|---|---|
| Mon 1/30 | Course Overview | OpenDSA Ch 1, Intro Java Examples | |
| Wed 2/1 | Development Tools | OpenDSA Ch 3, Unix tutorials & reference, Checkstyle website | Assignment 1 out |
| Fri 2/3 | Java Review, Abstract Data Types | OpenDSA Ch 4 | |
| Mon 2/6 | More Abstract Data Types, Arrays | [OpenDSA Ch 9.1-9.3 is somewhat related] | |
| Wed 2/8 | Generic Array Implementation | Java Generics | Assignment 2 out |
| Fri 2/10 | Iterators, Linked Array Implementation | Wikipedia on Linked Lists, Iterator Interface, For-Each Loops, [OpenDSA Ch 9.4 is somewhat related] | |
| Mon 2/13 | JUnit | overview, JUnit 4 website, OpenDSA Ch 3.9-3.10 | |
| Wed 2/15 | Searching & Quadratic Sorting | Open DSA Ch 13.1-13.7 | |
| Fri 2/17 | Asymptotic Complexity | OpenDSA Ch 6-8 | Assignment 3 Out |
| Mon 2/20 | Stacks | OpenDSA Ch 9.8-9.11 | |
| Wed 2/22 | (homework help session) | ||
| Fri 2/24 | Queues & Deques | OpenDSA Ch 9.12-9.14 | Assignment 4 Out |
| Mon 2/27 | Lists | Open DSA Ch 9.1-9.7 | |
| Wed 3/1 | More Lists | Assignment 5 Out | |
| Fri 3/3 | Trees | Open DSA Ch 18.1 | |
| Mon 3/6 | Graph Concepts | Open DSA Ch 19.1-19.3 | |
| Wed 3/8 | Midterm Review | ||
| Fri 3/10 | Midterm! | ||
| Mon 3/13 | Graph Implementations | Assignment 6 Out | |
| Wed 3/15 | Sets | Open DSA Ch 6.2 | |
| Fri 3/17 | Ordered Sets | ||
| 3/20-3/24 | No class: Spring Break! | ||
| Mon 3/27 | Priority Queues, Heaps | OpenDSA Ch 12.1-12.2, 12.16-12.17 | |
| Wed 3/29 | More Priority Queues, HeapSort, Comparators, Jaybee | OpenDSA Ch 13.12, Jb Website | Assignment 7 Out |
| Fri 3/31 | Divide & Conquer Sorting | Open DSA 13.9-13.11 | |
| Mon 4/3 | Sets of integers, Bitsets (Peter’s section only) | Joanne’s section will not meet | |
| Wed 4/5 | Lower Bounds, Linear Sorting, Stable Sorting | OpenDSA Ch 13.13-13.17 | |
| Fri 4/7 | Maps and Binary Search Trees | Open DSA Ch 11.4, Ch 12.1-12.12 | |
| Mon 4/10 | Balanced BSTs | Open DSA 28.2-28.3 | Assignment 8 Out |
| Wed 4/12 | AVL Trees | ||
| Fri 4/14 | Treaps | ||
| Mon 4/17 | Hash Tables | Open DSA Ch 15 | |
| Wed 4/19 | More Hashing | Assignment 9 Out | |
| Fri 4/21 | Shortest Path Problem, Dijkstras Algorithm | Open DSA 19.5, 19.8 | |
| Mon 4/24 | Minimum Spanning Trees | Open DSA 19.6-19.7 | |
| Wed 4/26 | Union Find | Open DSA 6.2, 18.2 | |
| Fri 4/28 | Text Processing, Huffman Codes | Open DSA 12.18 | |
| Mon 5/1 | Tries | Open DSA 12.19 | |
| Wed 5/3 | Miscellaneous | ||
| Fri 5/5 | Last Day of Class — Review or Candy! | ||
| Sun 5/14, 2p | Final Exam |