CS 590 Algorithms

This is a course on more complex data structures, and algorithm design and analysis, using one or more modern imperative language(s), as chosen by the instructor. Topics include: advanced and/or balanced search trees; hashing; further asymptotic complexity analysis; standard algorithm design techniques; graph algorithms; complex sort algorithms; and other "classic" algorithms that serve as examples of design techniques.

This is a Pathways Program Bridge Course. Students in the traditional Computer Science Master's Program (not the Pathways Program) can only take this course in their first semester. 



Cross Listed Courses

CPE 590


CS 570 and Graduate Student


Computer Engineering Program Computer Science Program

Typically Offered Periods

Fall Semester Spring Semester Summer Session 1