1996-97
Department of Computer Science

Course directors:
A. Mirzaian (Fall)
J. Edmunds (Winter)
Implementation details

COSC 3101.03 Design and Analysis of Algorithms

Section A  Fall 	Tue, Thu 16:00-17:30
Section M  Winter	Tue  19:00-22:00

This course is intended to teach students the fundamental techniques in the design of algorithms and the analysis of their computational complexity. Each of these techniques are applied to a number of widely used and practical problems. At the end of this course, a student will be able to: choose algorithms appropriate for many common computational problems; to exploit constraints and structure to design efficient algorithms; and to select appropriate tradeoffs for speed and space. Various program animation softwares may also be used as an interactive pedagogical tool in the course.

Topics covered may include the following.

Texts: t.b.a.

Suggested reading:

Prerequisites: general prerequisites, including MATH2320.03 (SCS students may enrol without MATH2320.03 or concurrently with MATH2320.03)