Schedule

September
MondayTuesdayWednesdayThursdayFriday
22 23 24
Lecture
Intro; ADTs; Stacks & Queues
Weiss 3.1-3.7
Slides, A Ink, B Ink
25
Section
Intros, Java Generics
Slides, Worksheet [Solutions]
26
Lecture
Algorithm Analysis 1
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
Slides, A Ink, B Ink, Useful Math identitites
29
Lecture
Algorithm Analysis 2
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
Slides, A Ink, B Ink
23:59 Intro Survey Due
30 01
Lecture
Priority Queues 1: ADT
Weiss 6.1-6.3
Slides, A Ink, B Ink
02 03
Lecture
Priority Queues 2: Binary Heap
Weiss 6.4-6.5
Slides, A Ink, B Ink
23:59 EX0 Due
October
MondayTuesdayWednesdayThursdayFriday
06
Lecture
Algorithm Analysis 3: Amortized
Weiss 2.1-2.4, Math Review: Weiss 1.1-1.6
Slides, A Ink, B Ink
23:59 EX01 Due
07 08
Lecture
Algorithm Analysis 4: Recurrences
Slides, A Ink, B Ink, Useful Math identitites
09
Section
Recurrences
Worksheet [Solutions], SlidesPDF, SlidesPPTX
10
Lecture
Dictionaries 1: ADT & Binary Search Trees
Weiss 4.1-4.3, 4.6
Slides, A Ink, B Ink
23:59 EX02 Due
13
Lecture
Dictionaries 2: AVL Trees
Weiss 4.4
Slides, A Ink, B Ink
14 15
Lecture
Dictionaries 3: AVL Trees (cont.)
Weiss 4.4
Slides, A Ink, B Ink
16
Section
AVL Trees
SlidesPPTX, SlidesPDF, Worksheet [Solutions]
17
Lecture
Dictionaries 4: Hashing
Weiss 5.1-5.5
Slides, A Ink, B Ink
23:59 Mid Quarter Survey Due Saturday
23:59 EX03 Due
20
Lecture
Dictionaries 5: More Hashing
Weiss 5.1-5.5
Slides, A Ink,B Ink
21 22
Lecture
Sorting 1: Comparison Sorting
Weiss 7.1-7.3, 7.5-7.7
Slides, A Ink, B Ink
23 24
Lecture
Sorting 2: Beyond Comparison Sorting
Weiss 7.8, 7.11
Slides, A Ink, B Ink
23:59 EX04 Due
27
Lecture
Midterm Review Session (During Lecture)
28 29
Lecture
Office Hours (During Lecture)
17:10-18:10 Midterm exam
KNE 130
30
Section
Sorting
Worksheet [PDF, Solution], Slides [PDF]
31
Lecture
Graphs 1: Intro
Weiss 9.1
Slides, A Ink, B Ink
23:59 EX05 Due
November
MondayTuesdayWednesdayThursdayFriday
03
Lecture
Graphs 2: Graph Traversals
Weiss 9.2
Slides, pptx, A Ink,B Ink, More on Cycle Detection
04 05
Lecture
Graphs 3: Shortest Paths
Weiss 9.3
Slides, A Ink, B Ink
06
Section
Graphs
Worksheet [PDF, Solutions], Slides [PDF]
07
Lecture
Parallelism 1: Intro to Fork-Join
Grossman 2.1-3.4
Slides
23:59 EX06 Due
10
Lecture
Parallelism 2: Analysis
Grossman 3.5-4.3
Slides
11
Veteran's Day
12
Lecture
Parallelism 3: Parallel Prefix
Grossman 5.1-5.2
Slides
13
Section
Writing Parallel Programs & Parallel Prefix
Starter Code, Worksheet [PDF]
14
Lecture
Synchronization 1: Concurrency & Mutual Exclusion
Grossman 6
23:59 EX07 Due
17
Lecture
Synchronization 2: Race Conditions
Grossman 7.1
23:59 EX08 Due
18 19
Lecture
Synchronization 3: More Race Conditions & Deadlock
Grossman 8, 9
20
Section
Concurrency
21
Lecture
Graphs 4: Minimum Spanning Trees
Weiss 9.5
23:59 EX09 Due
24
Lecture
P, NP, NP-Complete
Weiss 9.6.3, 9.7
23:59 EX10 Due
25 26
Lecture
TBA
27
Thanksgiving
28
Native American Heritage Day
December
MondayTuesdayWednesdayThursdayFriday
01
Lecture
P, NP, NP-Complete II
Weiss 9.6.3, 9.7
23:59 EX11 Due
02 03
Lecture
B-Trees
Weiss 4.7
04
Section
P/NP
05
Lecture
Wrap Up
23:59 EX12 Due
08 09 10 11
12:30-13:20 Final exam
KNE 120
12