CECS 326 – Operating Systems
Review for Final
The final is scheduled on Thursday, 12/15/05 at 10:15am – 12:15pm, in VEC-419.
The final is a closed-
book and closed-notes exam, and is cumulative and covers Chapters 1-4, 6-10 and parts of 11 and 12 of the
text by Gary Nutt, and all the lab projects on Linux.
To study for the final, you should review materials for
all the listed chapters, and concepts and techniques covered in the lab exercises and assignments that we
have done in the class.
I have included below review questions for Chapters 10-12, along with those for
Office hours during the final exam week
11:00am – 12:00pm
4:30pm – 5:30pm
4:00pm – 5:00pm
Exercise problems 1-4, 6, 7, 9, 11, and 13 on pp. 410-413.
Chapter 11 & part of Chapter 12:
Name two differences between logical and physical addresses.
Explain the difference between internal and external fragmentation.
Describe the following allocation algorithms:
A memory manager can sort the free list according to any criteria it chooses.
How would the free list be organized for the best-fit policy?
How would the free list be organized for the worst-fit policy?
How would the free list be organized for the first-fit policy?
How would the free list be organized for the next-fit policy?
Given memory partitions of 100KB, 500KB, 200KB, 300KB, and 600KB (in order), how would each of the first-
fit, best-fit, and worst-fit algorithms place processes of 212KB, 417KB, 112KB, and 426KB (in order)?
algorithm makes the most efficient use of memory?
A memory manager for a variable-sized partition strategy has a free list of blocks of size 600, 1000, 2200, 1600,
and 1050 bytes.
What block will be selected to honor a request for 1603 bytes using the best-fit policy?
What block will be selected to honor a request for 949 bytes using the best-fit policy?
What block will be selected to honor a request for 1603 bytes using the worst-fit policy?
What block will be selected to honor a request for 349 bytes using the worst-fit policy?
Assume the free list is ordered as the blocks are listed in the problem statement.
What block will be selected
to honor a request for 1603 bytes using the first-fit policy?