RIT Department of Computer Science
CSCI-665 Foundations of Algorithms Syllabus
Catalogue Description
This course provides an introduction to the design and analysis of algorithms. It covers a variety of classical algorithms and their complexity and will equip students with the intellectual tools to design, analyze, implement, and evaluate their own algorithms. (CSCI 603, CSCI 605, and CSCI 661, with B or better in all courses) or equivalent or permission of instructor (students who take CSCI 261 may not take CSCI 665 for credit)Course Outcomes
- Students should demonstrate an understanding of basic concepts related to the design and analysis of algorithm.
Evaluation: Assessed by homeworks and exams. - Students should demonstrate knowledge of classical algorithms and their complexity.
Evaluation: Assessed by homeworks and exams. - Students should be able to design and analyze their own algorithms.
Evaluation: Assessed by homeworks. - Students should implement, experiment with, compare, and report on various algorithmic solutions to the same problem.
Evaluation: Assessed by a programming project (programming homework assignments).
Instructor Contact
Stanisław P. Radziszowski, Ph.D.Office: 70-3657
Phone: 585-475-5193
email: spr@cs.rit.edu
website: www.cs.rit.edu/~spr
Course Policies
N/ARequired Materials
- T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, the MIT Press, 2009, third edition.
Additional Resources
- Algorithm Design, J. Kleinberg and E. Tardos, Addison Wesley, 2006.
Grading
| Component | Weight |
|---|---|
| Final exam | 25% |
| Midterm exam | 20% |
| Project | 20% |
| Homeworks | 30% |
| Class participation | 5% |
CS Common Course Policies Include:
-
Rescheduling an Exam
-
Course Withdrawal
-
Disability Services
-
Academic Integrity
updated:
August 4, 2013
Fri Jan 16 16:36:39 EST 2015