Master of Computer Science (MCSc) - Algorithms I CSCI 3110   Algorithms I
This course covers techniques for the design and analysis of efficient algorithms and data structures. Topics include asymptotic analysis, divide and conquer algorithms, greedy algorithms, dynamic programming, data structure design, optimization algorithms, and amortized analysis. The techniques are applied to problems such as sorting, searching, identifying graph structure, and manipulating sets.
PREREQUISITES: CSCI 2110.03 and CSCI 2115.03