CS 435 Section 102 (Solutions, Exams and Lecture Notes ): Spring 2013
The copyrighted material downloadable from this page is to be
used only by the students enrolled in CS 435 under Prof. Gerbessiotis.
Distribution of this material outside this group is
NOT allowed for any reason.
C1. Midterm Performance
- How am i doing in class?
Midterm class performance.
Edited on 3/21/2013 . √
Note that Exam Statistics are available in section C4.
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 three programming assignments will be posted in the Handouts section.
Solutions are not ordinarily provided however. A sample solution for insertion
sort might be given.
C4. Exams, Statistics, and solutions to selected exams
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 through
the exam
statistics link.
Edited on May 15, 2013 . √
C5. Previous Exams
Note. The exams listed here DO NOT serve as additional
problems or problem sets. The Problem Sets with their solutions, along
with the HomeWork problems serve this purpose.
Neither the instructor nor the assistant is
obliged in any way to discuss solutions of the problems of these exams.
There is no guarantee that the coming exams will be similar, as the
material that will be covered in class for the exams may be different;
in addition the structure of the class may be different eg. 90 minute
lectures twice a week versus 3-hour lectures once a week.
- Spring 2012
Exam 1.
Exam 1 solutions.
Exam 2.
Exam 2 solutions/A.
Exam 3.
Exam 3 solutions.
Exam 4(final).
- Spring 2011
Exam 1/A.
Exam 1/B.
Exam 1 solutions.
Exam 2/A.
Exam 2/B.
Exam 2 solutions.
Exam 3/A.
Exam 3/B.
Exam 3 solutions.
Exam 4.
- Spring 2010
Exam 1.
Exam 1 solutions.
Exam 2.
Exam 2 solutions.
Exam 3.
Exam 3 solutions.
Exam 4. (Note: some dates might indicate 2009 rather than 2010).
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 3rs edition (a.k.a. textbook) For a list of known
bugs and errata click here.
Bugs and Errata in CLRS 2nd edition(previous semester textbook) For a list of known
bugs and errata click here.
CHAPTER COMPARISON CLRS 2nd and 3rd edition
Click here.
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.
SUBJECTS
CHAPTER NUMBERS REFER TO THE 3rd EDITION OF CLRS
- Subject 1 (Introduction) in
Adobe Acrobat PDF [Chapters 1,2 and Appendix A]
(**** 1/04/2013 ****) √
- Subject 2 (Asympotic Notation and Recurrences) in
Adobe Acrobat PDF [Chapters 3 and 4]
(**** 1/04/2013 ****) √
- Subject 3 (Review on Graph and Tree definitions) in
Adobe Acrobat PDF. This is
review material; for more information or related reading go
to Appendix B of CLRS on page 1168 onwards.
(**** 1/04/2013 ****) √
- Subject 4 (Elementary Data Structures) in
Adobe Acrobat PDF.
This is review material found in Chapter 10 on page 232 of
CLRS. The operation definitions are from page 230 of CLRS.
(**** 1/04/2013 ****) √
- Subject 5 (Heaps, Priority Queues and HeapSort, Text Compression)
in
Adobe Acrobat PDF [Chapter 6, 16.3]
(**** 1/04/2013 ****) √
- Subject 6 (QuickSort) in
Adobe Acrobat PDF [Chapter 7]
(**** 2/25/2013 ****) √
- Subject 7 (REVIEW: Elements of Counting and Prob. Theory) in
Adobe Acrobat PDF
This Subject will not be covered in class. It is a review subject.
[Appendix C]
(**** 2/25/2013 ****) √
- Subject 8 (Complexity of Sorting and Sorting in Linear Time) in
Adobe Acrobat PDF [Chapter 8]
(**** 2/25/2013 ****) √
- Subject 9 (Selection) in
Adobe Acrobat PDF [Chapter 9]
(**** 2/25/2013 ****) √
- Subject 10 (Hashing) in
Adobe Acrobat PDF [Chapter 11]
(**** 3/25/2013 ****) √
- Subject 11 (Binary Search Trees (BST), Balanced BSTrees : Red-Black Trees)
in
Adobe Acrobat PDF [Chapters 12 and 13]
(**** 3/25/2013 ****) √
- Subject 12 (Arithmetic Operations and Chained Matrix Multiplication)
in
Adobe Acrobat PDF 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).
(**** X/XX/XXXX ****) √
- Subject 13 (Graph Algorithms)
in
Adobe Acrobat PDF [Chapters 21.1-21.2, 22,
23, 24, 25]
(**** 4/12/2013 ****) √
- Subject 14 (Theory of NP-completeness)
in
Adobe Acrobat PDF [Chapter 34]
(**** 4/12/2013 ****) √
- Subject 15 (String Matching)
in
Adobe Acrobat PDF [Chapter 32]
(**** XXXXXXXXX ****) √
Last modified May 21, 2013, 12:57