Go to Main Content
 

HELP | EXIT

Detailed Course Information

 

Spring 2013 Semester
Apr 21, 2014
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

CS 5800 - Algorithms
Presents the mathematical techniques used for the design and analysis of computer algorithms. Focuses on algorithmic design paradigms and techniques for analyzing the correctness, time, and space complexity of algorithms. Topics may include asymptotic notation, recurrences, loop invariants, Hoare triples, sorting and searching, advanced data structures, lower bounds, hashing, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness. Prereq. Admission to MS program or completion of all transition courses.
4.000 Credit hours
4.000 Lecture hours

Levels: Graduate
Schedule Types: Lecture

Computer Science Department

Course Attributes:
GSCS Computer & Info Science

Restrictions:
Must be enrolled in one of the following Levels:     
      Graduate
Must be enrolled in one of the following Classifications:     
      Graduate

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4