Course Calendar

30 Mar
Courses begin
Intro; ADTs; Stacks & Queues Weiss 3.1-3.7 and slides(pptx) and slides(pdf) and A video
31 Mar
1 Apr
Algorithm Analysis 1 Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6 and slides(pptx) and slides(pdf)
2 Apr
S1 Intros, Java Generics slides and worksheet and solutions
3 Apr
Algorithm Analysis 2 Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6 and slides(pptx) and slides(pdf)
4 Apr
5 Apr
6 Apr
Priority Queues 1 (ADT) Weiss 6.1-6.3 and slides(pptx) and slides(pdf)
7 Apr
8 Apr
Priority Queues 2 (Binary Heap) Weiss 6.4-6.5 and slides(pptx) and slides(pdf)
EX0 Generics
9 Apr
S2 Algorithm Analysis and Heaps slides and worksheet and solutions and heaps video and heaps worksheet and heaps solutions and heaps slides
10 Apr
Recurrences slides(pptx) and slides(pdf)
CC0
CC1
CC2
11 Apr
12 Apr
13 Apr
Dictionaries (ADT & Binary Search Trees) Weiss 4.1-4.3, 4.6 and slides(pptx) and slides(pdf)
14 Apr
15 Apr
Dictionaries (AVL Trees 1) Weiss 4.4 and slides(pptx) and slides(pdf)
EX1 Running Time
16 Apr
S3 Recurrences slides and worksheet and solutions
17 Apr
Dictionaries (AVL Trees 2) Weiss 4.4 and slides(pptx) and slides(pdf)
CC3
18 Apr
19 Apr
20 Apr
Dictionaries (Hashing) Weiss 5.1-5.5 and slides(pptx) and slides(pdf)
EX2 Heaps
21 Apr
22 Apr
Dictionaries (Hashing 2) Weiss 5.1-5.5 and slides(pptx) and slides(pdf)
EX3 Recurrences
23 Apr
S4 AVL Trees slides and worksheet and solutions
24 Apr
Sorting 1 Weiss 7.1-7.3, 7.5-7.7 and slides(pptx) and slides(pdf)
CC4
25 Apr
26 Apr
27 Apr
Sorting 2 Weiss 7.8-7.11 and slides(pptx) and slides(pdf)
28 Apr
29 Apr
Sorting 3 slides(pptx) and slides(pdf)
EX4 AVL
30 Apr
S5 Hashing and Sorting hashing slides and hashing worksheet and hashing solutions and sorting slides and sorting worksheet and sorting solutions
1 May
Graphs 1 (Intro to Graphs) Weiss 9.1 and slides(pptx) and slides(pdf)
CC5
CC6
2 May
3 May
4 May
Midterm Exam
5 May
6 May
Graphs 2 (Traversals) Weiss 9.2 and slides(pptx) and slides(pdf)
EX5 Hashing
7 May
S6 Graphs slides and worksheet and solutions
8 May
Graphs 3 (Shortest path) Weiss 9.3 and slides(pptx) and slides(pdf)
CC7
CC8
9 May
10 May
11 May
Minimum Spanning Trees Weiss 9.5 and slides(pptx) and slides(pdf)
EX6 Sorting
12 May
13 May
Parallelism 1 (Fork-Join) Grossman 2.1-3.4 and slides(pptx) and slides(pdf)
EX7 Graph Traversals
14 May
S7 Writing parallel Programs fork join slides and fork join starter code and fork join solution code and Dijkstras slides and Dijkstras worksheet and Dijkstras solution
15 May
Parallelism 2 (Parallel Prefix) Grossman 5.1-5.2 and slides(pptx) and slides(pdf)
CC9
CC10
CC11
16 May
17 May
18 May
Synchronization (Locks) Grossman 6 and slides(pptx) and slides(pdf)
EX8 Dijkstras
19 May
20 May
Synchronization (Race Conditions) Grossman 7.1
EX9 MSTs
21 May
S8 Parallel Prefix and Locks
22 May
Synchronization (Deadlock & Wisdom) Grossman 8 & 9
CC12
CC13
CC14
23 May
24 May
25 May
Memorial Day (no class)
26 May
27 May
Parallel Analysis & Amdahl's Law Grossman 3.5-4.3
EX10 ForkJoin
28 May
S9 Concurrency
29 May
Complexity Classes Weiss 9.6.3 & 9.7
CC15
CC16
30 May
31 May
1 Jun
P, NP, NP-Complete Weiss 9.6.3 & 9.7
EX11 Concurrency
2 Jun
3 Jun
P, NP, NP-Complete 2
4 Jun
S10 P/NP & Final Review
5 Jun
Courses end
Finale
EX12 P and NP
11 Jun
Final Exam