CSCI 160 - Algorithms

Type of Course: Lecture, Discussion, Laboratory
Emphasizes how the design of algorithms is supported by advanced data structures such as sets, trees, and graphs. Applications to searching and sorting are discussed. Topics include: design and analysis of algorithms, general trees, balanced trees, priority queues, hash tables, merge-sort, quick-sort, radix sorting and searching, and elementary graph algorithms. Programming projects are assigned for the laboratory component.

Prerequisites: Prerequisites for this course require a grade of C or better in CSCI 121  and MATH 114 .


This course information is from the 2011-2012 Academic Catalog. View this catalog.
Print this page.