Contact | Books | Objective | Grading | Materials
Welcome to the CS383 homepage for Spring 2013! You may use the menu options above to find your way around, if you'd rather not scroll.
What this course is about
This course focuses on the time and memory requirements of the
algorithms (procedures) that are embodied in computer programs.
We will discuss both analysis of existing algorithms
as well as design of new algorithms with a view toward
achieving efficient computational procedures.
Course topics include divide and conquer design, fundamental data
structures, asymptotic notation, analysis of recurrence relations,
greedy algorithms, search, and dynamic programming.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms (3rd Edition), The MIT Press, 2009. (available in the electronic library at BC)