UNB/ CS/ David Bremner/ teaching/ CS3383-FR01B, Algorithm Design and Analysis, Winter 2013

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 12:30-13:20 ITC317
Tutorial T 13:00-13:50 GWC111

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.

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
3 class tests
  30 
assignments
  20 
final
  50 

The 3 class tests are scheduled for 2012-01-30, 2012-02-27, 2012-03-25.

Course Policy

Assignments

Tests

Class Test 1
Wed 30 Jan 2013 12:30:00 PM AST

Class Test 2
Wed 27 Feb 2013 12:30:00 PM AST

Class Test 3
Mon 25 Mar 2013 12:30:00 PM ADT

Final Exam
Tue 16 Apr 2013 09:00:00 AM ADT

Resources

Printable Version