BCS 340: Introduction to Algorithms

This course provides an introduction to efficient solutions for a variety of algorithmic problems commonly encountered in application programming. Problems are discussed and students are guided through the discovery of progressively more efficient solutions. Areas to be discussed may include trees, graphs, sorting, searching, and testing. Advanced techniques, including recursion, dynamic programming, greedy algorithms and parallel programming may be used to solve some of the problems. Small programming assignments will be required to illustrate an understanding of the details of the algorithms. Credits: 3.0

Prerequisite

BCS 230 with a grade of C or higher

Textbook(s)

• The Algorithm Design Manual 2nd Edition by Steven S Skiena, Springer, ISBN-13: 978-1848000698