CSE 373 Autumn 2016
Course Calendar

Subscribe to this calendar (google, iCal, etc.)

 Show color key

September
MondayTuesdayWednesdayThursdayFriday
26 27 28
14:30-15:20 Lecture
SMI 120
Introduction; 3.1-3.7.
Slides.
29
Section
Java review: classes, inheritance, public, private and package qualification.
30
14:30-15:20 Lecture
SMI 120
Java Review, GUI Construction; 1.4-1.6.
Swing tutorial. Slides.
23:59 Background Questionnaire due Sept. 30.

October
MondayTuesdayWednesdayThursdayFriday
03
14:30-15:20 Lecture
SMI 120
Mathematics Review; 1.1-1.3.
Slides.
04 05
14:30-15:20 Lecture
SMI 120
Asymptotic Analysis I; Ch. 2.
Slides.
06
Section
Math review: logs, exponents, permutations, combinations, arithmetic and geometric series.
07
14:30-15:20 Lecture
SMI 120
Asymptotic Analysis II
Slides.
23:59 Assignment 1 due.
10
14:30-15:20 Lecture
SMI 120
Dictionaries and Trees; 4.1-4.3.
Slides.
11 12
14:30-15:20 Lecture
SMI 120
Algorithm Correctness and Induction (Parts 1 and 2); Reading: pp6-12.
Slides for Part 1 Slides for Part 2. Part 1 video. Part 2 video.
13
Section
Simple proofs of correctness, simple induction.
14
14:30-15:20 Lecture
SMI 120
Algorithm Correctness and Induction (Part 3).
Slides for Part 3. Part 3 video.
17
14:30-15:20 Lecture
SMI 120
AVL Trees; 4.4.
Slides.
18 19
14:30-15:20 Lecture
SMI 120
Hashing I; 5.1-5.2.
Slides.
20
Section
AVL tree insertion and deletion. Optional: Hashing.
21
14:30 Assignment 2 due (start of lecture).
14:30-15:20 Lecture
SMI 120
Hashing I (continued). worksheet; solutions;
24
14:30-15:20 Lecture
SMI 120
Hashing II; 5.3-5.6.
Slides.
25 26
14:30-15:20 Lecture
SMI 120
Disjoint Sets and the UNION-FIND ADT; 8.1-8.3.
Slides.
27
Section
UNION-FIND examples.
28
14:30-15:20 Lecture
SMI 120
Implementing the UNION-FIND ADT; 8.4-8.5; 8.7.
Slides. Maze construction worksheet solutions;
23:59 Assignment 3 due.
31
14:30-15:20 Lecture
SMI 120
UNION-FIND (conclusion)
01 02
14:30-15:20 Lecture
SMI 120
Priority Queues and Binary Heaps; 6.1-6.4.
Slides.
03
Section
Priority queues via binary heaps.
04
14:30-15:20 Lecture
SMI 120
Review
23:59 Assignment 4 due.

November
MondayTuesdayWednesdayThursdayFriday
07
Midterm exam
08 09
14:30-15:20 Lecture
SMI 120
Introduction to Graphs; 9.1.
Slides.
10
Section
Graph traversals and implicit graphs.
11
Veterans Day
14
14:30-15:20 Lecture
SMI 120
Topological Sorting, Graph Traversal; 9.2.
Slides.
15 16
14:30-15:20 Lecture
SMI 120
Minimum Spanning Trees with Kruskal's Algorithm; 9.5.
Slides.
17
Section
Minimum spanning trees.
18
14:30-15:20 Lecture
SMI 120
Finding Shortest Paths in a Graph with Dijkstra's Algorithm; 9.3.
Slides.
21
14:30-15:20 Lecture
SMI 120
Comparison Sorting; 7.1-7.6.
Slides.
22 23
14:30-15:20 Lecture
SMI 120
Beyond Comparison Sorting; 7.11.
Slides.
23:59 Assignment 5 due.
24
Thanksgiving Day
25
Day After Thanksgiving
28
14:30-15:20 Lecture
SMI 120
Algorithm Design Paradigms; 10.1, 10.1.1. plus complementary reading on sequence alignment using dynamic programming.
Slides.
23:59 Optional Assignment UF due.
29 30
14:30-15:20 Lecture
SMI 120
Divide-and-Conquer and the FFT. 10.2, 10.2.1. (plus more readings).
Slides.
01
Section
Dynamic programming.
02
14:30-15:20 Lecture
SMI 120
P vs NP and NP-Completeness. 9.7.
Slides.

December
MondayTuesdayWednesdayThursdayFriday
05
14:30-15:20 Lecture
SMI 120
Parallelism in algorithms and their implementations. Reading: parallelism notes Sections 2 and 3.
Slides.
23:59 Assignment 6 due.
06 07
14:30-15:20 Lecture
SMI 120
Algorithms and Problem Solving.
Slides.
08
Section
P vs NP.
09
14:30-15:20 Lecture
SMI 120
Review
12 13
14:30-16:20 Final exam
14 15 16