Instructor: Ashok Srinivasan Office hours: TF 1:00 pm - 2:00 pm, or by appointment. Location: 169, Love Building Phone: 644-0559, Email: asriniva@cs.fsu.edu Course web site: Access through blackboard http://campus.fsu.edu |
Lecture hours: |
Note: COP 4531: Complexity and Analysis of Data Structures and Algorithms is strongly recommended. You are also expected to have the mathematical maturity to write formal proofs and algorithms.
Formal methods for the analysis of algorithm complexity, application to specific algorithms, lower bounds, NP completeness, and other classifications of ``hard" problems.
Attendance and class participation | 5 |
Group project | 15 |
Three Homework assignments | 25 |
Midterm | 20 |
Final Exam | 35 |
Course average | Minimum exams average (%) | Letter grade |
---|---|---|
90 - 100 | 85 | A |
87 - 90 | 80 | A- |
80-87 | 70 | B |
70-80 | 60 | C |
60 - 70 | 50 | D |
0 - 60 | 0 | F |
Dates | Topic | Dates | Topic |
---|---|---|---|
6 Jan - 8 Jan | Analysis of algorithm complexity. | 13 Jan - 15 Jan | Applications to specific algorithms. |
22 Jan | Applications to specific algorithms. | 27 Jan - 29 Jan | Analysis of randomized algorithms. |
3 Feb - 5 Feb | (i) Analysis of randomized algorithms and (ii) lower bounds. | 10 Feb - 12 Feb | (i) Lower bounds and (ii) Midterm (12 Feb 2003). |
17 Feb - 19 Feb | NP completeness. | 24 Feb - 26 Feb | NP completeness. |
3 Mar - 5 Mar | NP completeness. | 10 - 12 Mar | No class -- Spring break. |
17 Mar - 19 Mar | NP completeness. | 24 Mar - 26 Mar | Approximation algorithms. |
31 Mar - 2 Apr | Approximation algorithms. | 7 Apr - 9 Apr | Approximation algorithms. |
14 Apr - 16 Apr | (i) Approximation algorithms and (ii) Other complexity classes. | 21 Apr - 23 Apr | Project presentations. |
Wed, 30 Apr | Final exam, 5:30 pm - 7:30 pm. |