UNB/ CS/ David Bremner/ teaching/ cs3383/ header

Logistics

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 HC11
Tutorial F 8:30-9:30 H102

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

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

Component percent
2 class tests
  30 
assignments
  20 
final
  50