Introduction to Analysis of Algorithms
CSE 4081
Instructor: Phil Bernhard, Ph.D.
Office: Harris Institute 212, 674-7294
Email: pbernhar@cs.fit.edu
Prerequisite: CSE 2010 or ECE 2552 and 3541 and
Office Hours: TBD
- Texts:
-
Cormen, Leiserson, Rivest, and Stein,
Introduction to Algorithms, Third Edition, McGraw-Hill.
- FIT Catalog Course Description:
-
Covers time and space complexity of algorithms.
Analyzes algorithms for sorting, searching, string processing and graph problems.
Presents strategies such as divide-and-conquer, and greedy and dynamic programming as problem-solution techniques.
- Reading:
-
The course will follow the book very closely, starting with chapter 1.
However, supplemental information will be provided.
- Exams:
-
There will be two midterms and a final, all are closed book and closed
notes, and all will be in-class.
- Makeups:
-
Unless arrangements are worked out in advance,
missed tests cannot be made up,
and 5 points per day will be deducted
for late project submissions.
I understand that your job may occasionally take you out of town;
so does mine.
If you are going to be forced to miss class on the day something is due,
let me know ahead of time, in writing, preferably by email.
- Grading:
-
Final grade will be determined as follows (approximately):
midterm #1 - 33%,
midterm #2 - 33%,
final - 34%.
Please note that your grade will be determined only by your performance on the above items. In particular, details regarding your
GPA, enrollment, employment, or other matters unrelated to the course will not by factored into your grade.
Also note that the final exam will only be given on the scheduled date.
Students are expected to plan accordingly.
- Title IX:
-
https://www.fit.edu/title-ix/
Please see the university calendar for important dates!