---

Web-page for CS 435 Section 102 (Spring 2012)

---

A. Announcements

---

• May 9: Letter grades have been submitted and posted at my.njit.edu
• May 8: Exam 4 (Final) The final exam has been graded. Statistics are available in section C.
• May 2: Office Hours Next Week (Tue May 8) Even if during Examination Week office hours are NOT observed, on Tuesday May 8 office hours will be held. Students who want to pick past exams (Ex1-Ex3) or want to find out the grade for Ex4 can do so then. Students can inspect Ex4 but not pick it up.
• Apr 28: Office Hours Next Week (Tue May 1) Even if on Tuesday NJIT follows a Friday schedule, the Tue office hours WILL BE observed, given that our final is two days later.
• Apr 27: Password Protection (Section C) has been removed temporarily. You can access that section without a password/login.
• Apr 23: C.4 vs C.5 links for Exam 3 The section C.5 links to Ex3 and solutions have been working fine. There was a problem with a section C.4 link that has now been fixed. If you still have problems, with the section C.4 links, close completely the browser and restart it, or use another browser, or reboot your computer (i.e. flash your cache).

---

• FINAL EXAM DATE/TIME/PLACE. The CS 435 final exam (that is, EXAM 4) is scheduled for Thu May 3, 2012, 6pm at the regular classroom (CKB 212). 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 333 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 13; Subject 12 will not be examined and from Subject 14 you may be asked just the definitions. In the context of the designated textbook (CLRS, 3rd edition) this translates into the following chapters/sections.

  ---

  1. Chapters 1,2,3, and 4.
  2. Appendices A, B, C (review material)
  3. Chapters 6,7,8, 9, 10, 11 (but not section 11.5), 12 (but not section 12.4), 13.
  4. Chapter 15 introduction to dynamic programming.
  5. Chapter 16 introduction to greedy algorithms and section 16.3 that starts on page 428 of CLRS on Huffman codes.
  6. 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.
  7. Chapter 22 (but not section 22.5)
  8. Chapter 23.
  9. Chapter 24 (only Dijkstra's algorithm and relevant discussion).
  10. Chapter 25 introduction and section 25.2 but not section 25.3 (Johnson's algorithm).
  11. Chapter 34 introduction, but questions on NP, NP-completeness will not be in the EXAM.

  ---

• Past announcements. Announcements before Apr 20, 2012.
• Past semesters Previous offerings of the course.
• A visualization tool for Search Trees by Elmer N. David Search tree (red-black, B-tree, unbalanced binary search tree) visualization.
• SortAlgo by Harendra V. Bhagat Sorting Algorithm visuzalization (the server might stop working from time to time).

B. Course Syllabus, Homeworks, Programming Assignments and other Handouts

C. Solutions/Exams and Practice Problem Sets with Solutions

• Solutions to Homeworks, Exams, Past Exams, Practice Problem Sets with solutions, and Lecture Note Summaries are made available through this link. that requires a login name and a password.