UNB/ CS/ David Bremner/ teaching/ CS3383, Algorithm Design and Analysis, Fall 2020

Logistics

Professor David Bremner
Office ITC321 Out of the office for Fall 2020 Term.
Phone 506-447-3300 untested
Instructor Email bremner AT unb.ca preferred

Lectures MWF 13:30-14:20 (online)
Tutorial F 8:30-09:20 (online)

Office Hours

For winter 2021, my office hours are by appointment. Send me an email with a few times that work for for you, and we can set up a teams call (or something else, if you're external to UNB).

For times when I might be available, look for blank spots in my public schedule

url-qr.png

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.

Evaluation

number weight subtotal
Assignments 12 2% 24%
Quizzes 11 5% 55%
Participation 12 0.5% 6%
Final 1 15% 15%

Course Policy

Course Content

Resources

Printable Version