CS 610
Copyright by A. Gerbessiotis (2006-2008).
All rights reserved.
B1. Homeworks
- 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 Thursday of
the semester.
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).
For due dates, please check the syllabus, page 2.
- Homework 1 (Programming Assignment) in
Adobe Postscript and
Adobe Acrobat PDF.
(**** Sep 3, 2008 ****).
- Homework 2 (Programming Assignment) in
Adobe Postscript and
Adobe Acrobat PDF.
(**** Sep 15, 2008 ****).
- Homework 3 (Programming Assignment) in
Adobe Postscript and
Adobe Acrobat PDF.
(**** Oct 8, 2008 ****).
- Homework 4 (Programming Assignment) in
Adobe Postscript and
Adobe Acrobat PDF.
(**** Oct 29, 2008 ****).
B2. Handouts
B2a. Syllabus and Course FAQ
- Brief Course Syllabus Click here for
Adobe Acrobat PDF versions.
- 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).
(**** Aug 28, 2008 **)
- Handout 1 (Syllabus Information)
Adobe Acrobat PDF.
(**** Sep 4, 2008 (corrected) **)
B2b. Other Course Handouts
- Handout 2 (Programming Guidelines) in
Adobe Acrobat PDF.
(** Aug 28, 2008 **)
- Handout 3 (Brief discrete math review) in
Adobe Acrobat PDF.
(** Aug 28, 2008 **)
- Handout 4 (Brief notes on asymptotic notation and recurrences) in
Adobe Acrobat PDF.
(** Aug 28, 2008 **)
- Handout 5 (Formulae Collection) in
Adobe Acrobat PDF.
(** Aug 28, 2008 **)
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.
- 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.
B4. Source code
Source code cited in the programming exercises. The C++ version first:
-
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..
-
misc/Source/C++/Makefile.
-
misc/Source/C++/bubble.cc.
-
misc/Source/C++/sortg.cc.
The C version is similar in structure.
-
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.
-
misc/Source/C/Makefile.
-
misc/Source/C/bubble.c.
-
misc/Source/C/sortg.c.
B5. Postscript and PDF viewers
You can download viewers for Postscript and PDF files
through this link.