4005-800-70 Theory of Computer Algorithms
Course Description and Outcomes

Catalog Description
Prerequisites
Outcomes

A study of techniques to design and analyze the complexity of algorithms. The course will make students aware of a large number of classical algorithms and their complexity and will introduce the area of NP-completeness. Programming projects will be required.

• Algorithms and Data Structures
• Discrete Mathematics (4003-705 or 1016-265)
• Java programming ability

• The student will be able to theoretically predict computer algorithm characteristics such as storage and run time.
  Evaluation: Homework assignments, exams
   
• The student will be able to experimentally measure computer algorithm characteristics such as storage and run time.
  Evaluation: Programming project
   
• The student will be able to evaluate different alternative algorithms for solving a computer programming problem and will be able to pick the best algorithm for an application.
  Evaluation: Homework assignments, programming project
   
• The student will be able to design an application programming interface (API) for any category of computer algorithms and will be able to implement the API with multiple alternative algorithms.
  Evaluation: Homework assignments, programming project
   
• The student will be familiar with a variety of classical computer algorithms and their characteristics.
  Evaluation: Homework assignments, exams
   
• The student will have a basic understanding of complexity theory and the concept of an NP-complete problem.
  Evaluation: Homework assignments, exams

Theory of Computer Algorithms 4005-800-70 Winter Quarter 2003

Course Page

Alan Kaminsky • Department of Computer Science • Rochester Institute of Technology • 4486 + 2220 = 6706

Home Page

Copyright © 2003 Alan Kaminsky. All rights reserved. Last updated 02-Dec-2003. Please send comments to ark­@­cs.rit.edu.