14 Jan
Priority Queues 2 (Binary Heap)
Weiss 6.4-6.5
EX0 Generics
15 Jan
S2 Algorithm Analysis and Heaps
CC0
CC1
CC2
21 Jan
Dictionaries (ADT & Binary Search Trees)
Weiss 4.1-4.3, 4.6
EX1 Running Time
23 Jan
Dictionaries (AVL Trees 1)
Weiss 4.4
EX2 Heaps
26 Jan
Dictionaries (AVL Trees 2)
Weiss 4.4
28 Jan
Dictionaries (Hashing)
Weiss 5.1-5.5
EX3 Recurrences
30 Jan
Dictionaries (Hashing 2)
Weiss 5.1-5.5
2 Feb
Sorting 1
Weiss 7.1-7.3, 7.5-7.7
4 Feb
Sorting 2
Weiss 7.8-7.11
5 Feb
S5 Hashing and Sorting
CC5
CC6
6 Feb
Graphs 1 (Intro to Graphs)
Weiss 9.1
EX4 AVL
9 Feb
Graphs 2 (Traversals)
Weiss 9.2
13 Feb
Graphs 3 (Shortest path)
Weiss 9.3
EX5 Hashing
16 Feb
Presidents Day (no class)
18 Feb
Parallelism 1 (Fork-Join)
Grossman 2.1-3.4
EX6 Sorting
19 Feb
S7 Writing parallel Programs
CC10
CC11
20 Feb
Parallelism 2 (Parallel Prefix)
Grossman 5.1-5.2
EX7 Graph Traversals
23 Feb
Parallel Analysis & Amdahl's Law
Grossman 3.5-4.3
25 Feb
Synchronization (Locks)
Grossman 6
EX8 Shortest Paths
26 Feb
S8 Parallel Prefix Work and Span
CC12
CC13
CC14
27 Feb
Synchronization (Race Conditions)
Grossman 7.1
EX9 ForkJoin
2 Mar
Synchronization (Deadlock & Wisdom)
Grossman 8 & 9
4 Mar
Minimum Spanning Trees
Weiss 9.5
5 Mar
S9 Concurrency
CC15
CC16
CC17
6 Mar
Complexity Classes
Weiss 9.6.3 & 9.7
EX10 Concurrency
9 Mar
P, NP, NP-Complete
Weiss 9.6.3 & 9.7
11 Mar
Topological Sort and B-Trees
EX11 MSTs
13 Mar
Courses end
Finale
EX12 P and NP