This course extends the study of algorithms introduced in CS-285. Topics include searching, sorting, selection, graph structures, and traversal algorithms. Applications such as dynamic memory management, data compression, optimization problems, and database indexing are also discussed. Laboratory activities include the implementation and comparison of problem-specific algorithms, as well as the use of generic algorithms from the C++ standard library. (prereq: CS-285, SE-280) (2-2-3)
On successful completion of this course, the student will:
The above course description and goals were taken from the official course description.
General Course Policies
Please review the general course policies webpage.
Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, McGraw-Hill, 1990.
A quiz will be given at the beginning of each lab period. The lowest quiz score will be dropped. No make-up quizzes will be given.
|Office: CC-27C, Phone: 277-7339|
|Last Updated: April 18, 2000|
© 2000 Dr. Christopher C. Taylor