|
COMP 3170 - Analysis of Algorithms and Data Structures
COMP 3170:
Algorithms and data structures for sorting, indexing and searching;
correctness and algorithm analysis; lower bounds and intractability.
instructor: Steph
Durocher
office hour: Monday at 9:30 am and Tuesday at 10:30 am in EITC E2-412.
lectures: Monday, Wednesday, and Friday 10:30 am to 11:20 am in EITC E2-130.
This calendar lists course-related events for COMP 3170:
Prerequisites
The formal course requirements are:
-
a second-year undergraduate course in data structures and algorithms
COMP 2140
-
a second-year undergraduate course in analysis of algorithms
COMP 2080
It is recommended for students to have completed:
-
a second-year undergraduate course in discrete mathematics
COMP 2130
-
a first-year undergraduate course in calculus
MATH 1500
Textbook
The following textbook is required material:
Introduction
to Algorithms, third edition, by Cormen, Leiserson, Rivest, and Stein,
MIT Press 2009.
(umanitoba ebook
link)
This is an excellent reference which you will use long after completing
this course. Soft and hardcover copies are available from the university
bookstore.
Topics Covered
Topics will include a subset of:
- selection
- balanced search trees
- skip lists
- amortized analysis
- computational complexity
- approximation algorithms
- lower bounds
- mergeable heaps
- graph algorithms
- randomized algorithms
- string matching
See this course outline for
a more detailed course description.
|
|
Announcements
The final exam will be held 9:00 am - 12:00 pm on Saturday, April 16, 2016, in
EITC E2-229.
last updated April 8, 2016
Important Dates
Apr 8 | classes end |
Apr 11-25 | exam period |
Apr 16 | final exam |
|
|