Logistics
| Professor | David Bremner |
| Office | Gillin C115 |
| Office Hours | hours |
| Phone | 447-3300 |
| bremner ATSIGN unb.ca | |
| Web | http://www.cs.unb.ca/~bremner/teaching/cs3383 |
| Lectures | MWF 13:30-14:20 ITC317 |
| Tutorial | W 9:30-10:20 GC127 |
Overview
The basics of asymptotic analysis will be reviewed. A variety of different algorithm design techniques, including divide and conquer, greedy, dynamic programming, and backtracking, will be introduced and compared. Randomized algorithms and multithreaded algorithms will be introduced.
Prerequisites
CS 2333, ( CS2383 or CS3323 ), and ( STAT2593 or STAT3083 ).
Text and reference material.
The primary textbook for the course is Algorithms by Dasgupta, Papidimitriou and Vazirani.
A secondary reference for the course is the lecture notes by Jeff Erickson: http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/
A good reference on algorithms is Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein. The UNB library has unlimited access to this as an eBook.
Evaluation
You must pass the final exam to get more than a D in the course.
| Component | percent | ||
|---|---|---|---|
| 2 midterms | 30 | ||
| assignments | 20 | ||
| final | 50 | ||