Consider the processes P1, P2, P3, P4 given in the below table, arrives for execution in the same order, with Arrival Time 0, and given Burst Time. Draw the Gantt chart and find the average waiting time using the FCFS and SJF (Non-Pre-emptive) scheduling algorithm.
What is paging? Explain LRU, FIFO and Optimal page replacement policy for the following string. Page frame size is 4. Calculate the hit ratio for the same.
Explain data structures used in banker’s algorithms with example.
What is system call? Explain any five system call in details.
Explain virtual memory concept with respect to paging, segmentation and TLB.
Write short note (Any Two)
Linux Virtual file system
Resource Allocation graph.
Readers and writer problem using Semaphore.
Compare disk scheduling algorithms.