Data Structures and Algorithms - II

Catalog description

This course describes in depth the algorithm analysis techniques, asymptotic notations, worse-case analysis, greedy algorithms, divide and conquer algorithms, dynamic programming algorithms, graph algorithms, and NP-completeness. This course also covers heaps, heap sort, and priority queues. Prerequisites: A grade of C or better in CMPT 238 .