UNB/ CS/ David Bremner/ teaching/ CS3383, Algorithm Design and Analysis, Winter 2018


Professor David Bremner
Office Gillin C115
Office Hours hours
Phone 447-3300
Email 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



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 ).

Text and reference material.


You must pass the final exam to get more than a D in the course.

Component percent
2 midterms 30
assignments 20
final 50

Course Policy

Course Content


Printable Version