The complexity and correctness of algorithms: big oh,
big omega, and big theta notations, recurrence relations and their solutions. Worst, average and amortized analysis of
algorithms with examples. Basic and advanced data structures for searching, sorting, compression and graph algorithms.
Students will be given programming assignments on a regular basis.
Cross-listed with CpE 600.
Pre-requisites:
Textbooks:
Instructor:
Teaching Assistant:
Class Mailing List:
Grading:
Policies:
Week | Date | Topics | Description |
---|---|---|---|
1 | January 23, 2006 | Introduction | Chapters 1-3, Appendix A-C Asymptotic Notation, Standard Notations, Common Functions, Summations |
2 | January 30, 2006 | Asymptotic Analysis | Chapter 4 Recurrences |
3 | February 6, 2006 | Sorting | Chapters 6, 7 Heaps, Heapsort, Priority Queues, Quicksort |
4 | February 13, 2006 | No Class | Institute Closed because of Snowstorm |
5 | February 21, 2006 Monday Schedule |
Sorting | Chapters 8, 9 Lower Bounds for Sorting, Counting Sort, Radix Sort, Bucket Sort |
6 | February 27, 2006 | Probabilistic Analysis | Chapters 5, 7 Randomized Algorithms, Randomized Quicksort |
7 | March 6, 2006 | Order Statistics and Hashing | Chapters 9, 11 Medians and Order Statistics, Minimum and Maximum, Hashing, Collision Resolution |
8 | March 13, 2006 | No Class | Spring Break |
9 | March 20, 2006 | MIDTERM | Comprehensive |
10 | March 27, 2006 | Trees | Chapters 12, 13 Binary Search Trees, Red-Black Trees |
11 | April 3, 2006 | Dynamic Programming | Chapter 15 Dynamic Programming, Matrix-Chain Multiplication |
12 | April 10, 2006 | Greedy Algorithms, Amortized Analysis | Chapters 16, 17 Greedy Strategy, Huffman Codes, Aggregate Analysis |
13 | April 17, 2006 | Graphs | Chapter 22 Graph Algorithms, Breadth-First Search, Depth-First Search |
14 | April 27, 2006 Unusual Day! |
Graphs | Chapter 23 Spanning Trees, Kruskal's Algorithm, Prim's Algorithm |
15 | May 1, 2006 | Graphs | Chapter 24 Shortest Paths, Bellman-Ford Algorithm, Dijkstra's Algorithm |