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 the parent page elsewhere.
C0. Updated version of Canvas files
Updated Canvas document might be located
here (eg Webex Meeting info). Originals appear in Canvas/Announcements
or Canvas/Modules. Canvas has synchronization issues, so a document
posted in Canvas will never be updated.
Updated Canvas documents will be made available in this section.
Canvas has synchronization problems when a document gets 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 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.
-
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 .
C1. Midterm Performance and Exam Arrangements
C2. Exams and Solutions
The programming project (PrP) will be posted in canvas Assignments.
Solutions are not ordinarily provided however.
A number of practice problems will be posted periodically with
some solution outlines. First read the textbook, your notes, practice
with the problems we did in class, and then and only then try to solve
these problems. They will be posted in canvas Modules.
Exams in canvas Quizzes, and Midterm exam solutions in canvas
Quizzes or Announcements as needed.
Homework (sample and summary) solutions either through canvas or 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 setup as
a canvas quiz.
The course FAQ is the last page of Document 0.
-
Subject 1 (Introduction to Data Structures and Algorithms)
[Document 2; Chapters 1, 2.1-2.3, 4.1-4.2 of GT]
( Uploaded 08/18 )
Subject 1X (Coronavirus Supplement: Parallel Computing introduction)
( Uploaded 08/18 )
-
Subject 2 (Growth of functions and recurrences)
[Document 2;Chapters 1 and 5.2 of GT]
( Uploaded 08/18 )
-
Subject 3 (Graphs and Trees)
[CS 505 and CS 506 material; Chapters 6.1-6.4 of GT]
( Uploaded 08/18 )
-
Subject 4 (Hash Tables)
[Chapters 2.5 (skip 2.5.6) of GT]
( Uploaded 08/18 )
-
Subject 5 ((Binary) Heaps, Priority Queues and HeapSort.
Huffman Coding)
[Chapters 2.4 and 9.3 of GT]
( Uploaded 08/18 )
-
Subject 6 (QuickSort and Linear-time sorting)
[Chapters 4 of GT]
Typo on pdfslide 18/slide 15 of the handwritten note: the average number
of comparisons (2+3+3+2+3+3) is indicated as 20, it should be 16!
( Uploaded 08/18 )
-
Subject 7 (Median and order statistics)
[Chapters 4 of GT]
( Uploaded 08/18 )
-
Subject 8 (Graph Algorithms)
[Chapters 6 and 7 of GT]
( Uploaded 08/18 )
-
Subject 9 (Arithmetic Algorithms)
[Chapters 5.2.2 and 5.3 of GT]
( Uploaded 08/18 )
-
Subject 10 (Binary Search trees and balanced BST)
[Chapters 3 of GT]
( Uploaded 08/18 )
-
Subject 11 (Bounded depth search trees: 2-3-4-trees, B-trees)
[Chapters 3 of GT]
( Uploaded 08/18 )
-
Subject 12 String Matching
[Chapters of GT]
( Uploaded 08/18 )
-
Subject 13 (The theory of NP-completeness)
[Chapters 13.1 and 13.2 of GT]
( Uploaded 08/18 )
Last modified Dec 18, 2021, 20:21
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.