CSCI 5620 - Analysis of Algorithms

(3 credits)

Prerequisites: Differential and integral calculus, discrete structures, data structures.

This course covers basic techniques for analyzing algorithmic complexity. It describes the design and analysis of selected algorithms for solving important problems that arise often in applications of computer science, including sorting, selection, graph theory problems (e.g., shortest path, graph traversals), string matching, dynamic programming problems, NP-complete problems.

When Offered: Fall, alternate years.

View the Fall 2024 Schedule of Classes

View the Spring 2025 Schedule of Classes