CSCI 365 - Advanced Algorithms

3 NS
First Semester. An examination of the traditional design of sequential algorithms, and the theoretical basis behind the different approaches. Topics will be selected from: divide and conquer, greedy and dynamic approaches to algorithmic design; Master’s theorem and algorithmic analysis; sorting and searching; graph algorithms; flow algorithms; string matching; computational geometry.

Prerequisites & Notes
Prerequisites: MATH 220 and CSCI 280 or consent of the instructor.
Staff

Next offered 2006-2007.

Credits: 3 hours