SPRING 2025: CS610 Notes and other information

Copyright by A. Gerbessiotis (2009-2025). All rights reserved.
The copyrighted material downloadable from this page is to be used only by the students enrolled in CS610 under Prof. Gerbessiotis. Distribution of this material outside this group is NOT allowed for any reason. It is prohibited to post information available in this and through the parent page elsewhere.

C0. Emergency Info and Exam Instructions

Updated Canvas documents will be made available in this section. Originals appear in Canvas/Announcements or Canvas/Modules. Canvas has synchronization issues, so a document posted in Canvas will never be updated. If NJIT declares an emergency an in class exam might become an online exam. In that contingency the online exam would be in Canvas using proctoring from ProctorU Record+ (previously known as ProctorU Review+). This is different from ProctorU Live+ that requires to book an appointment (with a live proctor) with ProctorU. Hopefully things will move smoothly and there would be no emergency! This explains the ProctorU related links below.

Fall 2023 information ProctorU Record+ and Guardian browser. Available . Effective Fall 2023, ProctorU Record+ requires the use of the Guardian browser. Read this link carefully. Canvas access might be needed (i.e. myUCID authorization).
Guardian Browser download. Available . Alternative way to download the Guardian browser (also embedded in the text of the previous NJIT related URL).
NJIT's Practice Exam using ProctorU Record+. Available . If you go to the canvas orientation for students (and i only have access to a canvas orientation for faculty, so things might not be identical), the ProctorU Record+ section has a subsection called "Is there a cost for ProctorU Record+?". In it you may find two links. The URL above in this item points to the first of the two links there. You can take it for free as many times as you like. Canvas access is needed (i.e. myUCID authorization).
Test out your equipment. Available .
Additional information for Test Takers (students). Available .
Exam 1 instructions. They are provided for your reading ahead of Exam 1. Uploaded 08/27 .
Exam 2 instructions. They are provided for your reading ahead of Exam 2. Uploaded 08/27 .
Exam 3 instructions. They are provided for your reading ahead of Exam 3. Uploaded 08/27 .

C1. Midterm Performance and Exam Seating Arrangements

C1.a How am I doing in class? Midterm class performance. Edited on 10/06. √ (Exam Statistics are in section C.4.)
C1.b Seating Arrangements for Exam 1, 2, and 3. Edited on 09/25 and updated 09/29.√

C2. HW, PrP, PS, Exams, Solutions and HW clarifications

Homeworks are in Canvas Quizzes. A solution key will appear in Canvas/ Announcements, possibly below, and also in the feedback you will receive in canvas. The programming project (PrP) will be posted in canvas Assignments. Solutions are not ordinarily provided however. First read the textbook, your notes, practice with the problems we did in class, and then and only then try to solve other problems (end of a Subject). Exam 1 and 2 solution key in Canvas Announcements, and below.

Exam 1 solution key Uploaded 10/09 √
Exam 2 solution key Uploaded 11/06 √

C4. Statistics.

Course / Exam statistics. Edited on 11/03 .√

C5. Previous Exams

Note. The material covered in class changes from semester to semester and will change in Spring 2024; new material is being introduced as needed, and some other material may be deemphasized or order of presentation changed. The location of an exam in syllabus might and will change as well. Moreover exam structure and placement in the syllabus changes. The material below is provided as is: we do not discuss solutions nor do we provide clarifications nor confirm or not proposed solutions. They are provided to show the structure of a typical exam in some prior semester. You may practice on it to assess coverage of material. It is also possible that some problems have become homework problems in later semesters.

Sample Exam Exam sample 1, Exam sample 2, Exam sample solutions, Exam sample 3, Exam sample solutions,
Sample Midterm Midterm sample 1, Midterm sample 2, Midterm sample solutions, Midterm sample 3, Midterm sample 4, Midterm sample solutions,
Sample Final Exam FinalExam Sample 1. FinalExam Sample 2.

C6. Lecture Summaries

DISCLAIMER: The included material DOES NOT substitute the textbook for this class. It is copyrighted material and therefore treat it carefully and lawfully. It should be used in conjunction with the textbook and the material presented in class. If a statement in these "notes" seems to be incorrect, report it to the instructor so that it be fixed immediately. The material was rewritten for Spring 2023 and thus it very likely contains typos and errors. These "notes" are distributed to the students of CS610 offered by the instructor A. Gerbessiotis at the New Jersey Institute of Technology; distribution outside this group of students is prohibited. The chapter and sections of the textbook indicated are inclusive of the bounds shown.

Google and sorting 1,000,000 integers Read a snippet from a NY Times articles (Sunday December 2, 2007). Relevant text is underlined. Note that the pdf file is quite long (close to 3 megabytes) and you might have to rotate it counterclockwise. The article is also available at the NY Times site.

Subject 1 (Introduction to Data Structures and Algorithms) [Chapters 1-1.1.4, 1.2-1.3, 2.1-2.3, 12.2-12.3, pages 284-285,305,324 of GT] ( Uploaded 08/27 ) Subject 1X (Coronavirus Supplement: Parallel Computing introduction) ( Uploaded 08/27 )
Subject 2 (Growth of functions and recurrences) [Chapters 1.1.4-1.1.6 and 11.1 of GT] ( Uploaded 08/27 )
Subject 3 (Graphs and Trees) [CS 505 and CS 506 material; Chapters 1.4, 2.4-2.4, 7.1-7.2 of GT] ( Uploaded 08/27 )
Subject 4 (Hash Tables) [Chapters 6-6.3 (but not 6.1 but yes 6.1.2) of GT] ( Uploaded 08/27 )
Subject 5 (Binary Heaps, Priority Queues and HeapSort; Huffman coding) [Chapters 5-5.5 of GT] ( Uploaded 08/27 )
Subject 6 (QuickSort and Linear-time sorting) [Chapters 8.2-8.3, 9.1, 10.3 of GT] ( Uploaded 08/27 )
Subject 7 (Median and order statistics) [Chapter 9.2 and 9.3 of GT] ( Uploaded 08/27 )
Subject 8 (Graph Algorithms) [Chapters 13(but 13.5), 14(but not 14.3), 15(but not 15.4) of GT] ( Uploaded 08/27 )
Subject 9 (Arithmetic Algorithms) [Chapters 11.2-11.3, 12.1 of GT] ( Uploaded 08/27 )
Subject 10 (Binary Search trees and balanced BST) [Chapters 3-3.1, 4-4.2 of GT] ( Uploaded 08/27 )
Subject 11 (Bounded depth search trees: 2-3-4-trees, B-trees) [Chapter 20-20.3 of GT] ( Uploaded 08/27 )
Subject 12 String Matching (Not to be covered) [Chapter 23-23.4 of GT] ( Uploaded 08/27 )
Subject 13 (The theory of NP-completeness) [Chapter 17-17.2.1 of GT] ( Uploaded 08/27 )

Last modified Nov 6, 2025 at 11:24

Disclaimer The material of this web-page is purely optional. It is not required to study it. It is provided as is. Classroom attendance is strongly recommended, and so is studying the designated textbook.