20-CS-472 - Analysis of Algorithms II
Electrical Engineering and Computing Systems
|
||||
Registration Data
Credit Level: U. Credit Hrs: 3.00. |
||||
Logistics
Meets: 10:00-10:50, MWF, Baldwin 643 |
||||
Course DescriptionFurther introduction to the study of algorithms. Analysis of computing time, asymptotic notation and generating functions. Strategies for designing algorithms: Divide-and-conquer, Greedy method, Backtracking, etc. Further topics such as techniques for algebraic manipulations, lower and upper bound theory, NP-Complete problems, and parallel algorithms. |
||||
KeywordsDivide-and-Conquer, Greedy Algorithm, matroids, backtracking, Branch-and-Bound, Stochastic Local Search, complexity classes, NP-complete, NP, P, logic algorithms, Binary Decision Diagrams, probabilistic algorithm, lower bounds, upper bounds, probabilistic analysis. |
||||
AddendumThere are numerous sources of material on which the lectures will be based. Most of those are posted on the course website. The texts referred to here also contain much information. It is not required that any of these texts be purchased but it is highly recommended. There are many other great sources of information in this area and the student is encouraged to seek out such material independently. |
|
|
|
|
|
|