Logistics
| Professor | David Bremner | |
| Office | ITC321 | |
| Phone | 506-447-3300 | |
| Instructor Email | bremner AT unb.ca | preferred |
| Lectures | MWF 13:30-14:20 GWD124 |
| Tutorial | F 8:30-09:20 SL107 |
| Professor | David Bremner | |
| Office | ITC321 | |
| Phone | 506-447-3300 | |
| Instructor Email | bremner AT unb.ca | preferred |
| Lectures | MWF 13:30-14:20 GWD124 |
| Tutorial | F 8:30-09:20 SL107 |
Office hours for Fall 2022 to be determined.
For times when I might be available, look for blank spots in my public schedule
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.
CS 2333, ( CS2383 or CS3323 ), and ( STAT2593 or STAT3083 ).
The textbook for the course is Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein, fourth edition.
A secondary reference for the course is Algorithms by Dasgupta, Papidimitriou and Vazirani. Some of the examples and ways of talking about some topics come from there.
Another secondary reference for the course is the book / lecture notes by Jeff Erickson: https://jeffe.cs.illinois.edu/teaching/algorithms/
| number | weight | subtotal | |
|---|---|---|---|
| Written Assignments | 6 [*] | 2.5% | 15% |
| Online Quiz | 4 [*] | 1.25% | 5% |
| Class tests | 2 | 15% | 30% |
| Final | 1 | 50% | 50% |
*: the number of assignments and online quizzes is subject to adjustment, but the total contribution to the final will mark will remain 20%
Example code
Jeff Erickson's notes on induction and solving recurrences