CST 206 :- OPERATING SYSTEMS

Module 5 Questions (By Year)

PART A

●​ June 2023(S)
○​ Q9: Explain the linked allocation of file allocation with merits and demerits. (3
marks)
○​ Q10: Point out the differences between C-SCAN and C-LOOK scheduling
algorithms. (3 marks)
●​ June 2023
○​ Q9: Discuss the steps in handling a page fault? (3 marks)
○​ Q10: How is disk formatting done? (3 marks)
●​ June 2022
○​ Q9: Define seek time, rotational latency and disk bandwidth of disks. (3 marks)
○​ Q10: Explain two level directory structure with the help of a diagram. (3 marks)
●​ July 2021
○​ Q9: Compare sequential access and direct access methods of storage devices. (3
marks)
○​ Q10: Write notes on disk formatting. (3 marks)
●​ January 2024
○​ Q9: Define the terms i) Seek time ii) Rotational delay iii) Disk bandwidth. (3 marks)
○​ Q10: Briefly explain about file attributes. (3 marks)
●​ December 2024
○​ Q9: Explain two level directory structure with an example. (3 marks)
○​ Q10: Define the terms seek time, rotational latency and transfer time. (3 marks)
●​ May 2024
○​ Q9: Explain single level directory structure with an example. (3 marks)
○​ Q10: Define the terms seek time, rotational latency and transfer time. (3 marks)

PART B

●​ June 2023(S)

○​ Q19: a) Explain FCFS, SSTF and SCAN disk scheduling algorithms, using the
given disk queue of requests: 20, 89, 130, 45 and 180. Assume that, the disk has
200 platters ranging from 0 to 199 and the current position of head is at cylinder
100. (9 marks)
○​ b) Explain the different methods used for keeping track of free disk space. (5 marks)
 ○​ Q20: a) There are 4 domains (D1, D2, D3, D4) and 4 objects (files F1, F2, F3, F4).
A process executing in D1 can read and write files F1, F3 and F4. A process in D4
can read F1, read & write F3 and execute 12. A process in D2/D3 can read F2 and
execute F4. A process in D1 can switch to D2 or D4. A process in D4 can switch to
D3. Draw the access matrix showing all these details. (7 marks)
○​ b) How can we make a new magnetic disk ready for use (to store files)? (7 marks)

●​ June 2023

○​ Q19: (a) List out the logical structures of a directory with figures. (5 marks)
○​ (b) With neat sketches illustrate the following disk space allocation algorithms (i)
Contiguous allocation (ii) Linked allocation (iii) Indexed allocation? (9 marks)

○​ Q20: (a) Discuss Protection. Write notes about the protection strategies provided for
files. (6 marks)
○​ (b) Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41,
122, 14, 124, 65, 67. The head is initially at cylinder number 53. The cylinders are
numbered from 0 to 199. Find out the total head movement incurred while servicing
these requests, if following scheduling algorithms are used- (i) FCFS (ii) SSTF (iii)
C-SCAN (iv) LOOK (8 marks)

●​ June 2022

○​ Q19: a) List and explain the different access methods for files. (4 marks)
○​ b) Describe linked and indexed allocation methods for files with the help of neat
diagrams. (10 marks)

○​ Q20: a) Suppose that a disk drive has 200 cylinders numbered from 0 to 199 and
the current position of the head is at cylinder 100. For the given disk queue of
requests: - 20, 89, 130, 45, 120 and 180, draw the head movement in FCFS, SSTF,
CSCAN disk scheduling algorithms and compute the total head movements (in
cylinders) in each. (9 marks)
○​ b) Describe the general scheme of using three classifications of users in connection
with file access control with the help of an example. (5 marks)

●​ July 2021

○​ Q19: a) Explain FCFS, SSTF and SCAN disk scheduling algorithms, using the
given disk queue of requests: 82, 170, 43, 140, 24, 16, 190. Find the total seek time
for each case. Assume that, the disk has 200 cylinders ranging from 0 to 199 and
the current position of head is at cylinder 50. (9 marks)
○​ b) Explain indexed allocation method with an example. (5 marks)
 ○​ Q20: a) Explain the different directory structures used in file system. (10 marks)b)
Different users may need different types of access to a file or directory. Explain the
most general scheme to implement identity-dependent access. (4 marks)

●​ January 2024

○​ Q19: a) Discuss the concept of Virtual File Systems? (8 marks)

○​ Q20: a) Assume that a magnetic disk has 400 cylinders (numbered 0 to 399). The
current position of the head is at cylinder 120. The request queue is 80, 130, 60,
230, 100, 300, 250, and 170. Draw the head movement in each of the following disk
scheduling algorithms and compute the total head movement in each case: (i)
SSTF (ii) SCAN (iii) LOOK (9 marks)b) What are the different access methods of
files? How are they implemented? (5 marks)

●​ December 2024

○​ Q19: a) Explain linked and indexed file allocation strategies mentioning each
method's advantages and disadvantages. (10 marks)
b) Explain access matrix with an example. (4 marks)

○​ Q20: a) Suppose that a disk drive has 200 cylinders numbered from 0 to 199 and
the current position of the head is at cylinder 100. For the given queue of requests:
- 20, 89, 130, 45, 120 and 180, draw the head movement in FCFS, SSTF and
C-SCAN disk scheduling algorithms and compute the total head movements (in
cylinders) in each. (9 marks)
○​ b) Explain different file access methods. (5 marks)

●​ May 2024

○​ Q19: Explain contiguous and linked file allocation strategies mentioning each
method's advantages and disadvantages. (10 marks)
○​ Q20: Explain different file attributes. (4 marks)

○​ Q21: Suppose that a disk drive has 200 cylinders numbered from 0 to 199 and the
current position of the head is at cylinder 100. For the given queue of requests: -
20, 89, 130, 45, 120 and 180, draw the head movement in FCFS, SSTF and
C-SCAN disk scheduling algorithms and compute the total head movements (in
cylinders) in each. (9 marks)
○​ Q22: Explain different file access methods. (5 marks)