SRM University 2007 B.Tech Computer Science and Engineering BANK : OPERATING SYSTEMS - Question Paper

2.With an example, discuss overlays.
3.What do you mean by swapping?
4.What requirements are memory management intended to satisfy?
5.Why is the capability to relocate processes desirable?
6.Why is it not possible to enforce memory protection at compile time?
7.What are a few reasons to allow 2 or more processes to all have access to a particular region of memory?
8.In a fixed partitioning scheme, elaborate the advantages of using unequal size partitions?
9.What is the difference ranging from internal and external fragmentation?
10.Given memory partitions of 100KB,500KB,200KB,300KB,and 600KB in that order, how would every of the first-fit,best-fit, and worst-fit algorithms place the processes of 212KB,417KB,112KB,and 426KB(in order)?Which algorithm makes most efficient use of memory?
11.Describe first-fit allocation algorithm.
12.Describe best-fit allocation algorithm.
13.What are the distinctions among logical, relative, and physical addresses?
14.What is the difference ranging from a page and a frame?
15.What is the difference ranging from a page and a segment?
16.Consider a logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames.
a)How many bits are in the logical address?
b)How many bits are in the physical address?
17.Consider a paging system with the page table stored in memory.If a memory reference takes 200 nanoseconds,how long does a paged memory reference take?
18.What is the effect of allowing 2 entries in a page table to point to the identical page frame in memory?
19.Consider the segment table:
segment base length
0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96

elaborate the physical addresses for the subsequent logical addresses?
a)0430 b)2500
20.Consider the segment table:
segment base length
0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96

elaborate the physical addresses for the subsequent logical addresses?
a)0430 b)4112

21.What is the difference ranging from simple paging and virtual memory paging?
22.Explain LRU page replacement algorithm.
23.Explain FIFO page replacement algorithm
24.Consider the subsequent page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6
How many page fault would occur for LRU page replacement algorithm assuming three frames?
25. Consider the subsequent page reference string:

Earning:   Approval pending.