CS 315 - Design and Analysis of Algorithms
4 semester hours
The design, implementation, testing and analysis of various
algorithms. Methods such as divide and conquer, dynamic programming
as applied to problems in sorting, sets, trees and graphs will be
studied. The analysis of algorithms, including questions of
correctness, efficiency and complexity, will be studied.
Prerequisites: CS 171, MAT 165, MAT 181