Scribd
Upload
760 views

Operating System Kcs-401. Question Bank À Unit-Iv: Memory Management

The document contains past year questions from an operating systems exam on the topic of memory management. It includes questions on paging, segmentation, page replacement algorithms, virtual memory, and solving fragmentation.

Uploaded by

Nishant Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
760 views

Operating System Kcs-401. Question Bank À Unit-Iv: Memory Management

The document contains past year questions from an operating systems exam on the topic of memory management. It includes questions on paging, segmentation, page replacement algorithms, virtual memory, and solving fragmentation.

Uploaded by

Nishant Mishra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OPERATING SYSTEM KCS-401.

QUESTION BANK à UNIT-IV : MEMORY MANAGEMENT

2018-19
1. What is the main function of the memory-management unit?
2. Define seek time and latency time.
3. Explain the logical address space and physical address space diagrammatically.
4. Illustrate the page-replacement algorithms (i) FIFO (ii) Optimal Page Replacement
use the reference string 7, 0,1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2,1, 2, 0, 1, 7, 0,1 for a memory
with three frames.
5. Explain Paging with example. Differentiate Paging and Segmentation.
6. Explain the difference between External fragmentation and Internal fragmentation.
How to solve the fragmentation problem using paging.

2017-18
1. Write the difference between internal and external fragmentation.
2. What are the disadvantages of single contiguous memory allocation?
3. Consider the following page reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur for the optimal page replacement algorithm,
assuming three frames and all frames are initially empty
4. What do you mean by Belady's anomaly? Which algorithm suffers from Belady,s
anomaly and how can it be rectified?
5. What is Thrashing? What is the cause of Thrashing? How does the system detect
Thrashing? What can the system do to eliminate this problem?

2016-17
1. What is Demand paging?
2. Explain Concept of Virtual Memory.
3. What is the cause of Thrashing? What steps are taken by the system to eliminate this
problem?

2015-16
1. State the cause of Thrashing and discuss its solution.
2. What are the different techniques to remove fragmentation in case of
multiprogramming with fixed partitions and variable partitions.
3. Consider the following reference string12342156212376321236. How many page
faults will occur for FIFO and LRU, assuming three and four frames in each case and
frames are initially empty.

2014-15
1. On a system using paging and segmentation, the virtual address space consists of upto
16 segments where each segment can be up to 216 bytes long. The hardware pages each
segment into 512 byte pages. How many bits in the virtual address space specify the
following :
i. Segment number
ii. Page number
iii. Offset within a page
iv. Entire virtual address space

Dr. Ragini Karwayun KCS-401 Question Bank


2. How many page faults will occur for the following reference string for four page frames
using LRU and FIFO algorithm : 1,2,3,4,5,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
3. Explain Segmentation with diagram.

2013-14
1. Consider a logical address space of eight pages of 1024 words each, mapped onto a
physical memory of 32 frames, then
i. How many bits are in logical address ?
ii. How many bits are in physical address ?
iii. Formulate logical and physical addresses.
2. Consider the following reference string12342156212376321236. How many page
faults will occur for FIFO and LRU, assuming three and four frames in each case and
frames are initially empty in each case.
3. What is Thrashing? State the cause of Thrashing and discuss its solution.
4. Write the difference between Paging and Segmentation.

2012-13
1. What is paging and segmentation?
2. What is Thrashing? State the advantages and disadvantages of Thrashing. Consider the
following reference string : 1,2,0,3,5,1,5,7,2,0,3,5,4,1,2,5,3,7. Implement FIFO, LRU
and optimal page replacement algorithms and calculate number of page faults using
three frames in memory.
3. On a simple paged system, associative registers (TLB) hold the most active page entries
and the full page table is stored in memory. If references satisfied by the TLB take 90
ns and references through the main memory page table take 220 ns, what is the effective
access time if 60% of all memory references find their entries in the TLB?
4. What are the different techniques to remove fragmentation in case of
multiprogramming with fixed partitions and variable partitions.
5. Suppose we have a processor with a hardware cache memory. Suppose a program is
run by the CPU and this produces 500,000 memory references, out of which 475,000
hits the cache memory. Suppose average memory access time is 70 ns and cache access
time 20 ns, of which 10 ns are for lookup. Suppose the system follows the write-through
policy. (a) What is the hit ratio? (b) What is the average memory reference time as seen
by the CPU if, (i) all the memory references are read, (ii) 80% of the memory references
are read, and (iii) 90% of the memory references are read.
6. In a segmentation based system, the main memory has the following holes in this
manner : 21K, 5K, 90K, 54K, 10K, 25K and 56K; there are three new requests for
memory of sizes 10K, 7K and 22K. The system does the requests in first come first
serve manner. Explain what holes will be taken for each of First fit and Best fit memory
allocation schemes.

Dr. Ragini Karwayun KCS-401 Question Bank

You might also like