COT 5407: Introduction to Algorithms -- Fall 05
Course Homepage
Class: Room ECS 132; Tue-Thu: 5:00 to 6:15 PM
Office: ECS 389; Phone: (305) 348-3748;
Office Hours: TBA
e-mail: giri@cs.fiu.edu
ANNOUNCEMENTS
- Dec 19 Grades will be available on Wednesday Dec 21. Email
me if you want it.
- Dec 10 Tutorial in Room 134 or 136 at 9:30 AM, Saturday
Dec 10.
- Nov 16 Programming Assignment #1 is now ready.
- Nov 16 Homework #4 is now ready.
- Nov 11 Since today is the drop deadline, you can have your
midterm exam scores by stopping by my office any time
today. The class average for the exam was 43 out of a maximum
score of 75. I grade on a curve and an average score for this
class would be judged as a "solid B".
- Nov 4 There will be no extra class this Saturday Nov 6.
- Oct 26 The midterm exam for Oct 27 is CANCELED. It will
be held at 5 PM on Tuesday, November 1, in Rm ECS 349.
We will tentatively have an extra class on Saturday Nov 6
to make up for lost time.
- Oct 22 Since we discussed HW#3 in class, this will be
graded after your midterm exam.
- Oct 20 THE MIDTERM EXAM HAS BEEN POSTPONED TO OCTOBER 27.
IT WILL BE HELD IN ROOM ECS 349 AT 5:00 PM. PLEASE NOTE THE
CHANGE IN TIME AND PLACE! There will be no class on Tuesday,
October 25.
- Oct 14 THE TUTORIAL SESSION WILL BE HELD AT 9:30 AM ON
SATURDAY OCT 15 IN ROOM ECS 349.
- Oct 11 Answers to select "Frequently Asked Questions"
(FAQs) about your assignments can be found by clicking here:
FAQs.
- Oct 4 MidTerm #1 is scheduled for Oct 25. Tentatively,
there will be a tutorial session on Oct 15 from 10AM to noon.
- Oct 4 Homework #3 is now ready. It's due Oct 18.
- Sep 29 Homework #2 is due on Tuesday, Oct 1. Your next
homework (#3) will be ready over the weekend of Sep 30.
- Sep 20 Homework #2 is now ready.
- Sep 19 Classes are cancelled for Tuesday, Sep 20. We will
meet again on Thursday, Sep 22. Homework #1 may be submitted
on Thursday. I will post a new homework (#2) later today.
Stay safe!
- Sep 9 Homework #1 is now ready. See below for
details. Make sure you carefully read the submission
guidelines and collaboration policies for this class.
- Aug 29 The class will meet in Room ECS 132 (and
NOT in PC211, as mentioned in PantherSoft).
HANDOUTS AND HOMEWORK ASSIGNMENTS
- Homework Guidelines and
Collaboration Policies: You must read this first.
- Homework #1 [pdf]: Due Sep 20.
- Homework #2 [pdf]: Due Sep 29.
- Homework #3 [pdf]: Due Oct 18.
- Frequently Asked Questions About Homeworks [ FAQs]
- Homework #4 [pdf]: Due Nov 22.
- Programming Assignment #1 [pdf]: Due Dec 8;
Data File: Data.txt;
Use the following test file to test your program:
Test_p1.txt (Courtesy: Justin Schecter).
- Homework #5 [pdf]: Not to be turned in.
LECTURE TRANSPARENCIES (pdf format)
- Nov 15, 17 [pdf] [Graphs]
- Nov 11 [pdf] [Dynamic Programming]
- Nov 5 [Number-Theoretic Algorithms]
- Nov 3 [pdf] [Dynamic Programming]
- Oct 18 [pdf] [Greedy Algorithms]
- Oct 13 [pdf] [Augmented
RB-Trees; Rank and Select operations; Greedy Algorithms]
- Oct 6, 11 [pdf] [RB-Trees]
- Oct 4 [pdf] [BST]
- Sep 29 [pdf] [Selection]
- Sep 27 [pdf] [Sorting and
Selection]
- Sep 15, 22 [pdf] [QuickSort,
HeapSort, BucketSort, RadixSort]
- Sep 8, 13 [pdf] [SelectionSort,
InsertionSort, and more on Sorting]
- Sep 6: [pdf] [Recurrence
Relations, Sorting]
- Sep 1: [pdf] [Recurrence Relations]
- Aug 30: [pdf]
[Introduction, Doubling Search, Horner's Rule, Celebrity Problem]
RECOMMENDED READING
- Sep 1: Chapters 3 & 4, CLRS text.
- Aug 30: Chapters 1 & 2, CLRS text.
USEFUL LINKS
TEXT:
Standard Text
"Introduction to Algorithms", (Second Edition) by Cormen, Leiserson, Rivest, Stein
[ISBN 0-07-013151-1]
Other Useful Books
- Algorithms in C++ (Parts 1-4; Part 5), by Sedgewick
- Data Structures, Algorithms, and Applications in Java, by Sahni.
- 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).
- Algorithm Design, by Kleinberg and Tardos.
- 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
SYLLABUS
- Sorting and Order Statistics
- Balanced Trees
- Augmented Data Structures
- Dynamic Programming & Greedy Algorithms
- Graphs & Graph Algorithms
- String Algorithms
- Geometric Algorithms
- NP-Completeness
- Lower Bound Arguments
- Experimental Algorithmics
OLD ANNOUNCEMENTS
Last modified: Mon Dec 19 10:29:05 EST 2005
