Analysis of Algorithms (COMP 2080) and Data Structures and Algorithms (COMP 2140). Students are expected to be familiar with intermediate topics in design and analysis of algorithms, data structures, and discrete mathematics (including sorting,
searching, big Oh notation, trees, and hash tables) and introductory concepts in logic, set
theory, algebra, calculus, and graph theory.
Course Goals and Intended Learning Outcomes:
This course exposes students to
fundamentals of algorithm design and analysis. By the end of this course, students are expected to be able to:
understand and quantify why one algorithm is better than another
apply classic algorithms to specific problems which can benefit from them
utilize general techniques and design methods to introduce and analyze algorithms for different problems
recognize NP-complete and undecidable problems.
The following book is required and is available at the University of Manitoba
The following books are useful references available on reserve at the Sciences and Technology
Algorithms and Data Structures, by Mehlhorn and Sanders, Springer, 2008.
The Algorithm Design Manual, second edition, by Skiena, Springer, 2008.
Advanced Data Structures, by Brass, Cambridge, 2008.
Most Springer publications are available online at SpringerLink through the University of
COMP 3170 is a course on analysis of data structures and algorithms.
Students will learn new techniques for solving fundamental algorithmic problems efficiently.
Possible topics to be covered include: