Shantilal Shah Engineering College, Bhavnagar
Department of Information Technology
Semester: B.E. Semester 4th
Course Name: (3141601) Operating System and Virtualization
Assignment No. : 3
Total Marks: 20
Que.
Question Statement
No.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
Define MMU and list out function of MMU.
Explain concept of Memory protection using base and limit
registers.
Define Compile time, Load time and Execution time binding.
Differentiate Logical Address v/s Physical Address.
Explain Swapping in brief with example.
Explain Contiguous Memory Allocation Single process monitor
Explain Contiguous Memory Allocation multiprogramming with fixed
partition.
Explain Contiguous Memory Allocation multiprogramming with
dynamic memory partition.
Differentiate Contiguous and Noncontiguous memory allocation.
Explain the following allocation algorithms: 1) First-fit 2) Best-fit 3)
Worst-fit with example.
Explain Fragmentation. Difference between Internal and External
Fragmentation.
Explain Compaction in details.
Explain Paging in details.
-Explain the structure of a page table entry. If a machine has 48 bit
virtual addresses and 32-bit physical addresses and pages are of 8
KB, how many entries are needed for the page table?
Explain TLB in details.
-Consider paging system with TLB, all page reference are found 75%
times the TLB, if 100ns are required for single memory reference and
20ns are required for TLB search then calculate the effective memory
access time?
Explain Multilevel Paging or Hierarchical Paging in details.
Explain Inverted Page Table (IPL) in details.
Explain Segmentation in details.
Differentiate Paging v/s Segmentation.
Consider a computer system with a 32-bit logical address and 4-KB
page size. The system supports up to 512-MB of physical memory.
How many entries are there in each of the following? Analyse which
one is efficient.
a. A conventional single-level page table
b. An inverted page table
Explain Virtual Memory in details.
Explain concept of Demand Paging in memory management.
Course
RBT
Outcome
Levels
3
3
1, 2
2
3
3
3
3
3
1, 2
2
2
2
2
3
2
3
3
2
2
3
2
3
3
2
2, 3
3
2, 3
3
3
3
3
3
2
2
2
2
3, 4
3
3
2
2
22.
23.
24.
25.
Consider the following reference string. Calculate the page fault rates
for below page replacement algorithm. Assume the memory size is 4
page frame.
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2
1. FIFO
2. LRU
3. OPTIMAL
Which algorithm is efficient?
Define Belady’s anomaly. Explain with suitable example.
Differentiate FIFO, LRU and Optimal Page replacement algorithm
Explain Thrashing in details.
3
2, 3
3
3
3
2
2
2
# refers to the Semester Number in Roman Digits
RBT Levels :1 – Remembering, 2 – Understanding, 3 – Applying, 4 – Analysing, 5 - Evaluating, 6 – Creating