|
Date |
Topic |
|
Lecture Slides |
|
January
30 |
Course Overview and
Insertion Sorting |
Chapters
1and 2 |
|
|
February 6 |
O, Q and W
notation, comparison of functions, Binary Heaps |
Chapters 3 and 6 |
|
|
February
13 |
Binary heaps, Huffman Coding, Binary Search
Trees |
Chapters
16 and 12 |
|
|
February
20 |
Rectangle
intersection and area computation, Divide and conquer algorithms |
Chapters
12 and 4 |
|
|
February
27 |
Discussion of
final project, Divide and conquer algorithms – continued |
Chapter
11 |
|
|
March
5 |
Hashing, greedy algorithms |
Chapter
12 |
|
|
March
12 |
Hashing (completed),
greedy algorithms |
Chapter
16 |
|
|
March
19 |
Greedy algorithms |
Chapter
16 |
Lecture6b |
|
March 26 |
No
class spring break |
|
|
|
April 2 |
Mid-term,
dynamic programming |
Chapter 15 |
Complete notes below |
|
April 9 |
Dynamic programming |
Chapter 15 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|