BCA Semester 4 – Operating System – Unit 5: Memory Management (7Hrs.)

Question 1

Given references to the following pages by a program 0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3. How many page faults will occur if the program has three page frames for each of the fo

Marks: 5

Year: 2020 Final TU FOHSS

How many page faults occur with 3 page frames for: a) FIFO b) LRU --- Short answer - a) FIFO → 8 page faults - b) LRU → 9 page faults --- Working / Trace (step-by-step) a) FIFO (3 frames) F

Question 2

Write short notes on any TWO : \ a) Producer Consumer problem \ b) Coalescing and Compaction \ c) Ubuntu

Marks: 5

Year: 2021 Final TU FOHSS

(a) Producer–Consumer Problem Definition The Producer–Consumer problem is a classical synchronization problem where producer processes generate data and place it in a shared buffer, while consumer pr

Question 3

Define the terms page fault and thrashing. Consider the following page reference string: 1, 3, 5, 1, 7, 1, 5, 5, 1, 4, 2, 7, 6, 3, 4, 1. How many page faults would occur for each of the following page

Marks: 10

Year: 2021 Final TU FOHSS

1. Definitions Page Fault A page fault occurs when a process tries to access a page that is not present in main memory (RAM), so the operating system must fetch it from secondary storage. Thrashing

Question 4

What is thrashing? Explain three memory management requirements?

Marks: 5

Year: 2022 Final TU FOHSS

Thrashing Thrashing occurs when a computer’s virtual memory system spends more time swapping pages in and out of memory than executing actual processes. - It happens when too many processes are load

Question 5

Given five memory partition of 100KB, 500KB, 200KB, 300KB and 600KB (in order). How would the first fit, best fit and worst fit algorithm place processes of size 212KB, 417KB,112KB, and 426KB (in orde

Marks: 5

Year: 2022 Final TU FOHSS

Given Data Memory Partitions (in order) - 100 KB, 500 KB, 200 KB, 300 KB, 600 KB Processes (in order) - P1 = 212 KB - P2 = 417 KB - P3 = 112 KB - P4 = 426 KB --- a) First-Fit Algorithm > Al

Question 6

How second chance page replacement algorithm differ from FIFO page replacement policy? Explain the concept of belay’s anomaly with suitable example.

Marks: 10

Year: 2022 Final TU FOHSS

1. Difference Between Second Chance and FIFO Page Replacement FIFO (First-In-First-Out) Page Replacement - Pages are replaced in the order they were loaded into memory. - Oldest page in memory is r

Question 7

Given memory partitions of 200k, 600k, 300k, 400k, and 700k (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 315k, 527k, 202k, and 548k (in order)? Wh

Marks: 5

Year: 2023 Final TU FOHSS

Given Data Memory Partitions (in order) - 200 KB, 600 KB, 300 KB, 400 KB, 700 KB Processes (in order) - P1 = 315 KB - P2 = 527 KB - P3 = 202 KB - P4 = 548 KB --- 1. First-Fit Algorithm > Al

Question 8

How paging can be used for memory management? Also differentiate it with segmentation.

Marks: 5

Year: 2024 Final TU FOHSS

How Paging is Used for Memory Management Paging is a memory management technique in which: - Logical (virtual) memory is divided into fixed-size blocks called pages. - Physical memory is divided into

Question 9

What are page faults and thrashing? Explain demand paging with protection bit.

Marks: 5

Year: 2024 Final TU FOHSS

1. Page Fault A page fault occurs when a process tries to access a page that is not currently present in main memory. The operating system then: - Suspends the process - Fetches the required page fr

Question 10

What is Belady's Anomaly in page replacement Algorithm? Explain with example. Consider the following page reference string:$7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1$

Marks: 10

Year: 2024 Final TU FOHSS

1. What is Belady’s Anomaly? Belady’s Anomaly is a phenomenon in which increasing the number of page frames results in an increase in the number of page faults for certain page replacement algorithms.