CS201 Data Structures F20 Schedule
This is a rough schedule of topics for each day and the release and due dates for each homework assignment. Homework assignments (especially later ones) often have a slightly longer time between release and due date than the daily class activities, which are typically assigned on a Monday/Wednesday/Friday and due the by the following class day.
Class topics and homework information may change over the course of the term. Please treat this schedule as a rough guide for seeing what we’ll be focusing on, and expect that there will be shifts as the term progresses.
Date | Homework Due | Class Topic | Homework Out |
---|---|---|---|
Week 1 | Intro to Java | ||
M 9/14 | Intro; First look at Java | ||
W 9/16 | Object oriented programming ideas | HW1: Guessing Game | |
F 9/18 | HW1 | Inheritance | HW2: Object Oriented Practice |
Week 2 | List, Map and Set ADTs, and intro to efficiency | ||
M 9/21 | HW2 | List ADT | HW3: Country Analyses |
W 9/23 | Map and Set ADTs | ||
F 9/25 | Efficiency and Big-O Analysis | ||
Week 3 | List implementations | ||
M 9/28 | HW3 | Linked list implementation | |
W 9/30 | Arrays and implementing a list using an array | HW4: Country displayer redux | |
F 10/2 | Comparing list implementations: applications to sorting | ||
Week 4 | Stacks and Queues | ||
M 10/5 | Stack implementation | ||
W 10/7 | HW4 | Queue implementations | HW5: Solving Mazes |
F 10/9 | Review/Catch up | ||
Week 5 | Graphs | ||
M 10/12 | Graph implementations | ||
W 10/14 | HW5 | Breadth first search | HW6: WikiPaths |
F 10/16 | Complexity of DFS and BFS | ||
Week 6 | Recursion and Sorting | ||
M 10/19 | Mid-term Break! | ||
W 10/21 | Recursion review and practice | ||
F 10/23 | HW6 | Quicksort | HW7: Sorting comparisons |
Week 7 | Trees | ||
M 10/26 | Trees and binary trees | ||
W 10/28 | Binary search trees | ||
F 10/30 | HW7 | Balanced binary search trees | HW8: WordCloud |
Week 8 | Heaps | ||
M 11/2 | Heap implementation | ||
W 11/4 | Catch up/Review | ||
F 11/6 | HW8 | Heapsort | HW9: Flashcard Displayer |
Week 9 | Hashing for Set and Map Implementations | ||
M 11/9 | Hashing | ||
W 11/11 | Hash-based implementation of maps and sets | ||
F 11/13 | HW9 | Intro to final project | Final project |
Week 10 | Wrapping up | ||
M 11/16 | Final project discussions | ||
W 11/18 | Wrap up; review; course evaluations | ||
Exam Period | |||
Final project due Monday, 11/23, 5pm. Any request for an extension must go through the Dean of Students office as I am not otherwise permitted to consider work submitted after this time. |