CS 481: Material for Test #1 |
Coverage in brief: everything covered since the beginning of the semester.
In more detail:
from the textbook:
Sections 1.1, 1.2, 1.4, and 1.5
all of Chapter 3 (but lightly: no code and no specific syntax for the various
calls -- just the concepts)
Sections 5.1 through 5.6 and 5.10 through 5.15 (again lightly: ignore the code
and the details of implementation, but retain the concepts)
Sections 6.4 and 6.9
Section 7.13
Sections 8.1 through 8.19 (we have yet to cover details of deadlock -- that's
for Tuesday)
from the class notes:
system modeling with queueing models
What to expect on the test: short questions about specific concepts (e.g., dispatching,
PCB, round-robin, preemption, quantum, exclusion, busy-waiting, atomic action,
rendez-vous, etc.); slightly longer questions asking you to choose one design
or policy over another (e.g., you are running CIRT: would you use SJF or RR as
scheduling policy?); questions asking you to compute something (e.g., with
system modeling or with overhead of preemption); questions asking you to show
a model (e.g., draw the state diagram for a 2-processor system with unequal machines and
a queue length of 10) -- and hundreds more, naturally ;-)