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. Restricted to students in the College of Computer and Information Science and in the network science program.
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 Majors: Computer Science Data Science Information Assurance Information Resources Mgmt Network Science Personal Health Informatics Must be enrolled in one of the following Classifications: Graduate |

Return to Previous | New Search |