CSCI 8080: Design and Analysis of Algorithms
Text book:
Introduction to Algorithms, 2/e
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
References:
1. Design and Analysis of Computer Algorithms by Aho, Hopcroft, and Ullman
2. Introduction to NP-Completeness by Garey and Johnson
3. An Introduction to the Analysis of Algorithms by Sedgewick and Flajolet
4. Discrete Mathematics and its Applications by Ken Rosen
Some of the topics covered:
1. Model of Computations, Growth of Functions, Recurrences
2. Comparison Sorts, and Sorting in Linear Time
3. Dynamic Programming, Greedy Algorithms
4. Graph Algorithms
5. NP-Complete problems
Grading Policy:
Midterms (2)
50%
In class exams, 75 mins long
Quizzes (2)
30%
Term Project/Paper
20%
90 % - 100%
85% - 89%
80% - 84%
75% - 79%
70% - 74%
65% - 69%
60% - 64%
A
AB+
B
BC+
C
Expectations:
1. Attend every class (no attendance will be taken. The instructor is not responsible
for missed handouts, announcements, or notes.)
2. Follow students’ conduct requirements found at
http://www.isqa.unomaha.edu/studentcode.pdf.
Office Hours: 1:30 – 2:30PM TR or by appointment