Fall 2010 Data Structures and Algorithms II
Computer Science, as COSC-30 Faculty Catherine C. McGeoch (Section 01) Description
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.
Course times and locations COSC 30 - L/D 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 Textbooks
Below are the textbooks used in this course, along with pricing information and availability at local bookstores. The price range shown is based upon queries to multiple online booksellers; roll your mouse over the price field to see detailed pricing information.
This is preliminary information about books for this course. Wait for this message to go away, or contact your instructor, before attempting to purchase these books.
ISBN Title Publisher Author(s) Book Store Price
9780262533058 Introduction to Algorithms, Third Edition The MIT Press Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Amherst Books $28.31-$163.95
These books are available locally at
Amherst Books. Offerings 2013-14:
Fall 2013 Other years:
The required text for this course is the one by Cormen et. al that you used in CS20.