Listed in: Computer Science, as COSC-301
Formerly listed as: COSC-21 | COSC-30 | COSC-31
This course continues the exploration of data structures and algorithms that is begun in COSC 201. 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: COSC 112 and 201. Fall semester. Professor L. McGeoch.
Section 01
M 12:00 PM - 12:50 PM SMUD 206
W 12:00 PM - 12:50 PM SMUD 206
Th 12:00 PM - 12:50 PM SMUD 206
F 12:00 PM - 12:50 PM SMUD 206
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.