5/10 2nd Reminder Exam 4 (final) is today Monday May 10, 2010. Exam 4 takes place
NOT in the regular (Kupfrian) classroom but at ECEC 100! For exam information, read the highlighted
section below.
5/7 Reminder Exam 4 (final) is this coming Monday. Exam 4 takes place
NOT in the regular (Kupfrian) classroom but at ECEC 100!
5/5 Office Hours Please Check (and click) on the link at the
header for office hours during the exam week (including reading day
availability).
5/2 Subject 14 has been uploaded.
4/30 Note Next week there are two classes scheduled: Monday 5/3 is what was supposed
to be the last day of classes; the snow class missed will be this coming Thursday 5/6 at 4pm
and will de facto become the last day of classes.
FINAL EXAM DATE/TIME/PLACE.
The CS 435 final exam (that is, EXAM 4)
is scheduled for Monday May 10, 2010, 2:30pm, ECEC 100. For up-to-date
information click on the Registrar's page
http://www.njit.edu/registrar/exams/finalexams.php,
The exam will commence by 2:35. 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, 2nd edition; CLRS 3rd 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 14 and 15 material covered on the Reading Day will not be examined,
even if they are listed below
In the context of the designated textbook (CLRS, 2nd edition) this translates into the following
chapters/sections.
Chapters 1,2,3, and 4.
Appendices A, B, C (review material)
Chapters 6,7,8, 9, 10, 11 (but not section 11.5), 12
(but not section 12.4), 13.
Chapter 15 introduction to dynamic programming and section 15.2.
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). Also the
notion of amortized analysis as explained on page 405/406 of Chapter 17.
Chapter 22 (but not section 22.5)
Chapter 23.
Chapter 24 (only Dijkstra's algorithm and relevant discussion).
Chapter 25 introduction and section 25.2 but not section 25.3 (Johnson's algorithm).
Chapter 34 introduction, but questions on NP, NP-completeness will not be in the EXAM.
New Course Fall 2010 Are you interested in web-searching and
related topics? Course
CS485-101 is to be offered next semester.
A visualization tool for Search Trees by Elmer N. DavidClick here.
SortAlgo by Harendra V. BhagatClick here (the server might stop working from time to time).
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 a brief syllabus of the course, you can retrieve it
here:
Syllabus (in PDF). and in
HTML
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.