CS610 Handouts (Fall 2019)

Copyright by A. Gerbessiotis (2006-2020). All rights reserved.

B1. Programming Project, Problem Sets, and Exams


B2. Handouts

B2a. Syllabus and Course FAQ

B2b. Other Course Handouts


B3. Other Reference Material

You may find the following material useful, as far as the coverage of asymptotic growth of functions and recurrences are concerned.
  1. Mathematics for Computer Science (2015/5/18 version) by E. Lehman, F. T. Leighton, A. R. Meyer.
  2. Introduction to Algorithms (third edition) by B. Cormen, C. Leiserson, R. Rivest, and C. Stein, MIT-Press. (The previous edition was published by McGraw-Hill.)
  3. Computer Algorithms: Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Addison Wesley.
  4. Data Structures and Algorithms with Object-Oriented Design Patterns in Java by B. Press, Wiley.

Last modified Aug 20, 2019, 20:19