---

CS435 Web-page by A.V. Gerbessiotis (Section 102, Spring 2016)

---

• Final Exam and Course grading The final exam has been graded and letter grades were posted in Banner.
• MP grading (Sat May 7,15:57) The grading has been completed. Email messages were sent out on Saturday May 7 before 4pm by replying to your email. If you did not receive an email it means the instructor never received your original submission; check Handout 2 and MP.
• Office hours on May 11 and 12 during the Examination Period Office hours during the examination period will be observed. However no office hours will be observed during the Reading Days (May 4,5).

---

• FINAL EXAM DATE/TIME/PLACE. The CS 435 final exam is scheduled for Thu May 12, 2016, 6pm at the regular classroom. For up- to-date information click on the Registrar's page http://www.njit.edu/registrar/exams/finalexams.php, The exam will commence by 6:05. The duration is 2 hours and the exam is worth 345 points. Details about the logistics of the exam are in Handout 1. If the exam date changes for any reason this news item will be updated accordingly.

  Exam Conflict Resolution: This class is a high-numbered required course

  ---

  MAKE SURE THAT YOU SWITCH OFF ALL MOBILE DEVICES (CELL/MOBILE PHONES,COMPUTERS, DIGITAL PORTABLE DEVICES) before entering the EXAM ROOM. A clean copy of Handout 5 on red-black trees is allowed in the exam room besides the designated textbook (CLRS, 3rd edition; CLRS 2nd edition is also an acceptable replacement). The material that will be covered includes (more details at the beginning of every online available subject) Subject 1 all the way through and including Subject 11; Subject 11 will not be examined but you are expected to know the definitions of P and NP. From Subject 10, only the material covered in class. In the context of the designated textbook (CLRS, 3rd edition) this translates into the following chapters/sections.

  ---

  1. Chapters 1,2,3, and 4. Appendices A,B,C (review material)
  2. Chapters 6,7,8, 9, 10, 11 (but not section 11.5), 12 (but not section 12.4), 13.
  3. Chapter 15 introduction to dynamic programming.
  4. Chapter 16 introduction to greedy algorithms and section 16.3 that starts on page 428 of CLRS on Huffman codes.
  5. Chapter 21 on data structures for disjoint sets (but not 21.3 and 21.4). Also the notion of amortized analysis as explained on page 451/452 of Chapter 17.
  6. Chapter 22 (but not section 22.5), Chapter 23, Chapter 24 (only Dijkstra's algorithm and relevant discussion).
  7. Chapter 25 introduction and section 25.2 but not section 25.3 (Johnson's algorithm).
  8. Chapter 28 introduction and section 28.1 and 28.2 on matrix operations and Strassen 's algorithm.
  9. Chapter 30 introduction polynomials and section 30.1 (Horner's rule) and of course Problem 30-1 on page 844 that was done in class.
  10. Chapter 31 the algorithm of page 879 for x**n.
  11. Chapter 34 introduction, but questions on NP, NP-completeness will not be in the EXAM.

  ---

• Past announcements. Announcements before April 28, 2016.
• Past semesters Previous offerings of CS435. Dangling links are possible.
• A visualization tool for Search Trees by Elmer N. David (requires java) Search tree (red-black, B-tree, unbalanced binary search tree) visualization.
• Nature's version of a complete binary tree (Hyphaene compressa).

• Handouts for CS435
• CS435 Syllabus in PDF
• CS435 Syllabus in HTML

• Other material: CS435 exams, notes and solutions that requires a login name and a password.