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.
Cross Listed Courses
CPE 590
Prerequisite
CS 570 and a Graduate Student
Distribution
Computer Engineering Program
Computer Science ProgramOffered
Fall Semester
Spring Semester
Summer Session 1