CS 315 - ALGORITHM DESIGN AND ANALYSIS

College of Engineering

Credit(s): 3

Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Algorithms and advanced data structures for searching and sorting lists, graph algorithms, numeric algorithms, and string algorithms. Polynomial time computation and NP-completeness.

Prereq: CS 215, CS 275, and engineering standing.