Design and Analysis of Algorithms

Catalog description

The fundamentals of designing computer algorithms are introduced. An overview of advanced data structures such as balanced trees, heaps and hash tables is presented. A discussion of algorithm design techniques will include, but not be limited to sorting and ordering, divide and conquer, shortest path and dynamic programming. The complexity of algorithms to various applications is discussed. Prerequisite Course(s): Prerequisite: CSCI 260 Classroom Hours - Laboratory and/or Studio Hours – Course Credits: 3-0-3