CS 610 (Solutions, Exams and Lecture Notes ): Spring 2008
The copyrighted material downloadable from this page is to be
used only by the students enrolled in CS 610 under Prof. Gerbessiotis.
Distribution of this material outside this group is
NOT allowed for any reason.
C1. Midterm Performance
C2. Problem Sets and Solutions
A number of practice problems will be posted on the Web periodically with their solutions.
First read the textbook, your notes, practice the problems we did in class, and then and only
then try to solve these problems. Look at the solutions only when you exhaust all other
alternatives.
C3. Solutions to Homeworks and/or Programming Assignments.
The four programming assignments will be posted in the Handouts section.
Solutions are not ordinarily provided however.
C4. Solutions to Exams and Statistics
The first three exams will be posted in the Handouts section of the
web-page (the public one).
The solutions will be posted here.
We won't post the final or solutions for it. You can find however
the final given most recently in section C5 below.
Statistics for the class exams will be become available here.
Comments about the exams are available at Exam Comments.
- Exam 1 and solutions in
PDF. Uploaded on 02/25/08.
Solutions in
PDF.
Uploaded on 02/29/08 .
- Exam 2 and solutions in
PDF. Uploaded on 03/25/08.
Solutions in
PDF.
Uploaded on 03/28/08 .
- Exam 3 in
PDF.
Uploaded on XX/XX/XX .
C5. Previous Exams (PDF ONLY)
Files available only in Adobe Acrobat PDF. Several exams come with solutions.
Solution are not provided for the final exam of the sequence which is the last
exam file.
C6. Lecture Summaries
DISCLAIMER: The included material DOES NOT substitute the textbook
for this class. It should be used in conjunction with the textbook and the
material presented in class. If a statement in these "notes" seems to be
incorrect, report it to the instructor so that it be fixed immediately.
These "notes" are distributed to the students of CS610
offered in Spring/Fall at the New Jersey Institute of Technology;
distribution outside this group of students is prohibited.
The material below will be uploaded in due time; an upload message will
appear as soon as the corresponding document is uploaded.
Google and sorting 1,000,000 integers Read a snippet from
a NY Times articles (Sunday December 2, 2007). Relevant text is underlined.
Note that the pdf file is quite long (close to 3 megabytes) and you might
have to rotate it counterclockwise.
Click here.
The article is also available at the
NY Times
site.
- Subject 1 (Introduction to Data Structures and Algorithms) in
Adobe Postscript and
Adobe Acrobat PDF [Chapters 1 and 4.1 of GT]
(**** Jan 25, 2008 ****)
- Subject 2 (Growth of functions and recurrence relations) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 1 and 5.2 of GT]
(**** Jan 25, 2008 ****)
- Subject 3 (Elementary Data Structures) in
Adobe Postscript and
Adobe Acrobat PDF.
This is mainly CS 114/116 and CS 505 material.
[Chapters 2.1-2.3 and 4.2.2 of GT].
Updated Euler-Tour on page 15.
(**** Jan 25, 2008 ****)
- Subject 4 (Heaps, Priority Queues and HeapSort. Huffman Coding) in
Adobe Postscript and
Adobe Acrobat PDF.
[Chapters 2.4 and 9.3 of GT].
(**** Jan 25, 2008 ****)
- Subject 5 (QuickSort and Linear-time sorting) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 4 of GT]
(**** Feb 14, 2008 ****)
- Subject 6 (Median and order statistics) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 4]
(**** Feb 14, 2008 ****)
- Subject 7 (Integer and Matrix Multiplication. Polynomial Evaluation: Divide-and-conquer
and dynamic programming in a numerical setting) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 5.2.2 and 5.3 of GT]
(**** Mar 5, 2008 ****)
- Subject 8 (Hash Tables) in
Adobe Postscript and
Adobe Acrobat PDF
[Chapter 2.5 (skip 2.5.6) of GT]
(**** Mar 5, 2008 ****)
- Subject 9 (Binary Search trees and Balanced binary search trees) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 3]
(**** Mar 5, 2008 ****).
- Subject 10 (Search Trees of bounded height. Multi-way search trees
with examples including 2-3-4 trees, $(a,b)$ trees and $B$-trees) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 3.3 and 14.1.2 of GT]
(**** Apr 3, 2008 ****)
- Subject 11 (Graph Algorithms) in
Adobe Postscript and
Adobe Acrobat PDF [Chapters 6 and 7]
(**** Apr 2, 2008 ****)
- Subject 12 (String Matching) in
Adobe Postscript and
Adobe Acrobat PDF [Chapter 9.1 of GT]
(**** Apr 22, 2008 ****)
- Subject 13 (The theory of NP-completeness)
in
Adobe Postscript and
Adobe Acrobat PDF [Chapters 13.1 and 13.2]
23, 24, 25]
(**** Apr 22, 2008 ****)