CISC 365 Algorithms I Units: 3.00
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.
Learning Hours: 120 (36 Lecture, 84 Private Study)
Requirements: Prerequisite Registration in a School of Computing Plan and a minimum grade of a C- (obtained in any term) or a 'Pass' (obtained in Winter 2020) in (CISC 203 and CISC 204 and CISC 235).
Offering Faculty: Faculty of Arts and Science