CS332 Notes and Exams : (Section 005 in Fall 2019)
Copyright by A. Gerbessiotis (2019-2020). All rights reserved.
The copyrighted material downloadable from this page is to be
used only by the students enrolled in CS332 under Prof. Gerbessiotis.
Distribution of this material outside this group is
NOT allowed for any reason.
C1. Midterm Performance and Exam Arrangements
C2. Homeworks, Exams and Solutions
Homeworks, as already explained in Section B, will be posted directly to moodle.
Solutions are not ordinarily provided however.
HW5 solution summary
Uploaded 12/11 √
C4. Statistics.
C5. Previous Exams
Note.
Note that material covered in class changes from semester to semester;
new material is being introduced as needed, and some other material may be
deemphasized or order of presentation changed. The material below is
provided as is: we do not discuss solutions nor do we provide clarifications nor
confirm or not proposed solutions.
C6. Notes (also known as Subjects)
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 CS332
offered by Dr. Gerbessiotis at the New Jersey Institute of Technology;
distribution outside this group of students is prohibited.
The material below will be uploaded in due time; an upload message will
appear as soon as the corresponding document is uploaded. Otherwise whatever appears
by clicking the corresponding link might be incomplete or incorrect.
An Errata file with typos.
Some of the slides (of the textbook) or mine presented information
that was changing from Chapter to chapter. I decided to put together
some concepts that might be confusing (or not) into a set of slides
and in some cases rewrite them or explaining them in more detail.
Use the result at your own discretion as supplementary material.
Clarification
-
Subject 0:
Logistics and overview of CS fundamentals
( Uploaded 08/30 )
-
Subject 1:
Computer systems overview (chapter 1)
( Uploaded 09/04 )
-
Subject 2:
Operating system overview (chapter 2)
( Uploaded 09/09 )
-
Subject 3:
Processes (chapter 3)
( Uploaded 10/01 )
Subject 3: Code (n3srcf19.tar)
(chapter 3)
( Uploaded 10/01 )
-
Subject 4:
Threads (chapter 4)
( Uploaded 10/04 )
Subject 4: Code (n4srcf19.tar)
(chapter 3)
( Uploaded 10/04 )
-
Subject 5:
Uniprocessor Scheduling (chapter 9)
( Uploaded 10/10 )
-
Subject 6:
Other Proc. scheduling (chapter 10)
( Uploaded 10/15 )
-
Subject 7:
Memory management (chapter 7)
( Uploaded 10/21 )
-
If you want to practice with page numbers and Chapter 7 material,
you may use the following comprehensive example.
Chapter 7 Study Example
Uploaded 10/31 √
Note that a solution key is provided (I hope i did not solve anything
wrong!) followed by the workflow that i used to deriving answers.
Be reminded that the relationship L=(P,T), where L is a logical address,
P is a page number, and T is an offset can also be viewed as an integer division
L = P * s + T, where s is the page size. Moreover P=L/s and T=L % s that is
P is the quotient and T is the remainder of the division of L by s.
-
Subject 8:
Virtual Memory (chapter 8)
( Uploaded 10/29, Reuploaded 10/31 adding at end 2 pages )
-
Subject 9:
I/O Management and Disk Scheduling (chapter 11)
( Uploaded 11/11 )
-
Subject 10:
File Management (chapter 12)
Addendum A brief for unix-like file systems
( Uploaded 11/11 )
-
Subject 11:
Concurrency: Mutual Exclusion and Synchronization (chapter 5)
( Uploaded 12/02 )
-
Subject 12:
Concurrency: Deadlock (chapter 6)
( Uploaded 12/02 )
-
Subject 13:
Operating System Security (chapter 15)
( Uploaded 12/02 )
Last modified Dec 20, 2019, 19:01