CSIS - 385. Design and Analysis of Algorithms

(2 hours lecture and 2 hours laboratory)
3 credit(s)
This course will cover algorithm design techniques such as divide-and-conquer, dynamic programming, greedy approaches, and space-time tradeoffs. Example algorithms illustrating these design techniques will be introduced and include such things as balanced search trees, heaps, graph algorithms (depth-first and breadth-first searches, minimum spanning trees and shortest paths), selection , and sorting algorithms (radix sort, heap sort, merge sort and quick sort). Asymptotic notations and techniques for analyzing the running times of these algorithms will be covered. Limitations of algorithm power will be discussed, including an introduction to NP-complete problems. Offered in spring semester.

Prerequisite(s): CSIS 210 and MATH 250 or CSIS 251.
Attribute: (ATTR: ARTS).