CS435 Handouts (Spring 2017) Copyright by A. Gerbessiotis (2006-2017). All rights reserved.

B1. Mini-Project and Exams

Bonus Points Do you want to collect 20 bonus points? Fill in and submit this CS435 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.
Clarification for Mini-Project(s) The deadline is firm. If we do not RECEIVE your assignment before noon the day it is due a point penalty will be deducted : see Handout 1 for more details or the Rules of the MP. The assignments are posted on the first day of the semester for a reason: DO NOT BE LATE.

Before you do the MP read Handout 2 below.

Handout 0 (Frequently asked questions). Note that the password of the protected page is missing (available only in the hard copy to be handed out on the first day of classes). (**** Uploaded on 01/10/2017 ****)
Handout 1 (CS435 Syllabus Information). (**** Uploaded on 01/10/2017 ****) CS435 Syllabus in HTML. (**** Uploaded on 01/10/2017 ****)

Handout 2 (Programming Guidelines). (**** Uploaded on 01/03/2017 ****)
Handout 3 (Computer Science Fundamentals). (**** Uploaded on 01/10/2017 ****)
Handout 4 (Red-black tree operations). (**** Uploaded on 01/03/2017 ****)

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.
Data Structures and Algorithms in Java by M. T. Goodrich and R. Tamassia, Wiley.
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.