Save To Worklist Outline/Syllabus

EECE 320 Discrete Structures and Algorithms

Discrete structures, such as trees and graphs, and their properties; introduction to algorithms and algorithmic complexity. Proof of correctness; design techniques such as greedy algorithms and dynamic programming. Credit will be granted for only one of EECE 320 or CPSC 320.

This course is not eligible for Credit/D/Fail grading.

Credits: 4

Pre-reqs: One of CPSC 260, CPSC 221.

Equivalents: CPSC 320

No sections offered for 2017 Winter.