Show color key

 Hide color key

Lecture

Section

Lab

Exam

Homework

Office Hour

Other

Holiday

January
Sunday	Monday	Tuesday	Wednesday	Thursday	Friday	Saturday
02	03	04	05 15:10-16:20 Lecture Anderson 036 Java Basics Read the notional machine handout lecture code project CalculatorTakeOne.java Calculator.java Mean.java 20:00-21:00 Prefect Session	06 19:30-21:30 Lab Hours Olin 310	07 Lab 0: Hello Java out 15:30-16:30 Lecture Anderson 036 Object-Oriented Programming I Read Bailey 1.3--1.7 for more examples lecture recording Rectangle.java 21:00 Introductory Survey due	08
09 20:00-21:00 Prefect Session	10 Quiz 1 out Lab 1: Silver Dollar Game out 15:10-16:20 Lecture Anderson 036 Object-Oriented Programming II Read Algorithms 1.2 lecture recording shapes.zip flying-shapes.zip 16:30-17:30 Office Hours Olin 339 21:00 Lab 0 due [gallery!]	11	12 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Extensible Arrays No assigned reading lecture recording ArrayIntList.java Mean.java data.txt 20:00-21:00 Prefect Session 21:00 Quiz 1 due	13 19:30-21:30 Lab Hours Olin 310 21:00 Lab 1 check-in post due	14 15:30-16:30 Lecture Anderson 036 Linked Lists I Read Bailey 9--9.2 lecture recording	15
16 20:00-21:00 Prefect Session	17 Quiz 2 out Lab 2: List Improvement out 15:10-16:20 Lecture Anderson 036 Linked Lists II After lecture, play around with linked list visualizations lecture recording 16:30-17:30 Office Hours Olin 339 21:00 Lab 1 due	18	19 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 ArrayList vs LinkedList No reading worksheet solutions 20:00-21:00 Prefect Session 21:00 Quiz 2 due	20 19:30-21:30 Lab Hours Olin 310 21:00 Lab 2 check-in post due	21 15:30-16:30 Lecture Anderson 036 Stacks and Queues Read this summary of stacks & queues. After lecture, explore Two-Stack Algorithm for arithmetic: video code lecture recording	22
23 20:00-21:00 Prefect Session	24 Quiz 3 out Lab 3: P.S. It's Just a Stack! out 15:10-16:20 Lecture Anderson 036 Iterators No reading lecture recording FibonacciIterator.java SinglyLinkedList.java WordIterator.java 16:30-17:30 Office Hours Olin 339 21:00 Lab 2 due	25	26 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Time and Space Complexity Read Bailey 5.1.1 Camera malfunction, here's last year's video 20:00-21:00 Prefect Session 21:00 Quiz 3 due	27 19:30-21:30 Lab Hours Olin 310 21:00 Lab 3 check-in post due	28 15:30-16:30 Lecture Anderson 036 Recursion and Sorting Read Bailey section 5.2.1 lecture recording	29
30 20:00-21:00 Prefect Session	31 Lab 4: Boggle Word Finder out 15:10-16:20 Lecture Anderson 036 Searching No reading lecture recording queens.zip 16:30-17:30 Office Hours Olin 339 21:00 Lab 3 due	01 Quiz 4 out	02 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Maps Read Bailey 15.2 and 15.3 lecture recording volunteers.csv Volunteer.java ProcessVolunteers.java Association.java ListMap.java 20:00-21:00 Prefect Session 21:00 Lab 4 check-in post due	03 19:30-21:30 Lab Hours Olin 310 21:00 Quiz 4 due	04 15:30-16:30 Lecture Anderson 036 Hashing I Read Bailey 15.4.3 and 15.4.4 lecture recording CalendarDate.java 21:00 Lab 4 due	05

February
Sunday	Monday	Tuesday	Wednesday	Thursday	Friday	Saturday
06	07 Mid-term Break	08	09 Lab 5: Text Generation out 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Hashing II Read Bailey 15.4.1, 15.4.2, and 15.4.5 lecture recording 20:00-21:00 Prefect Session	10 19:30-21:30 Lab Hours Olin 310	11 15:30-16:30 Lecture Anderson 036 Introduction to Trees Read Bailey 12.1, 12.2, and 12.3 lecture recording BinaryTreeNode.java	12
13 20:00-21:00 Prefect Session	14 Quiz 5 out 15:10-16:20 Lecture Anderson 036 Binary Search Trees Read Algorithms 3.2 lecture recording BST.java 16:30-17:30 Office Hours Olin 339 21:00 Lab 5 check-in post due	15	16 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Tree Traversals Read Bailey 12.6 lecture recording BinaryTreeTraversals.java 20:00-21:00 Prefect Session 21:00 Quiz 5 due	17 19:30-21:30 Lab Hours Olin 310	18 Lab 6: k-d Tree out 15:30-16:30 Lecture Anderson 036 Trees for Multidimensional Data Read lab 6 writeup lecture recording 21:00 Lab 5 due	19
20 20:00-21:00 Prefect Session	21 15:10-16:20 Lecture Anderson 036 Advanced Search Trees After lecture, read Bailey 14.5 (optionally 14.6 and 14.7) lecture recording 16:30-17:30 Office Hours Olin 339	22	23 Quiz 6 out 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Priority Queues and Heaps Read Algorithms 2.4 lecture recording MinIntHeap.java MinIntHeapExtended.java 20:00-21:00 Prefect Session	24 19:30-21:30 Lab Hours Olin 310 21:00 Lab 6 check-in post due	25 15:30-16:30 Lecture Anderson 036 Introduction to Graphs Read Bailey 16.1 and 16.2 lecture recording 21:00 Quiz 6 due	26
27 20:00-21:00 Prefect Session	28 15:10-16:20 Lecture Anderson 036 Graph Search Read Bailey 16.4.1 and 16.4.2 lecture recording 16:30-17:30 Office Hours Olin 339	01	02 Quiz 7 out Lab 7: Exam Scheduling out 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Graph Data Structures Read Algorithms 4.1 and Algorithms 4.2 lecture recording Graph.java 20:00-21:00 Prefect Session 21:00 Lab 6 due	03 19:30-21:30 Lab Hours Olin 310	04 15:30-16:30 Lecture Anderson 036 Shortest Paths Read Algorithms 4.4 lecture recording 21:00 Quiz 7 due	05

March
Sunday	Monday	Tuesday	Wednesday	Thursday	Friday	Saturday
06 20:00-21:00 Prefect Session	07 Quiz 8 out Final Exam Study Guide 15:10-16:20 Lecture Anderson 036 Minimum Spanning Trees Read Algorithms 4.3 16:30-17:30 Office Hours Olin 339	08 21:00 Lab 7 check-in post due	09 10:00-11:30 Office Hours Olin 339 15:10-16:20 Lecture Anderson 036 Introduction to Parallelism Read Grossman 2.1--3.4 lecture recording 20:00-21:00 Prefect Session 21:00 Quiz 8 due	10 19:30-21:30 Lab Hours Olin 310	11 Take-home final out 15:30-16:30 Lecture Anderson 036 Review; Ask me anything; course evals 21:00 Lab 7 due	12
13	14	15	16 21:00 Take-home final due	17	18	19