Scribd
Upload
2 views8 pages

(Operating Systems) File System DPP Discussion Notes

The document contains discussion notes on operating systems, specifically focusing on file systems and disk management. It includes various questions related to disk block occupancy, directory entries, inode structures, file allocation methods, and disk scheduling algorithms. Each question requires calculations or reasoning based on given parameters to determine the outcomes related to disk usage and performance.

Uploaded by

jeelpatel153312
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
2 views8 pages

(Operating Systems) File System DPP Discussion Notes

The document contains discussion notes on operating systems, specifically focusing on file systems and disk management. It includes various questions related to disk block occupancy, directory entries, inode structures, file allocation methods, and disk scheduling algorithms. Each question requires calculations or reasoning based on given parameters to determine the outcomes related to disk usage and performance.

Uploaded by

jeelpatel153312
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/ 8

CS & IT

ENGINEERING
Operating System

File System
DDP Discussion Notes By- Anjnee Bhatnagar ma’am
[NAT]
#Q. A particular disk unit uses a bit string to record the occupancy or vacancy
of its disk blocks with ‘0’ denoting occupied block and ‘1’ denoting vacant
block. A 32-bit part of this string has Hexadecimal value of AC0121DE. The
percentage of occupied blocks on the disk for this part is ____ % (rounded
to 1 decimal place)?
[NAT]
#Q. A system directory is kept in 2 disk blocks each of size 4Kbytes. It is a
single level-directory and each directory entry is of size 64-bits. The
maximum number of files possible in this system is _____k?
[NAT]
#Q. The index node (inode) of a unix-like file system has 10 direct, one single-
indirect, one double-indirect and one triple-indirect pointer. The disk
block size is 2KB and disk block addresses 64-bits. The maximum possible
file size (rounded off to nearest integer) is _______ GB?
[MSQ]
#Q. Consider a file which is stored on disk with either contiguous file
allocation method or linked file allocation method or indexed file
allocation method. The file is stored on 100 blocks. Which of the following
will take minimum number of disk block accesses of the file for insertion
of a new block?

A Insertion of a new block at starting if file is stored using contiguous file


allocation method.

B Insertion of a new block after 50th block of file if file is stored using linked
file allocation method.
C Insertion of a new block in the end if file is stored using indexed file
allocation method.

D Insertion of a new block in the end if file is stored using contiguous file
allocation method.
[NAT]
#Q. Consider a disk with 6 platters each with 2 recording surfaces and 100
cylinders (numbered as 0, 1, 2 …., 99). The following 6 disk requests (for
cylinder number) are received by disk controller at the same time:
61, 88, 23, 37, 12, 93
Currently the head is positioned at cylinder number 50 and is moving
towards higher cylinder numbers. The average seek time in moving head
over 3 cylinder is 2 milliseconds and for reversing the direction of the
head once is 5 millisecond. The total seek time to satisfy all the above
requests using the Shortest seek time first disk scheduling algorithm is
_______?
[NAT]
#Q. Consider a disk with 60 cylinders (numbered 0, 1, 2 ….59). Disk requests
are made for a disk drive for cylinders 5, 25, 18, 3,39, 8 and 35 in that
order. Assume that the arm is current at cylinder 20 and moving towards
higher cylinder numbers. The above all requests are serviced using scan
algorithm. The number of head movements are ______?
THANK - YOU

You might also like