CIS 435

Copyright by A. Gerbessiotis (1999-2005). All rights reserved.


B1. Homeworks , Programming Assignments and Exams


Problem sets with solutions are periodically posted in the protected area. You don't get credit for doing these problem sets! We also require you to do at least two of the following comprehensive homeworks (if you do all three of them, the one with the lowest grade will be dropped).


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 in Adobe Postscript and Adobe Acrobat PDF. (**** Sep 1, 2005 ****).
  2. Programming Assignment 2 in Adobe Postscript and Adobe Acrobat PDF. (**** Sep 1, 2005 ****).
  3. Programming Assignment 3 in Adobe Postscript and Adobe Acrobat PDF. (**** Sep 1, 2005 ****).
  4. Programming Assignment 4 in Adobe Postscript and Adobe Acrobat PDF. (**** Sep 1, 2005 ****).
  5. Programming Assignment 5 in Adobe Postscript and Adobe Acrobat PDF. (**** Sep 1, 2005 ****).

B2. Handouts

  1. Handout 1 (Syllabus Information) Adobe Postscript and Adobe Acrobat PDF. (****Already Uploaded ****)
  2. B2b. Other Course Handouts

  3. Handout 2 (Programming Guidelines) in Adobe Postscript and Adobe Acrobat PDF. (**Uploaded **)
  4. Handout 3 (Brief discrete math review) in Adobe Postscript and Adobe Acrobat PDF. (**Uploaded **)
  5. Handout 4 (Brief notes on asymptotic notation and recurrences) in Adobe Postscript and Adobe Acrobat PDF. (**Uploaded **)
  6. Formulae Collection in Adobe Postscript and Adobe Acrobat PDF. (**Uploaded **)

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. 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

Source code cited in the programming exercises. The C++ version first:
  1. handouts/Source/C++/testing.tar or handouts/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++ USERSIn 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.
  2. handouts/Source/C++/Makefile.
  3. handouts/Source/C++/bubble.cc.
  4. handouts/Source/C++/sortg.cc.
The C version is similar in structure.
  1. handouts/Source/C/testing.tar or handouts/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. handouts/Source/C/Makefile.
  3. handouts/Source/C/bubble.c.
  4. handouts/Source/C/sortg.c.
Note that our AFS-based C++ compiler understands C++ files that have .cc suffixes. If you use Visual C++ you may have to use .cpp suffixes in filenames.

B5. Postscript and PDF viewers

You can download viewers for Postscript and PDF files through this link.