---

Past Announcements (Spring 2004)

• Computer Viruses and Email Problems As you might have noticed, the University is experiencing various problems with waves of suspicious email messages due to viruses. We respond to emails sent to alg435@cs.njit.edu immediately, if possible, and definitely within a day. If you believe, now or in the future, an email of yours has not been acted upon, first check this web-page to be informed on whether mail problems are preventing us from reaching you; in the absence of such a notification, please resend your email.
• MidtermExam and Class Performance Exam 2 will be returned this coming Tue (Mar 23). Information about the exam is available through the link in the protected area of this web-site. MidtermClass performance is also available through that link.
• MidtermExam Material The following material will be covered in the exam on TUESDAY MARCH 9. NOTE THAT THE EXAM is open-textbook only; you may also bring a clean copy of the CHEAT SHEET. No other reference can be used, i.e. other lecture note material, books etc are NOT ALLOWED. YOU ARE NOT ALLOWED TO BORROW a copy of the textbook from a fellow student during the midterm. If you bring a copy of the textbook you can use it, if you don't it means you don't need it. MAKE SURE THAT YOU SWITCH OFF ALL MOBILE DEVICES (PHONES,COMPUTERS, DIGITAL PORTABLE DEVICES) before entering the EXAM ROOM. CLRS stands for the textbook.
  1. Chapters 1,2,3, and 4.
  2. Chapter 10
  3. Appendices A, B, C (Math 226 material)
  4. Chapter 6
  5. Chapter 16 only section 16.3 that starts on page 385 of CLRS on Huffman codes.
  6. Chapter 7 on Quicksort.
• Exam 1 Statistics Average exam grade 67 out of 100; standard deviation 15. Median grade 66. Distribution 80-100: 12, 60-80: 23, 40-60: 10, 0-40: 3.
• AFS/OAK Email Problems Feb 21- Feb 23 Computing Services announced that there were OAK.NJIT.EDU related email problems (loss of email). If you had contacted us this weekend and had not received a reply, then your email could have been lost. Please, re-send it.
• HW3 Problems 2f,2g, and Problem 3 extension Although Homework 3 is due next Tuesday Feb 24, I will accept late submissions for these problems by the following Tuesday Mar 2 as long as you submit them separately from Homework 4 and they are clearly marked as an appendix to HW3. This extension affects only Problems 2f,2g, and Problem 3. The rest of HW3 Problems will be due as scheduled on Tue Feb 24.
• Exam 1 this coming Tuesday Feb 17 It is based on the material of HW0, 1, and 2, that correspond to Chapters 1, 2, 3, 4.3 (The Master Method), and the material we covered from Appendix A on sums. As i mentioned in class, you may bring in an UNMARKED COPY OF THE CHEAT SHEET (ALSO AVAILABLE IN THE HANDOUT SECTION) and thus you don't need to memorize the master theorem. Other information about EX1 is in Handout 1.
• HW 2 Solutions are out.
• HW1 and 2 Solutions will become available between Tue Feb 10 and Thu Feb 12 in the protected area. EXAM 1 next Tue will be based on the material covered in/related to HW 0,1, and 2 only. YOU MAY BRING IN AN UNMARKED COPY OF THE CHEAT SHEET which can be found in the handout area.
• Wed Feb 4 Solutions for HW0 have already been posted. In the links to the subject notes, I now include some textbook chapter information related to the material the notes cover. The first few pages of the subject notes, may include more accurate information however.
• If you missed the Tue Jan 27 class, we covered introductory algorithm design using the incremental and the divide-and-conquer method with example ranging from Fibonacci sequences to sorting (insertion, bubble, odd-even transpostion, selection). Stability and sorting-in-place issues were discussed. With reference to the web-available Subject 1 notes, we covered everything but MergeSort. In addition asymptotic performance was covered (Subject 2, the first three pages).
• If you plan not to come to class tonight due to the expected inclement weather, you can turn in Homework 0, in my office, the first day the University is open after tonight (i.e. if the University is open tomorrow, this will be tomorrow) Tue Jan 27. You must turn HW0 in my office however.
• This page is under construction. Come back around noon time on Jan 20.
• SortAlgo: A sorting Algorithm Visualization Tool Harendra Bhagat last semester implemented a sorting algorithm visualization tool in java. If you want to see we how a sorting algorithm works visually click here and choose, your algorithm, input size and input data. You MUST use NETSCAPE, however, to make it work.
• Past semesters Click here.