CS 350 - Algorithms and Complexity

 

Instructor: Daniel Leblanc

Email: dleblanc [at] pdx .edu

Lectures: MW 08:15 - 10:05 EB 103

Office Hours: By Appointment


COURSE DESCRIPTION

Introduces the fundamentals of algorithm design and analysis. Asymptotic analysis of running time and space requirements. provides a variety of techniques useful for approaching problems.

Prerequisites: CS 250 and 251

Textbook: Introduction to the Design and Analysis of Algorithms 3rd Ed by Anany Levitin (Recommended)