SOFE 3770U – Design and Analysis of Algorithms

Designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; sort algorithms; priority queues; medians and order statistics; data and advanced data structures; augmenting data structures for custom applications; dynamic programming; greedy algorithms; graph algorithms; sorting networks; matrix operations; linear programming; number theoretic algorithms; string matching; NP-completeness and approximation algorithms; object libraries.
Credit hours: 3
Lecture hours: 3
Tutorial hours: 1.5
Prerequisite(s): ELEE 2110U, SOFE 2715U, MATH 1850U