Skip to main content (Press Enter)
Undergraduate Course

CISC 365 - Algorithms I

Description

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.

Follow-On Courses

This course appears in the pre- or co-requisites for the following course(s):

Learning Hours

120 (36L;84P)

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).

External Links

Back to top