CS 415 - Algorithm Analysis

Unit(s): 4 Lecture: 4 hours

This course provides a systematic approach to the design and analysis of algorithms with an emphasis on efficiency. Topics include algorithms for searching and sorting, hashing, exploring graphs, and integer and polynomial arithmetic. Foundations in recurrence relations, combinatorics, probability, and graph theory as used in algorithm analysis are covered. Standard design techniques such as divide-and-conquer, greedy method, dynamic programming, heuristics, and probabilistic algorithms along with NP-completeness and approximation algorithms are included.

Prerequisite(s): Grade of C- or better in CS 315, or consent of instructor.
Grading: GRD