COT 6405: Analysis of Algorithms -- Spring 03
Course Homepage
Office: ECS 389; Phone: (305) 348-3748;
Office Hours: Tue (3:15-4:00 PM), Thu (6:45-7:30 PM)
e-mail: giri@cs.fiu.edu
Final Exam: Thursday April 24, 6:25-9:05 PM
ANNOUNCEMENTS
-
Apr 05 Homework #4 is now ready. See below.
- Mar 13 Homework #3 is ready. See below.
- Mar 04 Mid Term Exam score distribution: click here.
- Feb 22 Homework #2 is ready. See below.
- Feb 5 There were some minor corrections on homework #1
and I have now put up the corrected version below.
- Feb 5 Here you will find answers to select "Frequently Asked
Questions" (FAQs) about your assignments: FAQs.
- Jan 27: Homework #1 is ready. See below. Make sure you
read the homework guidelines and cheating policies. Also, to
understand how to present your work, look at the sample homework
solution that I had written for an earlier course.
HANDOUTS AND HOMEWORK ASSIGNMENTS
One must learn by doing the
thing; for though you think you know it, you have no certainty until
you try. Sophocles
For answers to select "Frequently Asked Questions" (FAQs) about your
assignments click here: FAQs.
SELECT LECTURE TRANSPARENCIES
USEFUL LINKS
TEXT:
Standard Text
"Introduction to Algorithms", (Second Edition) by Cormen, Leiserson, Rivest, Stein
[ISBN 0-07-013151-1]
Other Useful Books
- Computer Algorithms S. Baase and A. van Gelder, 3rd
Edition, Addison Wesley, 2000. ISBN: 0-201-61244-5.
- Computers and Intractability: A Guide to the Theory of
NP-Completeness, by M. Garey and D.S. Johnson, 1979
(Publishers: W. H Freeman and Company).
- Approximation Algorithms for NP-hard Problems, by Dorit Hochbaum,
PWS Publishing Co., 1997.
- Computational Geometry, by de Berg, van Kreveld,
Overmars, Schwazkopf
- Randomized Algorithms, by Motwani and
Raghavan
- Algorithm on Strings, Trees, and Sequences, by Gusfield
- Handbook of Discrete and Computational
Geometry, by Goodman and O'Rourke
- Combinatorial Optimization, by
Papadimitriou and Steiglitz
- Algorithms in C++ (Parts 1-4; Part 5), by Sedgewick
- Data Structures, Algorithms, and Applications in Java, by Sahni.
PREREQUISITE KNOWLEDGE EXPECTED (From Text)
- Chapter 1, 2, 3, 4, 5, 10, 11, 12, 22
- Appendices A, B, C.
SYLLABUS
- Sorting and Order Statistics
- Augmented Data Structures
- Dynamic Programming & Greedy Algorithms
- Amortized Analysis
- Graphs & Graph Algorithms
- String Matching
- Geometric Algorithms
- Linear Programming
- NP-Completeness
- Approximation Algorithms
- Randomized & On-line Algorithms
- Lower Bound Arguments
- Experimental Algorithmics
OLD ANNOUNCEMENTS
