---

CS435 Web-page (Section 102, Spring 2018)

---

• Web-page content (5/15) Within the next 24 hours the contents of this page will be retired/moved.
• Final Exam Inspection (5/8) On Friday 11:30-12:30 i will have office hours; you may inspect the final exam. It is expected that final exam grading will be over by then. If something changes from that plan, this news item will be updated accordingly. Letter grades will be computed and posted afterwards, hopefully by end of day Saturday.
• Office Hours (4/29) Office hours will be observed during the Reading Day Wed 2 May, 2018. Likewise for Tue 8 May and Wed 9 May. There will be NO office hours Tue 1 May, 2018; NJIT follows a Friday schedule.

---

• FINAL EXAM DATE/TIME/PLACE. The CS 435 final exam is scheduled for Wed May 09, 2018 (regular classroom, starting by 6:05pm). For up- to-date information click on the Registrar's page http://www.njit.edu/registrar/exams/finalexams.php, 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 4 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 11.5), 12 (but not 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 30 introduction polynomials and of course Problem 30-1 on page 920 that was done in class.
  9. Chapter 31 the algorithm of page 957 for x**n.
  10. Chapter 34 introduction, but explicit questions on NP, NP-completeness will not be in the EXAM.

  ---

• Past announcements. Announcements before Apr 28, 2018.
• 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
• Revised Schedule for CS 435-102 Spring 2018 Revised Schedule CS435-102 (Revised on 3/22)

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