COS265 Schedule
Below is the tentative schedule for the course.
I will try to keep this up-to-date within the next 2wks.
Notes
Here are a few notes about the audio column and due dates.
- I plan to record each lecture and post its link in the audio column.
- Book readings are due by the start of the next section, however I strongly encourage you to skim the entire reading prior to the start of first class of the current section.
- Assignments and projects will be introduced on the day they appear in the schedule, and their due date is in the rightmost column.
Note
I reserve the right to alter this plan (including material covered and the associated schedule) for any reason.
Vacation
I will be gone for a trip starting Thursday, September 17 through the end of Sunday, September 20.
There will be no in-class lecture on Friday, September 18, but I plan to record a virtual lecture.
I will be completely unreachable during this time. Contact a TA with any class-related questions.
Tentative Schedule
| wk | date | book | details | recording | assessment | due |
|---|---|---|---|---|---|---|
| 1 | 08.31 M | FALL TERM STARTS 5PM NO CLASS |
— | |||
| 09.01 T | 1.1–1.2 | S00 Intro |
A00.0 | P00 Java Intro | 09.08 | |
| 09.02 W | 1.5 | S01 Union-Find | A01.0 | |||
| 09.04 F | A01.1 | |||||
| 2 | 09.07 M | LABOR DAY BREAK NO CLASS |
— | |||
| 09.08 T | — | P01 Hex | 09.22 | |||
| 09.09 W | A01.2 | |||||
| 09.11 F | 1.4 | S02 Algorithm Analysis | A02.0 | |||
| 3 | 09.14 M | A02.1 | ||||
| 09.15 T | — | CT00 Asking Good Questions CT00 Handout CT00 Instructions |
09.22 | |||
| 09.16 W | V02.2 | |||||
| 09.18 F | CLASS CANCELLED NO CLASS |
— | ||||
| 09.19 Sa | — | HS00 Java Intro |
||||
| 4 | 09.21 M | 1.3 | A02.3 | |||
| 09.22 T | — | P02 Data Types | 10.06 | |||
| 09.23 W | S03 Bags, Queues, Stacks | A03.0 | ||||
| 09.25 F | A03.1 | |||||
| 5 | 09.28 M | A03.2 | TU CAREER FAIR |
09.28 | ||
| 09.29 T | — | CR00 Hex | 10.06 | |||
| 09.30 W | 2.1 | S04 Elementary Sorts | ... | |||
| 10.02 F | 2.2 | S05 Merge Sorts | ... | |||
| 6 | 10.05 M | ... | ||||
| 10.06 T | — | P03 Sorting | 10.20 | |||
| 10.07 W | 2.3 | ... | ||||
| 10.09 F | S06 Quicksort | ... | ||||
| 7 | 10.12 M | 2.4 | S07 Priority Queue | ... | ||
| 10.13 T | — | CT01 Consulting an Expert | 10.20 | |||
| 10.14 W | ... | |||||
| 10.16 F | FALL BREAK NO CLASS |
— | ||||
| 8 | 10.19 M | FALL BREAK NO CLASS |
— | |||
| 10.20 T | — | P04 Pathfinding | 11.10 | |||
| 10.21 W | ... | ORAL EXAMS START |
10.30 | |||
| 10.23 F | 3.0–3.1 | S08 Symbol Tables | ... | |||
| 9 | 10.26 M | ... | ||||
| 10.27 T | — | CT02 Edge Cases | — | |||
| 10.28 W | 3.2 | S09 Binary Search Trees | ... | |||
| 10.30 F | S10 BST Geometry | ... | ||||
| 10 | 11.02 M | ... | ||||
| 11.03 T | — | CT03 Similar Problem | ---- | |||
| 11.04 W | ... | |||||
| 11.06 F | ... | |||||
| 11 | 11.09 M | 3.3 | S11 Balanced Search Trees | ... | ||
| 11.10 T | — | P05 kD-Trees | 11.24 | |||
| 11.11 W | ... | |||||
| 11.13 F | ... | |||||
| 12 | 11.16 M | 3.4 | S12 Hash Tables | ... | ||
| 11.17 T | — | CT04 Developing Subgoals | — | |||
| 11.18 W | ... | |||||
| 11.20 F | 4.0–4.1 | S13 Undirected Graphs | ... | |||
| 11.21 Sa | — | CODECON, 10–17 |
11.21 | |||
| 13 | 11.23 M | ... | ||||
| 11.24 T | — | P06 Hollywood Center | 12.11 | |||
| 11.25 W | THANKSGIVING BREAK NO CLASS |
— | ||||
| 11.27 F | THANKSGIVING BREAK NO CLASS |
— | ||||
| 14 | 11.30 M | ... | ||||
| 12.01 T | — | |||||
| 12.02 W | 4.2 | S14 Directed Graphs | ... | |||
| 12.04 F | ... | |||||
| 15 | 12.07 M | ... | ||||
| 12.08 T | — | L00 Word Puzzles Course Evaluation |
||||
| 12.09 W | ... | |||||
| 12.11 F | ... | |||||
| 16 | 12.15 T | FINAL EXAM, 08–10 |
— |