COMP 431
3 credits
Algorithms for Engineers

Computer Science (Sci): Advanced data structures: heaps, binary search trees, graphs, algorithmic analysis: space-time analysis, worst-case and expected complexity. Examples of searching sorting and merging. Algorithm design: divide-and-conquer, dynamic programming, greedy methods, backtracking. Algorithms: set manipulation, tree traversals. Memory management: hashing, dynamic storage allocation and garbage collection.

Offered by: Computer Science