CSCI 3070U – Analysis and Design of Algorithms

This course exposes students to the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. It provides students with the expertise to analyze the cost of solving a specific problem with a given algorithm. Classical algorithms are analyzed in detail and their relative performance (depending on the size of the problem) predicted. Generic efficient techniques such as recursion divide and conquer, greedy strategies and branch and bound are studied and their relative costs identified. Such a toolbox of effective techniques is necessary for the design and analysis of realistic algorithms to solve important problems in all application areas.
Credit hours: 3
Lecture hours: 3
Tutorial hours: 2
Prerequisite(s): CSCI 2010U and CSCI 2110U
Credit restriction(s): SOFE 3770U