COSC 511 Design and Analysis of Algorithms FALL 2014
Course communication
- Course home page -- http://emunix.emich.edu/~haynes/511/fa14
- Course wiki --
https://cosc511-fa14.wikispaces.com/
Instructor: Professor Susan Haynes
- Home page: http://emunix.emich.edu/~haynes
- Office: 511E Pray-Harrold
- Email: shaynes @ emich.edu
Office Hours: 511E Pray-Harrold
- M 12:30 - 3:00 pm
- T, θ 3:30 - 5:00pm
- and by appointment
Textbooks:
- Required: J. Kleinberg, Algorithm Design, most recent edition, Addison-Wesley.
- Required: A Aziz, T-H Lee , A Prakash,
Elements of Programming Interviews: The Insiders' Guide Paperback,
CreateSpace Independent Publishing Platform, 1479274836, October 11, 2012
Course description
Complexity measures of algorithms; searching, sorting, string matching, and graph algorithms; design and
analysis of greedy algorithms, backtracking, divide and conquer approach, dynamic programming; NP-complete and NP-hard
problems are studied.
Grading:
Algorithm Exercises, Assignments
| 60% |
Midterm
Tentative date: October 16, during class time
| 10% |
Final Exam (cumulative)
December 16, during class time | 15% |
| Programming Projects | 15% |
Assignment of grades:
- 91 - 100% A range
- 81 - 90% B range
- 71 - 80% C range
- 61 - 70% D range
- <= 60% F range
Academic Honesty:
I expect you to behave according to the highest possible ethical standards. If you claim anyone else's work as your own, or if you allow someone else to claim your work, you will receive an E in this class.
Additionally, I will report your name to the Dean of Students for possible expulsion.
Warning: the Internet is seductive; there is a lot of publicly accessible material out there. I will tell you when and how it will be acceptable to cannibalize code for a project. It is never acceptable to cannibalize text (e.g., for a paper). Do not plagiarize! Theft is beneath you.
Caveat: This syllabus and the course outline will be changed as I deem pedagogically necessary or preferable.
I will publish written changes to the syllabus.