CSC 421 - Algorithms

4 Hour(s)
This course teaches essential strategies of algorithm design and analysis, including topdown design, divide and conquer, average and worst-case criteria, and asymptotic costs. Simple recurrence relations for asymptotic costs and choice of appropriate data structures such as arrays, lists, stacks, queues, trees, heaps, priority queues, graphs, hash tables may also be covered. Applications to sorting and searching, graph algorithms, matrix algorithms, shortest-path and spanning tree problems, and discrete optimization algorithms such as dynamic programming and greedy algorithms are also stressed.

Prerequisite(s): CSC 226