Submitted by Catherine C. McGeoch
on Wednesday, 8/25/2010, at 12:13 PM
The required text for this course is the one by Cormen et. al that you used in CS20.
Listed in: Computer Science, as COSC-30
Catherine C. McGeoch (Section 01)
This course continues the exploration of data structures and algorithms that is begun in Computer Science 20. Topics include balanced search trees, amortized algorithms, graph data structures and algorithms, greedy algorithms, dynamic programming algorithms, NP completeness, and case studies in algorithm design.
Requisite: Computer Science 12 and 20. Fall semester. Professor C. McGeoch.
Section 01
M 10:00 AM - 10:50 AM SMUD 207
W 10:00 AM - 10:50 AM SMUD 207
F 10:00 AM - 10:50 AM SMUD 207
This is preliminary information about books for this course. Please contact your instructor or the Academic Coordinator for the department, before attempting to purchase these books.
| ISBN | Title | Publisher | Author(s) | Comment | Book Store | Price |
|---|---|---|---|---|---|---|
| Introduction to Algorithms | Cormen, Leiserson, Rivest, Stein | Amherst Books | TBD |
These books are available locally at Amherst Books.
The required text for this course is the one by Cormen et. al that you used in CS20.