Scribd
Upload
9 views1 page

BCS-401 Assignment No 4 OS NSA

The document is an assignment for an Operating Systems course (BCS401) for students in the ST & IV semester, focusing on various key concepts such as spooling, locality of reference, thrashing, virtual memory, paging, and page-replacement algorithms. It includes detailed questions requiring explanations and comparisons of these topics, as well as practical examples and illustrations. Additionally, it requests short notes on fragmentation, memory protection, and related concepts.

Uploaded by

Yuvika Miglani
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
9 views1 page

BCS-401 Assignment No 4 OS NSA

The document is an assignment for an Operating Systems course (BCS401) for students in the ST & IV semester, focusing on various key concepts such as spooling, locality of reference, thrashing, virtual memory, paging, and page-replacement algorithms. It includes detailed questions requiring explanations and comparisons of these topics, as well as practical examples and illustrations. Additionally, it requests short notes on fragmentation, memory protection, and related concepts.

Uploaded by

Yuvika Miglani
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/ 1

Subject Name: Operating System Code: BCS401

Class & Semester: ST & IV Branch: CS/AIML

ASSIGNMENT-NO. 4

Que 1: What do you mean by Spooling? Explain in detail


.Que 2: What do you mean by Locality of reference? Explain in detail.
.Que 3: What do you mean by thrashing? Explain in detail.
Que 4: Explain the concepts of virtual memory concepts including address translation, page table and demand paging
mechanisms in detail.
Que 5: Explain Paging with example. Differentiate Paging and Segmentation.

Que 6: Illustrate the following 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.
Que 7: Compare and contrast multiprogramming with fixed and variable partitions?
Que 8: Write short notes on
i) Fragmentation
ii) Locality of Reference
iii) Protection of contiguous Memory
iv) Protection of Paging
v) Structure of Page table
vi) Page Fault and Swapping

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy