---

CIS 435 (Solutions, Quizzes and Lecture Notes)

---

The copyrighted material downloadable from this page is to be used only by the students enrolled in CIS 435 under Prof. Gerbessiotis. Distribution of this material outside this group is NOT allowed for any reason.

---

Midterm Performance

• How am i doing in class? Click here.

---

Solutions to Homeworks

Previous Exams

Note The exams listed here DO NOT serve as additional problems or problem sets. 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.

1. Exam 1 in Adobe Postscript and Adobe Acrobat PDF.
2. Exam 2 (Midterm) in Adobe Postscript and Adobe Acrobat PDF.
3. Exam 3 in Adobe Postscript and Adobe Acrobat PDF.
4. Exam 4 (Final) (figures may be missing) in Adobe Postscript and Adobe Acrobat PDF.

Other Reference Material

1. Computer Algorithms: Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Addison Wesley.
2. Data Structures and Algorithms in Java by M. T. Goodrich and R. Tamassia, Wiley.
3. Data Structures and Algorithms with Object-Oriented Design Patterns in Java by B. Press, Wiley.

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 CIS435 offered in Fall at the New Jersey Institute of Technology; distribution outside this group of students is prohibited.

Bugs and Errata in CLRS (a.k.a textbook) For a list of known bugs and errata click here.

• Subject 1 (Introduction) in Adobe Postscript and Adobe Acrobat PDF (uploaded 9/10).
• Subject 2 (Asympotic Notation and Recurrences) in Adobe Postscript and Adobe Acrobat PDF (uploaded 9/19).
• Subject 3 (Review on Graph and Tree definitions)/B> in Adobe Postscript and Adobe Acrobat PDF. This is review material; for more information or related reading go to Appendix B of CLRS on page 1070 (uploaded 10/3).
• Subject 4 (Elementary Data Structures)/B> in Adobe Postscript and Adobe Acrobat PDF. This is review material found in Chapter 10 on page 200 of CLRS (uploaded 10/3).
• Subject 5 (Heaps, Priority Queues and HeapSort)/B> in Adobe Postscript and Adobe Acrobat PDF (uploaded 10/3).
• Subject 6 (QuickSort) in Adobe Postscript and Adobe Acrobat PDF (uploaded 10/16).
• Subject 7 (REVIEW: Elements of Counting and Prob. Theory) in Adobe Postscript and Adobe Acrobat PDF (uploaded 10/16). This Subject will not be covered in class. It is a review subject.
• Subject 8 (Complexity of Sorting and Sorting in Linear Time) in Adobe Postscript and Adobe Acrobat PDF (uploaded 10/16). Errata On page 6, algorithm Count-Sort, swap lines 9 and 8, i.e. line 9 must be executed before line 8.
• Subject 9 (Selection) in Adobe Postscript and Adobe Acrobat PDF (uploaded 10/16).
• Subject 10 (Hashing) in Adobe Postscript and Adobe Acrobat PDF (uploaded 10/28). There is a typo (actually a duplication) on page 13, top line. It reads "Analysis of unsuccessful search: Analysis of successful search:". Delete the first part so that it reads "Analysis of successful search:".
• Subject 11 (Binary Search Trees, Balanced BSTress -- Red-Black Trees) in Adobe Postscript and Adobe Acrobat PDF (uploaded 11/12).
• Subject 12 (Graph Algorithms) in Adobe Postscript and Adobe Acrobat PDF (uploaded 11/19). There is a TYPO on page 28, Prim's Algorithm, Line 1 Q=V: should read Q=V-X.