Lectures

DateDescription
September 24 Intro; ADTs; Stacks & Queues
Weiss 3.1-3.7
Slides, Ink coming soon!
September 26 Algorithm Analysis 1
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
Slides, Ink posted later
September 29 Algorithm Analysis 2
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
Slides, Ink posted later
October 1 Priority Queues 1: ADT
Weiss 6.1-6.3
Slides, Ink posted later
October 3 Priority Queues 2: Binary Heap
Weiss 6.4-6.5
October 6 Algorithm Analysis 3
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
October 8 Algorithm Analysis 4: Recurrences
October 10 Dictionaries 1: ADT & Binary Search Trees
Weiss 4.1-4.3, 4.6
October 13 Dictionaries 2: AVL Trees
Weiss 4.4
October 15 Dictionaries 3: AVL Trees (cont.)
Weiss 4.4
October 17 Dictionaries 4: Hashing
Weiss 5.1-5.5
October 20 Dictionaries 5: More Hashing
Weiss 5.1-5.5
October 22 Sorting 1: Comparison Sorting
Weiss 7.1-7.3, 7.5-7.7
October 24 Sorting 2: Beyond Comparison Sorting
Weiss 7.8, 7.11
October 27 Sorting 3
Weiss 7.8, 7.11
October 29 TBA
October 31 Graphs 1: Intro
Weiss 9.1
November 3 Graphs 2: Graph Traversals
Weiss 9.2
November 5 Graphs 3: Shortest Paths
Weiss 9.3
November 7 Parallelism 1: Intro to Fork-Join
Grossman 2.1-3.4
November 10 Parallelism 2: Analysis
Grossman 3.5-4.3
November 12 Parallelism 3: Parallel Prefix
Grossman 5.1-5.2
November 14 Synchronization 1: Concurrency & Mutual Exclusion
Grossman 6
November 17 Synchronization 2: Race Conditions
Grossman 7.1
November 19 Synchronization 3: More Race Conditions & Deadlock
Grossman 8, 9
November 21 Graphs 4: Minimum Spanning Trees
Weiss 9.5
November 24 P, NP, NP-Complete
Weiss 9.6.3, 9.7
November 26 TBA
December 1 P, NP, NP-Complete II
Weiss 9.6.3, 9.7
December 3 B-Trees
Weiss 4.7
December 5 Wrap Up