|
Introduction
Syllabus
Guidelines for labs
Lab sections
Take quiz & check grades
| |
Class Syllabus
| # |
Date |
Subject |
Reading Ch. |
| 1 |
Mar 28 |
Introduction, Abstract Data
Types |
Prog#1 |
|
|
Asymptotic Notation, |
2, |
| 3 |
30 |
heaps, heapsort. Priority
Queue Example: Simulation program |
7, 7.5,11.4 |
| 4 |
April 4 |
|
HW#1 |
| 5 |
|
Recurrences, Master
Theorem, induction, |
4.1-4.3 pg 53 to 64 |
| 6 |
6 |
|
|
| 7 |
11 |
|
Prog#2 |
| 8 |
|
Dictionaries, Hashing, trees, binary search trees |
12 pgs 219-240 13 pgs 244-262 |
| 9 |
13 |
|
|
| 10 |
18 |
|
Hw#2 |
| 11 |
|
Red-Black trees |
14 pgs 263-272 |
| 12 |
20 |
|
|
| 13 |
25 |
Disjoint sets |
Prog #3 22.1 pgs 440-442
22.3 pgs. 446-450 |
| 14 |
|
|
|
| 15 |
27 |
|
|
| 16 |
May 2 |
Midterm Exam |
HW#3 |
| 17 |
|
Graphs, Searching Graphs, topological sort |
23.1-23.4 |
| 18 |
4 |
|
|
| 19 |
9 |
Breadth First Search |
Prog #4 |
| 20 |
|
Strongly Connected components, |
23.5,24 |
| 21 |
11 |
|
|
| 22 |
16 |
|
Hw#4 |
| 23 |
|
Single
source shortest paths, all pairs shortest paths |
25,26 |
| 24 |
18 |
2nd Exam |
|
| 25 |
23 |
minimum spanning trees |
Prog #5 |
| 26 |
|
Quicksort, Radix Sort |
8,9 |
| 27 |
25 |
exercises |
|
| 28 |
30 |
|
|
| 29 |
June 1 |
Sorting Lower bounds, review |
9 |
| 30 |
|
|
|
|
June 7 |
Final exam 4 - 7 pm |
|
|