| |
Nov 24, 2024
|
|
|
|
|
CSC 204 - Algorithm Design and Analysis
Semester Hours: 3
Periodically
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.
Add to Personal Catalog (opens a new window)
|
|