|
|
|
|
Home |
Algorithms Design and Analysis (0306352)
Time and Place
The lectures take place at Sunday through Thursday, 11:00-12:30 in 124D.
Description (PDF)
Principles and Examples of Analyzing Algorithms and Problems.
Sorting Algorithms.
Selection and Adversary Arguments..
Graph Algorithms.
String Matching.
Dynamic Programming.
Polynomials and Matrices.
NP-Complete Problems.
Parallelism.
References
Sara Baase, "Computer Algorithms: Introduction to Design and Analysis", 3rd edition, 2000, Addison Wesley.
A. Aho, J. Hopcraft, and J Ullman, "The Design and Analysis of Algorithms", 1974, Addison Wsdley.
R. Sedgewich, "Algorithms", 1988, Addison Wesley.
|
|
Home |