Queen's University Logo

Algorithms I [CISC 365]

Algorithms I


LEARNING HOURS: 120 (36L;24Lb;60P)

Principles of design, analysis and implementation of efficient algorithms. Case studies from a variety of areas illustrate divide and conquer methods, the greedy approach, branch and bound algorithms and dynamic programming.

PREREQUISITE: CISC 203/3.0 and CISC 204/3.0 and CISC 235/3.0.