COT 4400 - Analysis Of Algorithms


Summer 2004
Monday and Wednesday, 1:00 pm -3:00 pm, ENG 3





Textbook: 'Introduction to Algorithms', Second Edition, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein

Instructor: Sunita Nayak
Office: ENB 348
Office Hours: Monday, Wednesday 11:00 am - 12:30 pm
              Any other time by appointment.
E-mail: snayak@csee.usf.edu
Phone: (813) 974-2514


Grade Distribution and Tentative Dates:
Exam1         - 25%   - 2nd June 2004
Exam2         - 25%   - 23rd June 2004
Final Exam   - 40%   - 14th July 2004
Homeworks  - 10%

Homeworks are due in the beginning of the class on the due date.
Penalty for late submission:
      Grade reduced by 25% if submitted late on the due date
      Grade reduced by 50% for each day after the due date


Tentative Schedule:
Monday Wednesday
May 10
Course Overview
Introduction		 May 12
Introduction
Math Review
May 17
Assymptotic Notation
Recurrences		 May 19
Recurrences
Heap-Sort
May 24
Heap-Sort
Quick-Sort		 May 26
Quick-Sort
Counting-Sort
Radix-Sort
May 31
Holiday - Memorial Day		 June 2
EXAM 1
June 7
Binary search trees		 June 9
Representing graphs
Breadth-first search
June 14
Depth-first search
Topological sort		 June 16
Disjoint sets
Spanning trees
June 21
Greedy algorithms		 June 23
EXAM 2
June 28
Dynamic Programming		 June 30
NP problems
July 5
Holiday - Independence Day		 July 7
NP problems
Examples of NP
July 12
Discussions		 July 14
EXAM 3


HomeWork 1  Due: 19 May 2004

HomeWork 2  Due: 26 May 2004

HomeWork 3  Due: 16 June 2004

HomeWork 4  Due: 21 June 2004

Exam 1   Grade Distribution   Solution
Exam 2   Grade Distribution   Solution
Exam 3   Solution

Extra Credit Questions  Due: 15 July 2004
Put the answer sheets in my mail box (Nayak) in ENB 342.
Extra Credit Solution


Final Grades   Final Grades Distribution  
If you have any questions regarding your grades, meet me on or before July 21st at the following times at ENB 348.
July 20th - 1:00 pm to 2:30 pm
July 21st - 11:00 am to 12:30 pm
Any change after that would be difficult.


For the material, composed by Dr. Fink, click here.


Previous sample exam questions:
Exam1 1999
Exam2 1999

All concepts covered in the class are equally probable to come in the exam.