MFT

(1) Binding of instructions and data to memory addresses can be done at

____________
a) Compile time
b) Load time
c) Execution time
d) All of the mentioned//
(2) The ___________ must design and program the overlay structure.
a) programmer //
b) system architect
c) system designer
d) none of the mentioned
(3) The ___________ swaps processes in and out of the memory.
a) Memory manager //
b) CPU
c) CPU manager
d) User
(4) The run time mapping from virtual to physical addresses is done by a hardware
device called the ____________
a) Virtual to physical mapper
b) Memory management unit //
c) Memory mapping unit
d) None of the mentioned
(5) The base register is also known as the ____________
a) basic register
b) regular register
c) relocation register //
d) deallocation register
(6) Swapping requires a _________
a) motherboard
b) keyboard
c) monitor
d) backing store //
(7) The ________ consists of all processes whose memory images are in the backing
store or in memory and are ready to run.
a) wait queue
b) ready queue //
c) cpu
d) secondary storage
(8) The major part of swap time is _______ time.
a) waiting
b) transfer //
c) execution
d) none of the mentioned
(9) Swapping _______ be done when a process has pending I/O, or has to execute
I/O operations only into operating system buffers.
a) must
b) can
c) must never //
d) maybe
 (10) Swap space is allocated ____________
a) as a chunk of disk //
b) separate from a file system
c) into a file system
d) all of the mentioned.

Long Answers:
(11) Explain about given memory management techniques. (i) Partitioned allocation
(ii) Paging and translation look-aside buffer.
(12) Elaborate about the free space management on I/O buffering and blocking.
(13) When page faults will occur? Describe the actions taken by operating system
during page fault.
(14) Explain about the difference between internal fragmentation and external
fragmentation.
(15) Explain why sharing a re-entrant module is easier when segmentation is used
than when pure paging is used with example.
(16) Discuss situation under which the most frequently used page replacement
algorithm generates fewer page faults than the least frequently used page
replacement algorithm. Also discuss under which circumstances the opposite
holds.
(17) Most systems allow programs to allocate more memory to its address space
during execution. Data allocated in the heap segments of programs is an
example of such allocated memory. What is required to support dynamic
memory allocation in the following schemes? i) Contiguous memory allocation
ii)Pure segmentation iii) Pure paging
(18) Explain segmentation with paging with the help of a diagram.
(19) Assume that there are 3 page frames which are initially empty. If the page
reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using
LRU and optimal replacement.
(20) Consider a page reference string 7 0 1 2 0 3 0 4 2 3 0 3 1 2 0 1 7 of frame size
3.Find the number of page faults in LRU and optimal page replacement
algorithm. Also calculate the hit ratio and miss ratio.
(21) Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the number of frames in
the memory is 3. Find out the number of page faults in Optimal Page
Replacement Algorithm .
(22) Differentiate local and global page replacement algorithm.
(23) Explain the basic concepts of segmentation.
(24) Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, C212.3 BTL-3
6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Identify the no. of page faults would occur for
the following replacement algorithms, assuming one, two, three, four, five, six,
or seven frames? Remember all frames are initially empty, so your first unique
pages will all cost one fault each. a. LRU replacement b. FIFO replacement c.
Optimal replacement
(25) List the need of inverted page table.