|bremner ATSIGN unb.ca|
|Lectures||MWF 12:30-13:20 ITC317|
|Tutorial||T 13:00-13:50 GWC111|
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.
CS 2333, ( CS2383 or CS3323 ), and ( STAT2593 or STAT3083 ).
Text and reference material.
The main textbook for the course is Algorithms by Dasgupta, Papidimitriou and Vazirani.
A good reference on algorithms is Introduction to Algorithms by Corman, Leiserson, Rivest and Stein.
Another valuable resource is the collection of algorithms course materials by Jeff Erickson: http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/
You must pass the final exam to get more than a D in the course.
|3 class tests||
The 3 class tests are scheduled for 2012-01-30, 2012-02-27, 2012-03-25.