# Introduction to Algorithms

## Computer Science 280

##### Usual Description

Students will be introduced to algorithm design and analysis, with an emphasis on applications to real-life problems arising in computing applications. Students will study the basic design techniques of the field from a theoretical perspective and learn how to apply these techniques to solve problems in simple, efficient ways. Computational complexity focusing on NP-completeness, and algorithmic techniques for intractable problems are also covered. Knowledge of discrete mathematics is necessary.

##### Themes

##### Course Listings

These are all of the listings of this course recorded in the Oberlin course catalog since the fall of 2007.

Listing | Semester | Professor | |
---|---|---|---|

Computer Science 280 | Taught by Robert Bosch | ||

Computer Science 280 | Taught by Thomas Wexler | ||

Computer Science 280 | Taught by Thomas Wexler | ||

Computer Science 280 | Taught by Alexa Sharp | ||

Computer Science 280 | Taught by Alexa Sharp | ||

Computer Science 280 | Taught by Tom Wexler | ||

Computer Science 280 | Taught by Alexa Sharp | ||

Computer Science 280 | Taught by Alexa Sharp | ||

Computer Science 280 | Taught by Tom Wexler | ||

Computer Science 280 | Taught by Tom Wexler | ||

Computer Science 280 | Taught by Alexa Sharp |