This site is subject to update through the term. This page was last modified Dec 02, 2010.
Lecturer: Max Alekseyev
Time:
TTh 2:00-3:15pm
Place:
Swearingen 2A15
Office hours: TTh 3:30-4:30pm,
Swearingen 3A48
Textbooks:
| Date |
Topics |
Slides |
| 08/19/10 |
Inroductory lecture (Ch. 1) |
Lecture 01 |
| 08/24/10 |
Summation techniques (App. A) |
Lecture 02 |
| 08/26/10 |
Summation techniques cont'd,
Products, Introductory cont'd (Ch. 1, App. A, Ch. 3) |
Lecture 03 |
| 08/31/10 |
Sorting Problem, Insertion Sort,
Merge Sort (Ch. 2) |
Lecture 04 |
| 09/02/10 |
Recurrences (Ch. 4, Ch. 3) |
Lecture 05 |
| 09/07/10 |
Divide-and-Conquer (Ch. 4) |
Lecture 06 |
| 09/09/10 |
Probabilistic Analysis,
Randomized Algorithms (Ch. 5) |
Lecture 07 |
| 09/14/10 |
Binary Heaps, Heapsort (Ch. 6) |
Lecture 08 |
| 09/16/10 |
Quicksort, Randomized Quicksort
(Ch. 7) |
Lecture 09 |
| 09/21/10 |
Sorting in Linear Time (Ch. 8) |
Lecture 10 |
| 09/23/10 |
Homework 1 review |
n/a |
| 09/28/10 |
Order Statistics and Selection
(Ch. 9) |
Lecture 11 |
| 10/30/10 |
Review session |
n/a |
| 10/05/10 |
Elementary Data Structures (Ch.
10) |
Lecture 12 |
| 10/07/10 |
Midterm |
n/a |
| 10/12/10 |
No class |
n/a |
| 10/19/10 |
Discussion of midterm problems |
n/a |
| 10/21/10 |
Hash Tables, Chaining, Hash
Functions, Universal Hashing (Ch. 11) |
Lecture 13 |
| 10/26/10 |
Probability Theory review, Hash
Tables with Open Addressing (App. C, Ch. 11) |
Lecture 14 |
| 10/28/10 |
Binary Search Trees (Ch. 12) |
Lecture 15 |
| 11/04/10 |
Red-Black Trees (Ch. 13) |
Lecture 16 |
| 11/09/10 |
Augmeting Data Structures (Ch.
14), Rod Cutting Problem (Ch. 15) |
Lecture 17 |
| 11/11/10 |
Dynamic Programming (Ch. 15) |
Lecture 18 |
| 11/16/10 |
Greedy Algorithms (Ch. 16) |
Lecture 19 |
| 11/18/10 |
Amortized Analysis (Ch. 17) |
Lecture 20 |
| 11/23/10 |
Homework 2 review |
n/a |
| 11/30/10 |
Elementary Graph Algorithms (Ch.
22) |
Lecture 21 |
| 12/02/10 |
Minimum Spanning Trees (Ch. 23) |
Lecture 22 |