CSCI 3110.03: Design and Analysis of Algorithms I.
This class 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.
Computer Science Department Page
Dalhousie Academic Calendar Home
Registrar's Office Home
Dalhousie University's Home