|
Mar 28, 2024
|
|
|
|
2009-2010 Undergraduate Catalog [Archived Catalog]
|
CS 417 - Advanced Algorithms and Their Complexity Covers basic algorithm techniques (such as divide and conquer, greedy algorithms, and dynamic programming) as well as probabilistic algorithms and other optimization techniques. Searching, sorting, hashing, string pattern matching and graph algorithms will be examined and analyzed, and many different approaches will be presented for determining the fastest possible problem solving strategy for a significant number of diverse applications.
Prerequisites: CS 211, MA 208
Credits: 3 cr.
|
|