What will be the number of page faults for the algorithms (FIFO, LRU and Optimal) for the following page reference string:

1,2,6,7,2,4,1,7,5,5,3,5,1,2,1,5,7,6,3

for a memory with 4 frames?

Write a monitor solution to the dining philosopher’s problem.

List the security attacks that cannot be prevented by encryption.

Consider the following jobs:

a) Using the SJF method, compute the completion times of the above jobs, average turnaround time and average waiting time.

b) Using the SRTF (Shortest Remaining Time first) method, compute the completion times of the above jobs, the average turnaround time and the average waiting time. Note that SRTF is SJF with preemption.

Completion time - arrival time = turnaround time

c) Using the Round Robin method (with Quantum = 3), compute the completion times of the above jobs and the average waiting time.

Explain the difference between scheduling and allocation of processor resources in a multiprocessor operating system. Identify the counterpart of each, if any, in a uniprocessor operating system. (1

Write and explain the Banker’s algorithm. Consider the following snapshot of a system

Answer the following questions using Banker's algorithm:

i. What is the content of the matrix need?
ii. Is the system in a safe state?
iii.If a request from P1 arrives for (0, 4, 2, 0), can the request be granted immediately?

Describe why authentication is important for file protection.

Discuss in detail the Process management, Memory management, I/O & File management and Security and Protection in Windows-11 Operating System.