| |
Oct 17, 2026
|
|
|
|
|
2026-2027 University Catalog
|
CS 58000 - Algorithm Design, Analysis, And Implementation
Credit Hours: 3.00. Basic techniques for designing and analyzing algorithms: dynamic programming, divide and conquer, balancing. Upper and lower bounds on time and space costs, worst case and expected cost measures. A selection of applications such as disjoint set union/find, graph algorithms, search trees, pattern matching. The polynomial complexity classes P, NP, and co-NP; intractable problems.
Learning Outcomes
1. Be familiar with topics in algorithms. 2. Be familiar with how to design algorithms. 3. Master a subset of algorithms: graph algorithms, linear programming. 4. Be familiar with how to research the background of a topic in algorithms approximation algorithms.
Credit Hours: 3.00
|
|