Scribd
Upload
22 views1 page

OS - Assignment No.2

The document is an assignment for the Operating System course at Shivajirao S Jondhale College of Engineering, covering various topics such as paging, disk scheduling algorithms, page replacement strategies, memory allocation methods, and key concepts like thrashing and TLB. It includes specific questions requiring explanations, calculations, and comparisons of different algorithms and methods. The assignment aims to assess students' understanding of operating system principles and their application in practical scenarios.

Uploaded by

Karuna Sawant
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
22 views1 page

OS - Assignment No.2

The document is an assignment for the Operating System course at Shivajirao S Jondhale College of Engineering, covering various topics such as paging, disk scheduling algorithms, page replacement strategies, memory allocation methods, and key concepts like thrashing and TLB. It includes specific questions requiring explanations, calculations, and comparisons of different algorithms and methods. The assignment aims to assess students' understanding of operating system principles and their application in practical scenarios.

Uploaded by

Karuna Sawant
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

Shivajirao S Jondhale College of Engineering, Dombivli (E)

Department of Computer Engineering


Operating System (CSC 403)
Semester – IV
Assignment No. 2

Q.1Explain the concept of paging with example.


Q.2 Suppose that the disk drive has 200 cylinders numbered 0 to 199.
Queue = 98, 183, 41,122,14,124,65,67.
The drive is currently serving a request at cylinder 54 and the previous request was at
cylinder 20. Find the total number of head movements needed to satisfy the requests for the
FCFS, SSTF and SCAN disk-scheduling algorithm?
Q.3 Calculate the hit and miss ratio for the following string using FIFO, Optimal page
replacement and LRU with frame size =3
Page string=2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 7, 2, 0, 7, 5, 0, 7, 5
Q.4 Explain MFT with example
Q.5 Explain file allocation methods in detail.
Q.6 Given 5 memory partitions of 100KB, 500 KB, 200KB, 300KB and 600 KB(in order).
How would first fit, best fit and worst fit algo place processes of
P1=212KB , P2=417KB, P3=112KB, P4=426KB (in order). Which algorithm makes the
most efficient use of memory ? use fixed sixe dynamic partitioning method.
Q.7 Differentiate between
1) Paging and Segmentation. 2)Internal fragmentation and External fragmentation
Q.8 Explain the following terms:
1) Thrashing
2) File Directories
3) TLB
4) Effect of Page Size
5) I/O Buffering techniques
Q.9 Describe disk scheduling algorithm with example.

You might also like