Date
|
Topics
|
Homework & Assignments
|
Notes
|
February 3 |
Introduction
Insertion Sort |
|
01 Introduction |
February 5 |
Asymptotic Notation
Merge Sort |
Assignment 1: Sorting
Coding Standards |
02 Merge Sort |
February 10 |
Recurrence Relations |
|
03 Recurrence Relations |
February 12 |
Heapsort
|
Assignment 1: Sorting is DUE!!
Submit the solution to the following by Friday, 2/27 @5pm. If I'm not in my office, place it under my door:
- 2.1-3 on page 21
- 2.2-2, 2.2-4 on page 27
- 2.3-4, 2.3-5 on page 37
- 6.2-1, 6.2-2, 6.2-3 on page 132
- 6.3-1, 6.3-2 on page 135
- 6.4-1 on page 136
|
04 Heapsort |
February 17 |
Priority Queues |
|
|
February 19 |
Quicksort |
|
05 Quicksort |
February 24 |
Standard Template Library
|
|
06 STL |
February 26 |
Lab Exercise |
|
|
March 3 |
Linear Sorting
Review |
|
07 Linear Sort
07 Review |
March 5 |
EXAM 1 |
|
|
March 10 |
Lab work |
|
|
March 12 |
Order Statistics |
|
08 Order Stats |
March 17 |
Hashing and Elementary Data Structures |
|
09 Hashing |
March 19 |
Augmenting Data Structures |
|
10 Augmentation |
March 24 |
SPRING BREAK |
|
|
March 26 |
SPRING BREAK |
|
|
March 31 |
Dynamic Programming |
|
11 Dynamic Programming |
April 2 |
Graphs |
|
12 Graphs |
April 7 |
Topological Sorting
Strongly Connected Components |
|
13 SCC |
April 9 |
Minimum Spanning Trees |
|
14 MST |
April 14 |
Single-Source Shortest-Path |
|
15 Dijkstra |
April 16 |
Continuing previous lecture
Review |
|
|
April 21 |
EXAM 2 |
|
|
April 23 |
Lecture cancelled because I'm at a conference |
|
16 Review |
April 28 |
Dynamic Programming - Edit Distance
|
|
17 Edit Distance |
April 30 |
Huffman Codes |
|
18 Huffman codes |
May 5 |
|
|
|
May 7 |
|
|
|
May 12 |
|
|
|
May 14 |
READING DAY |
|
|
May 15 |
FINAL EXAM, 12:00PM - 3:30PM |
|
|