CS 5310 - Algorithms

This course is a continuation of the study of data structures and algorithms, emphasizing methods useful in practice. It provides a theoretical foundation in designing algorithms as well as their efficient implementations. The focus is on the advanced analysis of algorithms and on how the selections of different data structures affect the performance of algorithms. Topics covered include: sorting, search trees, heaps, and hashing; divide-and-conquer; dynamic programming; backtracking; branch-and-bound; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; and parallel computing. It comprises four hours of lecture and recitation experience every week.

Prerequisites/Corequisites: Prerequisite: CS 3310 with a grade of “C” or better.

Credits: 3 hours

Notes: Open to upperclass and graduate students.