CS 435 : Handouts

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

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

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 21, 2010 ****).
  2. Programming Assignment 2 (to be received by Exam2 date) in Adobe Acrobat PDF. In the assignment dated Jan 21, function nclrssrt appeared twice written with one s as nclrsrt. This has been corrected. Either interpretation will still be considered correct; we have corrected this in this new version. The old version is still available (substitute nclrssrt for nclrsrt) Adobe Acrobat PDF. (**** Jan 22, 2010 ****).
  3. Programming Assignment 3 (to be received by Exam3 date) in Adobe Acrobat PDF. (**** Jan 21, 2010 ****).

B2. Handouts

B2a. Syllabus and Course FAQ

  1. Handout 1 (Syllabus Information) Adobe Acrobat PDF. (**** Jan 18, 2010 ****)

    2. B2b. Other Course Handouts

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

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. 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.
The C version is similar in structure.
  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

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