Save To Worklist

CPSC 320 Intermediate Algorithm Design and Analysis

Systematic study of basic concepts and techniques in the design and analysis of algorithms, illustrated from various problem areas. Topics include: models of computation; choice of data structures; graph-theoretic, algebraic, and text processing algorithms.

This course is eligible for Credit/D/Fail grading. To determine whether you can take this course for Credit/D/Fail grading, visit the Credit/D/Fail website. You must register in the course before you can select the Credit/D/Fail grading option.

Credits: 3

Pre-reqs: Either (a) CPSC 221 or (b) all of CPSC 260, EECE 320. (In addition to above pre-requisites, at least 3 credits from COMM 291, BIOL 300, MATH or STAT at 200 level or above.)

Equivalents: EECE 320


Status Section Activity Term Interval Days Start Time End Time Comments
Full CPSC 320 921 Lecture 2 Mon Wed Fri 9:30 12:00
Full CPSC 320 T9A Tutorial 2 Wed Fri 12:30 13:30
Full CPSC 320 T9B Tutorial 2 Wed Fri 13:30 14:30
  CPSC 320 T9C Tutorial 2 Wed Fri 14:30 15:30
  CPSC 320 T9D Tutorial 2 Wed Fri 15:30 16:30
  CPSC 320 9W1 Waiting List 2 Mon Wed Fri 9:30 12:00