CSC 204 - Algorithm Design and Analysis

Semester Hours: 3

This is a review of algorithm basics (Big-Oh, Big-Theta and Big-Omega notation), algorithms for searching, sorting (Mergesort, Quicksort, Heap Sort), median order statistic, hashing, priority queues, red-black trees, AVL trees, dynamic programming, amortized analysis, graph algorithms for shortest path problems, minimum spanning tree, min-cut and max-flow problems, and NP completeness.

Prerequisite(s)/Course Notes:
Course open to graduate students in computer science, others need permission from computer science graduate director. (Formerly Algorithms I: Sorting and Searching.)

Summer 2010 Offering:
SSII
70475: July 12-August 27; Distance Learning; Kamberova
Part II: This is a seven-week course for the master of science in computer science program.

View Course Offering(s):

Summer I 2025

Summer II 2025

Summer III 2025

Fall 2025