Schedule

January
MondayTuesdayWednesdayThursdayFriday
06
Lecture
Intro; ADTs; Stacks & Queues
Weiss 3.1-3.7
Slides, A Ink, B Ink
07 08
Lecture
Algorithm Analysis 1
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
Slides, A Ink, B Ink, xls, More on Amortized
09
Section
Intros, Java Generics
Slides, Worksheet [Solution], Code
23:59 Intro Survey Due
10
Lecture
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
13
Lecture
Priority Queues 1: ADT
Weiss 6.1-6.3
Slides, A Ink, B Ink
23:59 EX0 Due
14 15
Lecture
Priority Queues 2: Binary Heap
Weiss 6.4-6.5
Slides, A Ink, B Ink
16
Section
Algorithm Analysis & Heaps
Slides, Worksheet [Solution],Heaps Slides, Heaps Worksheet [Solution]
17
Lecture
Algorithm Analysis 3: Recurrences
Slides, A Ink, B Ink, Useful Math identitites
23:59 EX01 Due
20
MLK Day
21 22
Lecture
Dictionaries 1: ADT & Binary Search Trees
Weiss 4.1-4.3, 4.6
Slides, A Ink, B Ink
23
Section
Recurrences
Slides, Worksheet [Solutions]
24
Lecture
Dictionaries 2: AVL Trees
Weiss 4.4
Slides, Worksheet, A Ink, B Ink
23:59 EX02 Due
27
Lecture
Dictionaries 3: AVL Trees (cont.)
Weiss 4.4
(no new slides, see updated ink on Fri)
23:59 EX03 Due
28 29
Lecture
Dictionaries 4: Hashing
Weiss 5.1-5.5
Slides, A Ink, B Ink
30
Section
AVL Trees
Slides, Worksheet [Solutions]
31
Lecture
Dictionaries 5: More Hashing
Weiss 5.1-5.5
Slides, A Ink,B Ink, proof, xls
February
MondayTuesdayWednesdayThursdayFriday
03
Lecture
Sorting 1: Comparison Sorting
Weiss 7.1-7.3, 7.5-7.7
Slides, A Ink, B Ink
23:59 EX04 Due
04
23:59 Mid Quarter Survey Due
05
Lecture
Sorting 2: Beyond Comparison Sorting
Weiss 7.8, 7.11
Slides, A Ink, B Ink
06
Section
Hashing & Sorting
Hashing: Slides, Worksheet [Solutions] & Sorting: Slides, Worksheet [Solutions]
07
Lecture
Midterm Review
23:59 EX05 Due
10
Lecture
Graphs 1: Intro
Weiss 9.1
Slides, A Ink, B Ink
17:30-18:30 Midterm exam
BAG 131 & 154
11 12
Lecture
Graphs 2: Graph Traversals
Weiss 9.2
Slides, A Ink, B Ink, traversal examples, More on Cycle Detection
13 14
Lecture
Graphs 3: Shortest Paths
Weiss 9.3
Slides, A Ink, B Ink
23:59 EX06 Due
17
President's Day
18 19
Lecture
Parallelism 1: Intro to Fork-Join
Grossman 2.1-3.4
Slides, A Ink, B Ink
20
Section
Writing Parallel Programs
Slides, Starter Code [Solutions]
21
Lecture
Parallelism 2: Analysis
Grossman 3.5-4.3
Slides, A Ink, B Ink
24
Lecture
Parallelism 3: Parallel Prefix
Grossman 5.1-5.2
Slides, A Ink, B Ink
23:59 EX07 Due
25 26
Lecture
Synchronization 1: Concurrency & Mutual Exclusion
Grossman 6
Slides, A Ink, B Ink
27
Section
Parallel Prefix, Work & Span
Slides, Worksheet [Solutions]
28
Lecture
Synchronization 2: Race Conditions
Grossman 7.1
Slides , Ink
23:59 EX08 Due
March
MondayTuesdayWednesdayThursdayFriday
03
Lecture
Synchronization 3: More Race Conditions & Deadlock
Grossman 8, 9
Ruths A Ink, Ruths B Ink
23:59 EX09 Due
04 05
Lecture
Graphs 4: Minimum Spanning Trees
Weiss 9.5
Slides, A Ink, B Ink
06
Section
Concurrency, MSTs
Concurrency: Slides, Worksheet [Solutions] & MSTs: Slides, Worksheet [Solutions]
07
Lecture
Graphs 5: Topological Sort
Weiss 9.2
Slides, A Ink, B Ink
23:59 EX10 Due
10
Lecture
P, NP, NP-Complete
Weiss 9.6.3, 9.7
Slides, A Ink, B Ink
11 12
Lecture
P, NP, NP-Complete II
Weiss 9.6.3, 9.7
Slides, A Ink, B Ink
23:59 EX11 Due
13
Section
P/NP
Slides, Worksheet [Solutions]
14
Lecture
B-Trees & Wrap Up
Weiss 4.7
Slides, A Ink, B Ink
23:59 EX12 Due
17 18
16:30-18:20 Review Session
CSE2 G20
19 20
12:30-14:20 Final exam
KNE 120
21