---

CS 435 Section 101 (Fall 2009)

---

A. Announcements

---

---

1. (12/15) Final Exam (EXAM 4) You can inspect the final exam on Tue Dec 15, 5-6pm or on Wed Dec 16, 10-11am. Preliminary statistics are in the protected area of the course web-page.
2. (12/10) POST EXAM INFO The exam is on Mon Dec 14. Weather permitting you can inspect the exam if you so wish on Wed Dec 16 (10:00-11:00am) and you can thus learn the numeric Exam 4 grade. If you can't make it on Wed Dec 16, it might be possible to inspect the exam of Tue Dec 15, 5-6pm. For this date however, a prior appointment email is needed to make sure that the exam will be graded by then.
3. (12/10) PRE EXAM INFO Regular office hours are to be held on the day of the exam that is, 10-11am and 4:00-5:30pm on Monday Dec 14. If these hours are not convenient for you, other times on Thu and Fri afternoon could be arranged by a prior email appointment.

---

4. FINAL EXAM DATE/TIME/PLACE. The CS 435 final exam (that is, EXAM 4) is scheduled for Monday Dec 14, 2009, 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 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

   NEW

   ---

   MAKE SURE THAT YOU SWITCH OFF ALL MOBILE DEVICES (CELL/MOBILE PHONES,COMPUTERS, DIGITAL OR OTHERWISE 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, 2nd edition). 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 14. In the context of the textbook (CLRS, 2nd 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 and section 15.2.
   5. Chapter 16 introduction to greedy algorithms and section 16.3 that starts on page 385 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 405/406 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 28 introduction and section 28.1 and 28.2 on matrix operations and Strassen's algorithm.
   12. Chapter 30 introduction to polynomials and section 30.1 (Horner's rule) and of course Problem 30-1 on page 844 that was done in class.
   13. Chapter 31 the algorithm of page 879 for x**n.
   14. Chapter 34 introduction, but questions on NP, NP-completeness will not be in the EXAM.

   ---

5. (11/23) Exam 3 is now available for download through the section C link to the protected area.
6. (11/23) PS 8 is now available for download through the section C link to the protected area.

---

• Past announcements. Click here.
• Past semesters Click here.
• A visualization tool for Search Trees by Elmer N. David Click here.
• SortAlgo by Harendra V. Bhagat Click here.

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.