---

CS 435 Section 102 (Spring 2011)

---

A. Announcements

---

• Fall semester course on We b- se ar ch . I will be offering a course on web search next semester as CS 485. If you are interested, you can can get additional information by browsing Web-search course. Last year's first assignment.

---

• FINAL EXAM DATE/TIME/PLACE. The CS 435 final exam (that is, EXAM 4) is scheduled for Wed May 11, 2011, 6:00pm, regular classroom. Click also 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 multiple-section required course Exam Period Office hours.

  ---

  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, 3rt 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; Subjects 12,14, and 15 will not be examined. 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 385 of CLRS on Huffman codes.
  6. Chapter 22 (but not section 22.5)
  7. Chapter 23.
  8. Chapter 24 (only Dijkstra's algorithm and relevant discussion).
  9. Chapter 25 introduction and section 25.2 but not section 25.3 (Johnson's algorithm).
  10. Chapter 34 introduction, but questions on NP, NP-completeness will not be in the EXAM.

  ---

• Past announcements. Announcements before April 9, 2011.
• 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.