CS610 Notes and other information
Copyright by A. Gerbessiotis (2009-2022).
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. Updated version of Canvas files
Updated Canvas documents might be located
here. 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 two ProctorU related links below,
if they become visible.
-
The Programming project (PrP) .
The md5sum of the file is 11d0dc43971ce24e2bbc33ff3323ad8a,
and so is the md5sum of the currently uploaded file in canvas.
In Linux to find the md5sum of a file with name filename you do
md5sum filename
Uploaded 01/20 .
-
NJIT's ProctorU Record+ Overview .
This is a link that is provided in case an NJIT emergency in Fall 2021
stipulates an online Exam.
Canvas access is needed (i.e. myUCID authorization.)
This is available in Student orientation in canvas.
Uploaded XX/XX .
-
NJIT's Practice ProctorU Record+ utilized canvas quiz.
This is a link that is provided in case an NJIT emergency in Fall 2021
stipulates an online Exam.
Canvas access is needed (i.e. myUCID authorization.)
It is also accessible through Student orientation in canvas.
An instructor has no access to this area or the link.
Uploaded XX/XX .
-
Exam 2 instructions.
They are provided for your reading ahead of Exam 2.
Uploaded 03/10 .
C1. Midterm Performance and Exam Arrangements
C2. Exams and Solutions and HW clarifications
The programming project (PrP) will be posted in canvas Assignments.
Solutions are not ordinarily provided however.
Problem Sets (collection of Problem with some solutions)
are available in canvas Modules (at the very bottom after the last
module 13).
First read the textbook, your notes, practice
with the problems we did in class, and then and only then try
to solve these problems.
Midterm exam solutions in canvas
Quizzes or Announcements as needed.
Homework in canvas and solutions in canvas and through the
links below.
C4. Statistics.
C5. Previous Exams
Note.
The material covered in class changes from semester to semester and
will change in Fall 2021;
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. 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.
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 0 (Logistics)
A generic reference to Subject 0 refers to logistics of the course
available in the form of
-
(i) Document 0, a course outline,
-
(ii) Document 1, the syllabus,
-
(iii) Document 2, a CS Fundamentals review of a variety of
topics including Discrete Math, Continuous Math,
Number Systems, etc,
-
(iv) Document 3, Canvas Quiz usage and also
ProctorU Record+ proctoring of a Canvas exam.
All Documents are available in Canvas/Announcements,
and canvas.njit.edu access requires myUCID credentials.
Note that the Verification of Presence (VoP) or a
Homework is also setup as a canvas quiz.
The course FAQ is the last page of Document 0.
-
Subject 1
(Introduction to Data Structures and Algorithms)
[Document 3; Chapters 1, 2.1-2.3, 4.1-4.2, 5.1-5.2 of GT]
( Uploaded 01/07 )
Subject 1 old version
( Uploaded 12/22 )
Subject 1X
(Coronavirus Supplement: Parallel Computing introduction)
( Uploaded 12/22 )
-
Subject 2
(Growth of functions and recurrences)
[Document 3;Chapters 1 and 5.2 of GT]
( Uploaded 12/22 )
-
Subject 3
(Graphs and Trees)
[CS 505 and CS 506 material; Chapters 2.3, 5, 6.1-6.4 of GT]
( Uploaded 12/22 )
-
Subject 4
(Hash Tables)
[Chapters 2.5-2.7 (skip 2.5.6) of GT]
( Uploaded 12/22 )
-
Subject 5
(Binary Heaps, Priority Queues and HeapSort;
Huffman coding)
[Chapters 2.4, 5.1, and 9.3 of GT]
( Uploaded 12/22 )
-
Subject 6
(QuickSort and Linear-time sorting)
[Chapters 4 of GT]
( Uploaded 12/22 )
-
Subject 7
(Median and order statistics)
[Chapters 4 of GT]
( Uploaded 12/22 )
-
Subject 8
(Graph Algorithms)
[Chapters 4.2, 6 and 7 of GT]
( Uploaded 12/22 )
-
Subject 9
(Arithmetic Algorithms)
[Chapters 5.2.2 and 5.3 of GT]
( Uploaded 12/22 )
-
Subject 10
(Binary Search trees and balanced BST)
[Chapters 3 of GT]
( Uploaded 12/22 )
-
Subject 11
(Bounded depth search trees: 2-3-4-trees, B-trees)
[Chapters 3 and 14.1.2 of GT]
( Uploaded 12/22 )
-
Subject 12
String Matching
[Chapters of GT]
( Uploaded 12/22 )
-
Subject 13
(The theory of NP-completeness)
[Chapters 13.1 and 13.2 of GT]
( Uploaded 12/22 )
Last modified May 11, 2022, 10:01
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.