Final Exam First Announcement The final exam is scheduled
for May 9; place and starting time remain the same with those of Exams 1-3.
Guidelines for the final exam are posted below.
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.
The material that will be covered includes (more details at the beginning of every
online available subject).
Exam Conflict Resolution: This class is a high-numbered required course
Chapters 1,2,3, and 4.
Appendices A, B, C (review material)
Chapters 6,7,8 (but not section 8.4),9,10,11 (but not section 11.5),12
(but not section 12.4),13.
Chapter 15 introduction to dynamic programming.
Chapter 16 introduction to greedy algorithms and section 16.3 that starts on page
385 of CLRS on Huffman codes.
Chapter 21 on data structures for disjoint sets (but not 21.3 and 21.4).
Chapter 22 (but not proofs, neither section 22.5)
Chapter 23 (emphasis on Section 23.2, proof of correctness optional) .
Chapter 24 introduction and Section 24.3.
Chapter 25 introduction and section 25.2.
Chapter 34 introduction but questions on NP, NP-complete will not be in the EXAM.
Web-page Some rare times the link to the course web-page may
not work properly. Try to access the web-page by substituting
web.njit.edu for
www.cs.njit.edu as in
http://web.njit.edu/~alexg/courses/cis435/index.html
Past Announcements
can be retrieved through
this link.
A visualization tool for Search Trees by Elmer N. DavidClick here.
B. Course Syllabus, Homeworks, Programming Assignments and other Handouts
Please
click here. to obtain detailed course information, handouts, homeworks,
and download code (in C or C++) for the programming assignments.
If you are only interested in obtaining the syllabus of the course, you can retrieve it
here:
Syllabus (in PDF).
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.