Show color key

 Hide color key

Lecture

Section

Lab

Exam

Homework

Office Hour

Other

Holiday

January
Monday	Tuesday	Wednesday	Thursday	Friday
04 14:30-15:20 Lecture KNE 210 Introduction Slides	05	06 14:30-15:20 Lecture KNE 210 Proof by Induction Slides 23:59 Background Questionnaire due	07	08 14:30-15:20 Lecture KNE 210 Mathematics Review Slides
11 14:30-15:20 Lecture KNE 210 Asymptotic Analysis I Slides 23:59 Assignment 1 due.	12	13 14:30-15:20 Lecture KNE 210 Asymptotic Analysis II Slides	14	15 14:30-15:20 Lecture KNE 210 Dictionaries and Trees Slides
18 Martin Luther King Day	19	20 14:30-15:20 Lecture KNE 210 Binary Search Trees Slides 23:59 Assignment 2 due.	21	22 14:30-15:20 Lecture KNE 210 AVL Trees Slides
25 14:30-15:20 Lecture KNE 210 Hashing I Slides	26	27 14:30-15:20 Lecture KNE 210 Hashing II Slides 23:59 Assignment 3 due.	28	29 14:30-15:20 Lecture KNE 210 Disjoint Sets and the UNION-FIND ADT Slides

February
Monday	Tuesday	Wednesday	Thursday	Friday
01 14:30-15:20 Lecture KNE 210 Implementing the UNION-FIND ADT Slides	02	03 14:30-15:20 Lecture KNE 210 Applying Hashing and the UNION-FIND ADT 23:59 Assignment 4, Part I due.	04	05 14:30-15:20 Lecture KNE 210 Priority Queues and Binary Heaps Slides
08 14:30-15:20 Lecture KNE 210 Graphs Slides	09	10 14:30-15:20 Lecture KNE 210 Review 23:59 Assignment 4, Part II due.	11	12 14:30-15:20 Lecture KNE 210 Midterm details 14:30-15:20 Midterm exam
15 Presidents Day	16	17 14:30-15:20 Lecture KNE 210 Minimum Spanning Trees with Kruskal's Algorithm Slides 23:59 Assignment 5, Part I due.	18	19 14:30-15:20 Lecture KNE 210 Topological Sorting; Graph Traversal Slides
22 14:30-15:20 Lecture KNE 210 Finding Shortest Paths in a Graph: Dijkstra's Algorithm Slides	23	24 14:30-15:20 Lecture KNE 210 Implicit Graphs: Generating Vertices and Edges Slides 23:59 Assignment 5, Part II due.	25	26 14:30-15:20 Lecture KNE 210 Comparison Sorting I Slides
29 14:30-15:20 Lecture KNE 210 Comparison Sorting II Slides	01	02 14:30-15:20 Lecture KNE 210 Beyond Comparison Sorting Slides 23:59 Assignment 6 due.	03	04 14:30-15:20 Lecture KNE 210 Algorithm Design Paradigms Slides

March
Monday	Tuesday	Wednesday	Thursday	Friday
07 14:30-15:20 Lecture KNE 210 Divide-and-Conquer and the FFT Slides	08	09 14:30-15:20 Lecture KNE 210 P vs NP and NP-Completeness Slides 23:59 Assignment 7 due.	10	11 14:30-15:20 Lecture KNE 210 Algorithms and Problem Solving; Review
14	15 14:30-16:20 Final exam Final exam details	16	17	18