CS435 Material (Section 102 in Fall 2017)
Copyright by A. Gerbessiotis (2009-2020). All rights reserved.
The copyrighted material downloadable from this page is to be
used only by the students enrolled in CS435 under Prof. Gerbessiotis.
Distribution of this material outside this group is
NOT allowed for any reason.
C1. Midterm Performance and Exam Seating Arrangements
C2. Practice Problem Sets, Exams and sample solutions
A number of practice problems will be posted on the Web periodically with
their solutions. First read the textbook, your notes,
practice with 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/Mini-Project.
The programming assignment (mini-project) will be posted in the Handouts
section. Solutions are not ordinarily provided however.
C4. Statistics
C5. Previous Exams
Note. The exams listed here are provided as are.
Neither the instructor nor the assistant (also known, if available, as TA, grader)
is obliged in any way to discuss solutions of the problems of these exams.
Some links might be broken because files got erased.
You are on your own.
There is no guarantee that the coming exams will be in any way similar to those
posted here. There are things that change every semester (eg. snow days, duration
of class, syllabus, etc)
Moreover, the structure of the class may be different eg. 90 minute
lectures twice a week versus 3-hour lectures once a week.
- Fall 2017
Exam 1.
Solutions Exam 1.
Exam 2.
Solutions Exam 2.
Exam 3.
Exam 3 Solutions.
- Exam 1 samples
Exam 1.
Solutions Exam 1.
Exam 1.
Solutions Exam 1.
Exam 1.
Solutions Exam 1.
Exam 1.
Solutions Exam 1.
Exam 1.
Exam 1 solutions.
Exam 1/A.
Exam 1/B.
- Exam2 (Midterm-like) samples
Exam 2.
Solutions Exam 2.
Exam 2.
Solutions Exam 2.
Exam 2.
Solutions Exam 2.
Exam 2.
Exam 2/A.
Exam 2/B.
- Exam3 or Exam4 (Final-like or other) samples
Exam 3.
Exam 3.
Exam 4(final).
Exam 3/A.
Exam 3/B.
Exam 4.
Exam 3.
Exam 3 solutions.
Exam 4.
(Note: some dates might indicate 2009 rather than 2010 or some figures might be missing or
appear distorted).
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 CS435
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.
Bugs and Errata in CLRS 3rd edition
(aka textbook).
For the previous edition of the textbook i.e. CLRS 2e,
Errata for CLRS2e.
If you want to compare the two editions, a helpful but NOT complete,
chapter comparison between CLRS2e and CLRS3e.
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.
Local copy of NY Times article.
The article is also available at the
NY Times site.
SUBJECTS
CHAPTER NUMBERS REFER TO THE 3rd EDITION OF CLRS
-
Subject 1 :
Introduction to Data Structures and Algorithms [Chapters 1,2,10 and Appendix A]
(** Uploaded on 08/17 **) √
-
Subject 2 :
Growth of Functions and Recurrence Relations [Chapters 3 and 4]
(** Revision Uploaded on 10/02 **) √
The older version of Subject 2 :
(** Uploaded on 08/31 **) √
-
Subject 3 :
Graphs and Trees; Elements of Counting and Probability
[Appendix B of CLRS on page 1168 onwards; rest is CS241 material for review]
(** Uploaded on 08/31 **) √
-
Subject 4 :
Heaps, Priority Queues and HeapSort; Huffman Coding [Chapter 6 and 16 (intro, 16.3)]
(** Uploaded on 09/20 **) √
-
Subject 5 :
Quicksort [Chapters 7]
(** Uploaded on 10/02 **) √
-
Subject 6 :
The complexity of sorting and sorting in linear time; Median and Order statistics
[Chapter 8 and 9]
(** Uploaded on 10/02 **) √
-
Subject 7 :
Hash Tables [Chapters 11 but not section 11.5]
(** Uploaded on 10/30 **) √
-
Subject 8 :
Introduction to Graph Algorithms [Chapters 21.1-21.2, 22, 23, 24, 25]
(** Uploaded on 10/30 **) √
-
Subject 9:
Binary Search Trees (BST), Balanced BSTrees : Red-Black Trees [Chapters 12 and 13]
(** Uploaded on 11/20 **) √
-
Subject 10:
Arithmetic Operations and Chained Matrix Multiplication
[Appendix D, Ch 4.2 (pp. 75-83), Ch 30/30.1 (pp 898-901),
Problem 30-1 (p. 920), Problem 2-3 (page 41), Section 15-2 (pp. 370-378)]
(** Uploaded on 11/20 **) √
-
Subject 11:
Theory of NP-completeness [Chapter 34]
(** Uploaded on 11/27 **) √
-
Subject 12:
String Matching [Chapter 32]
(** Uploaded on 11/27 **) √
Last modified Dec 20, 2017 at 12:00