Close Menu

CS 406 - Introduction to Discrete Structures and Algorithms

Course Description: 

This course will provide students with an understanding of some basic discrete mathematics and techniques for designing computer algorithms and measuring and analyzing their behavior. We emphasize the necessary mathematical ideas such as how to prove a mathematical statement, how to analyze the worst case and the average case complexity of an algorithm. We also introduce students to some new techniques used in designing algorithms, such as the approximation algorithms and randomized algorithms.

Credit: 

(3-0-3)

Prerequisite: 

None

Corequisite: 

None