COMP 2080 - Analysis of Algorithms
COMP 2080:
Methods of analyzing the time and space requirements of algorithms,
average case and worst case analysis, models of computation
instructor: Steph
Durocher
office hour: Tuesday 2:30 pm to 3:30 pm in EITC E2-412
lectures: Tuesday and Thursday 11:30 am to 12:45 pm in Education 224
This calendar lists course-related events for COMP 2080:
Prerequisites
The formal course requirements are as follows. Student must have completed
the following courses with a minimum grade of:
-
C or higher in an undergraduate course in discrete mathematics
(COMP 2130
or MATH 1240)
-
C or higher in an undergraduate course in data structures
and algorithms
(COMP 2140)
It is recommended for students to have completed:
-
an undergraduate course in statistics
(STAT 1000)
Textbook
The following textbooks are recommended:
Algorithms,
by Dasgupta, Papadimitriou, and Vazirani. McGraw Hill, 2006.
Introduction
to Algorithms, third edition, by Cormen, Leiserson, Rivest, and Stein.
MIT Press, 2009.
(umanitoba ebook
link)
Cormen et al.
is an excellent reference which you will use long after completing
this course (including in COMP 3170 and COMP 4420).
Copies should be available from the university bookstore.
Topics Covered
Topics will include:
- analysis of algorithms
- asymptotic notation
- recurrence relations
- greedy algorithms
- divide and conquer algorithms
- dynamic programming
See this course outline for
a more detailed course description.
|