Course Calendar

5 Jan
Courses begin
Intro; ADTs; Stacks & Queues Weiss 3.1-3.7 and slides(pptx) and slides(pdf) and A video and B video
6 Jan
7 Jan
Algorithm Analysis 1 Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6 and slides(pptx) and slides(pdf) and A video and B video
8 Jan
S1 Intros, Java Generics slides and worksheet and solutions
9 Jan
Algorithm Analysis 2 Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6 and slides(pptx) and slides(pdf) and A video and B video
10 Jan
11 Jan
12 Jan
Priority Queues 1 (ADT) Weiss 6.1-6.3 and slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
13 Jan
14 Jan
Priority Queues 2 (Binary Heap) Weiss 6.4-6.5 and slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
EX0 Generics
15 Jan
S2 Algorithm Analysis and Heaps slides and worksheet and heaps video
CC0
CC1
CC2
16 Jan
Recurrences slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
17 Jan
18 Jan
19 Jan
MLK Day (no class)
20 Jan
21 Jan
Dictionaries (ADT & Binary Search Trees) Weiss 4.1-4.3, 4.6 and slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
EX1 Running Time
22 Jan
S3 Recurrences slides and worksheet and solutions
CC3
23 Jan
Dictionaries (AVL Trees 1) Weiss 4.4 and slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
EX2 Heaps
24 Jan
25 Jan
26 Jan
Dictionaries (AVL Trees 2) Weiss 4.4 and slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
27 Jan
28 Jan
Dictionaries (Hashing) Weiss 5.1-5.5 and slides(pptx) and slides(pdf) and slides(a lecture) and slides(b lecture) and A video and B video
EX3 Recurrences
29 Jan
S4 AVL Trees video and slides and worksheet and solutions
CC4
30 Jan
Dictionaries (Hashing 2) Weiss 5.1-5.5 and slides(pptx) and slides(pdf)
31 Jan
1 Feb
2 Feb
Sorting 1 Weiss 7.1-7.3, 7.5-7.7 and slides(pptx) and slides(pdf)
3 Feb
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
7 Feb
8 Feb
9 Feb
Graphs 2 (Traversals) Weiss 9.2
10 Feb
11 Feb
Midterm Exam
12 Feb
S6 Graphs
CC7
CC8
CC9
13 Feb
Graphs 3 (Shortest path) Weiss 9.3
EX5 Hashing
14 Feb
15 Feb
16 Feb
Presidents Day (no class)
17 Feb
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
21 Feb
22 Feb
23 Feb
Parallel Analysis & Amdahl's Law Grossman 3.5-4.3
24 Feb
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
28 Feb
1 Mar
2 Mar
Synchronization (Deadlock & Wisdom) Grossman 8 & 9
3 Mar
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
7 Mar
8 Mar
9 Mar
P, NP, NP-Complete Weiss 9.6.3 & 9.7
10 Mar
11 Mar
Topological Sort and B-Trees
EX11 MSTs
12 Mar
S10 P/NP & Final Review
13 Mar
Courses end
Finale
EX12 P and NP
19 Mar
Final Exam