CS610 Handouts (Spring 2017)
Copyright by A. Gerbessiotis (2006-2017). All rights reserved.
B1. Programming Project, Problem Sets, and Exams
- Bonus Points Do you want to collect 20 bonus points? Fill in and submit
this CS610 FORM no later than 18:00 of the third Friday of the semester.
- Problem Sets with solutions are periodically posted in the protected
area, not here. Practice with them.
Exams and some solutions (including past exams) are also in the protected area
(aka area C).
-
Programming Project (aka Homework, Programming Assignment).
(**** 01/03/2017 ****).
Before you do the programming project, read Handout 2 below.
If you don't and you get 0 points in the project, do not complain about the grade.
For due date(s), please check the syllabus or the project itself.
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.
-
Mathematics for Computer Science (2015/5/18 version) by E. Lehman, F. T. Leighton, A. R. Meyer.
- Introduction to Algorithms (second edition)
by B. Cormen, C. Leiserson, R. Rivest, and C. Stein, McGraw-Hill.
- Computer Algorithms: Introduction to Design and Analysis
by Sara Baase and Allen Van Gelder, Addison Wesley.
- Data Structures and Algorithms with Object-Oriented
Design Patterns in Java
by B. Press, Wiley.
Last modified Jan 10, 2017, 10:14