|
Mar 29, 2024
|
|
|
|
COS 485 - Design and Analysis of Computing Algorithms An introduction to the design and analysis of algorithms. Techniques for designing algorithms, such as divide-and-conquer, greedy method, dynamic programming, and backtracking are emphasized and illustrated. Many problems of practical importance are covered including: minimum spanning tree, single source shortest path, traveling salesperson, and graph search. The concepts of NP-completeness are also considered. Substantial programming in a high-level language.
Prerequisite(s): Grade of C or higher in COS 285 . Co-requisite(s): Credits: 3
Course Typically Offered: Spring Course Type: Computer Science
Add to My Catalog Bookmarks (opens a new window)
|
|