COM 304 - Algorithm Design and Analysis

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

COM 210
1 semester 3 credits.
Fall

Esse non videri — “To be, not to seem.”

Connect

BROOKLYN

LONG ISLAND

ONLINE

Engage

COM 304 - Algorithm Design and Analysis