Welcome to the CS 5114: Algorithms home page!
Instructor: Dr. Lenwood Heath
- Office: 638 McBryde Hall
- Office Hours: Wednesdays, 10-12; Fridays 9-11
- Email: email@example.com
GTA: Mir Farooq Ali
This course emphasizes the computational complexity of a problem,
the efficiency of an algorithm for solving a problem, techniques
for designing algorithms, and the inherent intractability of certain
problems. Skills that the student will take away from this course include:
- Determining whether a problem is NP-complete,
- Analyzing the time complexity of an algorithm, and
- Applying techniques for designing efficient algorithms.
The course meets in McBryde 210 on Tuesdays and Thursdays from 12:30 until
1:45 in the afternoon. The prerequisite (recommended, but not required) for
the course is CS 4104 or an equivalent. The required textbook is Introduction
to Algorithms, by Cormen, Lieserson, and Rivest (which we will refer to
The Honor Code applies. All work submitted must be the student's own work.
Students may solicit help only from the instructor or the teaching assistants.
If any student needs special accommodations because of a disability, please
contact the instructor during the first week of classes.
5114: Algorithms - Fall 2000
2000 Dept. of Computer Science