B.Tech.
(Computer Science and Engineering)
Semester-III
Subject: Operating System (BCO 0008A)
Marks: 64
Assignment #4
Section A Answer the following Questions: (5*2=10 marks)
Q.1[CO4] What is demand paging?
Q.2[CO4] Define memory management in UNIX.
Q.3[CO4] What is multi level paging?
Q.4[CO4] Mention briefly various swapping schemes.
Q.5[CO4] What is Memory Management?
Section B Answer the following Questions: (7x3=21Marks)
Q.1[CO4] What are the causes for page interrupt faults and how can they be resolved?
Q.2[CO4] What is the role of virtual memory in efficient memory management?
Q.3[CO4] Discuss the Impact and benefits of multi-level paging on memory management.
Section C Answer the following Questions: (11x3=33Marks)
Q.1[CO4] Explain memory fragmentation, differentiating between internal and external
fragmentation. Provide examples of how each type can occur and suggest strategies to mitigate their
impact on system performance.
Q.2[CO4] Explain the concept of segmentation in memory management. Discuss its advantages,
potential issues, and how it differs from paging. Provide examples to illustrate its practical use.
Q.3[CO4] Consider a page replacement algorithm with a reference string of length 20 and a fixed
number of frames set to 3. Using the reference string "7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1," analyze
and compare the performance of the FIFO (First-In-First-Out), LRU (Least Recently Used), and
Optimal page replacement algorithms. Calculate the number of page faults for each algorithm and
discuss their strengths and weaknesses.