|
HOME
ANNOUNCEMENTS
COURSE SCHEDULE
HOMEWORKS
PROJECTS
OFFICE HOURS
SUPPLEMENTALS
|
| Date |
Topic |
Post |
Due |
Ref * |
|
|
|
|
|
| Jan 24 |
Introduction |
|
|
[1] Chap 1 & 2, ref |
| Jan 29 |
Induction |
|
|
[1] Chap 2, ref |
| Jan 31 |
Induction, Analysis of Algorithm and O notation |
|
|
[1] Chap 2-3, [2] Chap 2,ref1, ref2 |
| Feb 5 |
O notation |
Homework 1 |
|
[1] Chap 3, [2] Chap 2, ref |
| Feb 7 |
Recurrence Relations-1 |
|
|
[1] Chap 3, [2] Chap 2, ref |
| Feb 12 |
Recurrence Relations-2 |
|
Homework 1 |
[1] Chap 3, [2] Chap 2, ref |
| Feb 14 |
Master Theorem - Induction and Algorithms |
Homework 2 |
|
[1] Chap 3-5, [2] Chap 2, ref1, ref2 |
| Feb 19 |
Induction and Algorithms - Introduction to Data Structures-1 |
|
|
[1] Chap 5-Sec 4.2, ref1, ref2 |
| Feb 21 |
Binary Search and Its Applications |
|
Homework 2 |
[1] Sec 6.2-6.3, ref1 |
| Feb 26 |
Sorting: Insertion Sort, Selection Sort, Merge Sort |
|
|
[1] Sec 6.4, ref1 |
| Feb 28 |
Sorting: Bucket Sort, Radix Sort |
|
|
[1] Sec 6.4, ref |
| Mar 5 |
Quicksort |
Homework 3 |
|
[1] Sec 6.4, ref |
| Mar 7 |
Quicksort, Selection Problem |
Prog 1 |
|
[1] Sec 6.4, ref |
| Mar 12 |
Heap and Heapsort |
|
Homework 3 |
[1] Sec 6.4, ref |
| Mar 14 |
Midterm 1 |
|
|
|
| Mar 19 |
Spring Break |
|
|
|
| Mar 21 |
Spring Break |
|
|
|
| Mar 26 |
Hashing |
|
|
[1] Sec 4.4, ref |
| Mar 28 |
Trees and Binary Search Trees |
|
|
[1] Sec 4.3.3, ref |
| Apr 2 |
Dynamic Programmings |
|
Prog 1 |
[1] Sec 5.10, [2] Chap 6, ref |
| Apr 4 |
Dynamic Programming |
|
|
[1] Sec 5.10, [2] Chap 6, ref |
| Apr 9 |
Greedy Algorithm |
Homework 4 |
|
[1] Sec 5.10, [2] Chap 4.1-4.2, ref |
| Apr 11 |
Introduction to Graph Theory, DFS |
|
|
[1] Sec 7.1-7.3.1, [2] Sec 3.1-3.2-3.3, ref1, ref2 |
| Apr 16 |
DFS, BFS |
|
Homework 4 |
[1]Sec 7.3.1-7.3.2, [2] Sec 3.3-3.4, ref |
| Apr 18 |
DFS, BFS |
Prog 2 |
|
[1] Sec 7.3.1-7.3.2, [2] Sec 3.3-3.4, ref |
| Apr 23 |
BFS, DAGS and Topological Sorting |
|
|
[1] Sec 7.4, [2] Sec 3.5-3.6, ref1, ref2 |
| Apr 25 |
Single-Source Shortest Path |
|
|
[1] Sec 7.5, [2] Sec 4.4, ref |
| Apr 30 |
All-Pairs Shortest Paths |
|
|
[1] Sec 7.7, [2] Sec 6.8, ref |
| May 2 |
Minimum Spanning Tree |
Homework 5 |
|
[1]Sec 7.6, [2] Sec 4.5, ref |
| May 7 |
Reduction an NP Completeness |
|
Prog 2 |
[1] Chap 11, [2] Chap 8, ref |
| May 9 |
NP Completeness |
|
Homework 5 |
[1] Chap 11, [2] Chap 8, ref1, ref2 |
| [1] Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley, 1989. |
| [2] Jon Kleinberg and Eva Tardos, Algorithm Design, Addison-Wesley, 2006. |
| * Thanks Prof. Hajiaghayi for sharing his notes for CMSC 351. |
|
