Operating System Concepts
CGS 3763, Spring 2004
Homework Assignment #5
Due Wednesday, April 14th Name _________________
(at beginning of class)
Please read the following certification and sign where indicated:
I hereby certify that the answers I am submitting for this homework assignment are my own and
that I have not obtained answers from any other student. I also certify that I have not provided
my answers to any other student to copy or use as the basis for his/her homework. I understand
that cheating on this or any other assignment or test will immediately result in a score of “0” for
the assignment in addition to possible disciplinary action by the University. I also acknowledge
that I have read and understand the University’s policies regarding “Student Academic
Behavior” as provided at www.ucf.edu/goldenrule.
_________________________________
Student Signature
1) (5 pts) Segmentation is a memory management scheme that does not reflect the programmer’s
view of memory?
TRUE FALSE
2) (5 pts) Segmentation looks similar to contiguous allocation with multiple dynamic partitions if
an entire program is treated as a single segment.
TRUE FALSE
3) (5 pts) Segmentation requires which of the following:
a. Unique hardware for address translation
b. Special compilers to divide programs into segments and generate two-tuple logical
addresses (<segment, offset>).
c. The ability for the OS to track free space in the system (e.g., free space table)
d. External fragments to keep the segments separated.
e. none of the above.
4) (10 pts) Small page tables (and segment tables) can be kept in fast registers for quick reference.
If the number of pages for a particular process is large, the page table must be stored in
memory. Assuming a page table is in memory and there is no TLB, how many memory
accesses are required for each logical address referenced? What is retrieved during each
access?
Two (2) memory accesses are required for each referenced logical address:
1) The first access retrieves the page table entry (frame).
2) After computing the physical address (frame + offset), the second access retrieves the
actual data or instruction required by the program
