---

CS 435 : Handouts

---

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

B1. Programming Assignments and Exams

• Bonus Points Do you want to collect 20 bonus points? Fill in and submit THIS FORM. no later than end of day (23:59 EDT) of the second Friday of the semester.

Problem sets with solutions are periodically posted in the protected area. You don't get credit for doing these problem sets!

• Clarifications for Programming Assignments
  1. PA1,2,3 Each one should be received one later than midnight the day Exam 1,2,3 are due respectively.

Before you do anyone of the programming assignments, read Handout 2 below (Section B2b), and download the code of Section B4 (one of items 1 or 2,3,4 for C++ or C programming), All programming assignments will be made available at the beginning of the semester. For due dates, please check the syllabus, page 2.

1. Programming Assignment 1 (to be received by Exam1 date) in Adobe Acrobat PDF. (**** Jan 19, 2011 ****).
2. Programming Assignment 2 (to be received by Exam2 date) in Adobe Acrobat PDF. (**** Jan 19, 2011 ****).
3. Programming Assignment 3 (to be received by Exam3 date) in Adobe Acrobat PDF. (**** Jan 19, 2011 ****).

B2. Handouts

B2a. Syllabus and Course FAQ

• Handout 0 (Frequently asked questions) in Adobe Acrobat PDF. 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). (**** Jan 10, 2011 ****)

1. Handout 1 (Syllabus Information) Adobe Acrobat PDF. (**** Jan 10, 2011 ****)

B2b. Other Course Handouts

2. Handout 2 (Programming Guidelines) in Adobe Acrobat PDF. (**** Jan 10, 2011 ****)
3. Handout 3 (Brief discrete math review) in Adobe Acrobat PDF. (amended) (**** Jan 10, 2011 ****)
4. Handout 4 (Brief notes on asymptotic notation and recurrences) in Adobe Acrobat PDF. (**** Jan 10, 2011 ****)
5. Handout 5 (Red-black tree operations) in Adobe Acrobat PDF. (**** Jan 10, 2011 ****)
6. Handout 6 (Examples of Red-black tree operations) in Adobe Acrobat PDF. (**** Jan 10, 2011 ****)
7. Formulae Collection in Adobe Acrobat PDF. (**** Jan 10, 2011 ****)

B3. Other Reference Material

1. Data Structures and Algorithms in Java by M. T. Goodrich and R. Tamassia, Wiley.
2. Computer Algorithms: Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Addison Wesley.
3. Data Structures and Algorithms with Object-Oriented Design Patterns in Java by B. Press, Wiley.

B4. Source code

1. misc/Source/C++/testing.tar or misc/Source/C++/sortgC++.tar are one of the same and contain three individual files. On a UNIX system (eg. AFS or Linux) you untar say the testing.tar file by typing tar xvf testing.tar . On a PC one could use a file extraction/compression program such as WinZip to extract its contents. The tar file contains the following three files that can be retrieved independently as well. ATTENTION VISUAL C++ USERS In sortg.cc, you might have to replace INT_MAX by RAND_MAX and the function call to random() by a function call to rand() to make things work right. Note that AFS-based C++ compilers understand C++ files that have .cc suffixes. If you use Visual C++ you may have to use .cpp suffixes in filenames for things to work properly..
2. misc/Source/C++/Makefile.
3. misc/Source/C++/bubble.cc.
4. misc/Source/C++/sortg.cc.

1. misc/Source/C/testing.tar or misc/Source/C/sortgC.tar are one of the same and contain three individual files. On a UNIX system (eg. AFS or Linux) you untar say the testing.tar file by typing tar xvf testing.tar . On a PC one could use a file extraction/compression program such as WinZip to extract its contents. The tar file contains the following three files that can be retrieved independently as well.
2. misc/Source/C/Makefile.
3. misc/Source/C/bubble.c.
4. misc/Source/C/sortg.c.

B5. Postscript and PDF viewers