0% found this document useful (0 votes)
6 views2 pages

Module 5 QB

The document contains a series of questions and tasks related to file attributes, file access methods, RAID levels, directory structures, and disk scheduling algorithms. It covers definitions, comparisons, and calculations involving various file system concepts and RAID architectures. Additionally, it includes practical problems for calculating disk head movements using different scheduling algorithms.

Uploaded by

theace1724
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
0% found this document useful (0 votes)
6 views2 pages

Module 5 QB

The document contains a series of questions and tasks related to file attributes, file access methods, RAID levels, directory structures, and disk scheduling algorithms. It covers definitions, comparisons, and calculations involving various file system concepts and RAID architectures. Additionally, it includes practical problems for calculating disk head movements using different scheduling algorithms.

Uploaded by

theace1724
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

Part A

1. Name various file attributes in the below mentioned picture and its usage.
2. List any four file attributes with their purpose.
3. Define sequential file access method.
4. Mention different file operations supported by OS.
5. Define file protection attributes.
6. List the various file access methods.
7. Mention the different types of file access methods.
8. Define file ownership and permissions.
9. List the metadata stored in file attributes.
10. Mention various file allocation methods.
11. Define file access permissions.
12. List different directory attributes.
13. Define seek time and latency time to access the data stored in sector 's'.
14. The figure below shows the properties of a file stored in an operating system.
Name any four file attributes and mention their purpose.
15. State the difference between RAID 0 and RAID 1 in terms of data storage and fault
tolerance.
16. Compare RAID 1 and RAID 5.
17. Differentiate striping and mirroring in RAID.
18. Compare RAID 0 and RAID 10.
19. Compare RAID 2 and RAID 3.
20. Differentiate RAID 4 and RAID 5.
21. Compare RAID levels based on redundancy.
22. Compare RAID 0 and RAID 6.
23. Compare RAID 1 and RAID 10.
24. Differentiate RAID 3 and RAID 5.
25. Compare RAID 0, RAID 1, and RAID 5.
26. State the difference between RAID 5 and RAID 6 in terms of parity and fault
tolerance.

PART B
1. Explain the different types of directory structures in operating systems with neat
diagrams. Discuss their advantages and disadvantages.
2. Examine the architecture of RAID levels with suitable diagrams and examples.
Compare RAID 0, RAID 1, and RAID 5.
3. Discuss various file allocation methods used in operating systems. Explain their
merits and demerits with suitable examples.
4. Explain the organization of file systems in operating systems. Discuss file attributes,
file operations, and access methods in detail.
5. Analyze different disk scheduling algorithms such as FCFS, SSTF, and SCAN with
suitable examples and performance comparison.
6. Explain the working principle of RAID storage techniques with neat diagrams.
Discuss the role of redundancy and fault tolerance in RAID systems.

PART C
1. The disk head is currently at cylinder 40. The queue of pending requests is:
98, 183, 37, 122, 14, 124, 65, 67
Assume the disk has 200 cylinders (0–199).

a) Calculate the total head movement for:


i) FCFS
ii) SSTF

b) Compare the performance of both algorithms.

2. The disk head is currently positioned at cylinder 55. The pending requests are:
90, 160, 35, 120, 15, 130, 70, 80
Disk size = 200 cylinders (0–199).

a) Compute the total head movement using:


i) FCFS
ii) SCAN (towards 0)

b) Analyze the performance of the algorithm based on the calculations.

4. The disk arm is currently at cylinder 70. The pending request queue is:
25, 130, 85, 190, 40, 150, 10, 95
Assume the disk contains 200 cylinders.

a) Determine the total head movement using:


i) FCFS
ii) LOOK

b) Discuss the advantages of LOOK over FCFS.

5. A hard disk has 500 cylinders numbered 0–499. The current head position is 120. The
request queue is:
30, 180, 75, 220, 15, 260, 90, 140

a) Compute the total head movement for:


i) FCFS
ii) SCAN (towards higher cylinders)

b) Compare the performance of both algorithms based on seek time.

You might also like