Lectures

Date	Description
January 6	Intro; ADTs; Stacks & Queues Weiss 3.1-3.7 Slides, A Ink, B Ink
January 8	Algorithm Analysis 1 Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6 Slides, A Ink, B Ink, xls, More on Amortized
January 10	Algorithm Analysis 2 Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6 (no new slides, see updated ink on Wed) Useful Math identitites
January 13	Priority Queues 1: ADT Weiss 6.1-6.3 Slides, A Ink, B Ink
January 15	Priority Queues 2: Binary Heap Weiss 6.4-6.5 Slides, A Ink, B Ink
January 17	Algorithm Analysis 3: Recurrences Slides, A Ink, B Ink, Useful Math identitites
January 22	Dictionaries 1: ADT & Binary Search Trees Weiss 4.1-4.3, 4.6 Slides, A Ink, B Ink
January 24	Dictionaries 2: AVL Trees Weiss 4.4 Slides, Worksheet, A Ink, B Ink
January 27	Dictionaries 3: AVL Trees (cont.) Weiss 4.4 (no new slides, see updated ink on Fri)
January 29	Dictionaries 4: Hashing Weiss 5.1-5.5 Slides, A Ink, B Ink
January 31	Dictionaries 5: More Hashing Weiss 5.1-5.5 Slides, A Ink,B Ink, proof, xls
February 3	Sorting 1: Comparison Sorting Weiss 7.1-7.3, 7.5-7.7 Slides, A Ink, B Ink
February 5	Sorting 2: Beyond Comparison Sorting Weiss 7.8, 7.11 Slides, A Ink, B Ink
February 7	Midterm Review
February 10	Graphs 1: Intro Weiss 9.1 Slides, A Ink, B Ink
February 12	Graphs 2: Graph Traversals Weiss 9.2 Slides, A Ink, B Ink, traversal examples, More on Cycle Detection
February 14	Graphs 3: Shortest Paths Weiss 9.3 Slides, A Ink, B Ink
February 19	Parallelism 1: Intro to Fork-Join Grossman 2.1-3.4 Slides, A Ink, B Ink
February 21	Parallelism 2: Analysis Grossman 3.5-4.3 Slides
February 24	Parallelism 3: Parallel Prefix Grossman 5.1-5.4
February 26	Synchronization 1: Concurrency & Mutual Exclusion Grossman 6
February 28	Synchronization 2: Race Conditions Grossman 7.1
March 3	Synchronization 3: More Race Conditions & Deadlock Grossman 8, 9
March 5	Graphs 5 : Minimum Spanning Trees Weiss 9.5
March 7	TBD
March 10	TBD
March 12	TBD
March 14	TBD