Q1. describe the critical section problem in detail with appropriate ex. As well describe the semaphore and its utilization.
Q2. Consider the given page reference string 1, 2, 3, 4, 2, 4, 5, 6, 3, 1, 2, 3, 4, 6, 4, 5, 2, 6.
Determine the number of page fault which occur supposing three frames for LRU and FIFO replacement algorithm?
Q3. Compare and contrast the Linux file system with window NT file system.
Q4. Describe any two disk scheduling algorithm in short.
Q5. What do you mean by Linked allocation strategy? Describe with an illustration.
Q6. Consider the given table:
Provide the schedule by using preemptive shortest job first (SJF).
a) Make Gantt chart for the above.
b) Compute the average waiting time for the same.