Discuss in detail the I/O management, File management and Security and Protection in WINDOWS 11 Operating System.

On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request serviced was at track 345 and head is moving to track 0. The queue in FIFO order contains requests for the following tracks: 128, 870, 694, 470, 107, 378. Show the disk arm movement and calculate the number of tracks traversed using the following policies:

(a) FIFO (b) SSTF (c) SCAN (d) LOOK

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.

Write about the App management, APIs, behaviour changes (privacy, security and performance), flash memory management and Battery Resource Utilization in Android 13 Mobile Operating System.

Consider the following page-reference string:
1, 7. 6, 5, 4 , 3, 2, 1, 2, 3, 4, 2, 1, 3, 4, 6, 2, 1, 2, 3, 7, 6, 3, 2
How many page faults would occur for following replacement algorithms assuming four frames?
Remember that all frames are initially empty, so your first unique pages will all cost one fault each.
i. FIFO replacement.
ii. LRU replacement.
iii. Optimal replacemen

Consider the following jobs: