Assume that the three processes P1, P2 and P3 arrived at the time 0 in order, with burst time 6 ms, 4ms and 5 ms respectively. Compute the average TAT for each processes using scheduling algorithms RR(quantum=2ms), FCFS and SJF.
If FIFO page replacement is used with four page frames and eight pages, how many page faults will occur with the reference string 0172327103 if the four frames are initially empty? Now repeat this problem for LRU.
List and explain the advantages of DMA. Describe the structure of a disk.
Attempt any Eight questions
[8×5=40]Why do we need time sharing in operating system? Explain.
Define address space. Explain the limitations of batch system.
When an interrupt or a system call transfers control to the operating system, a kernel stack area separate from the stack of the interrupted process is generally used. Why?
How do you implement file system? Explain.
Can a thread ever be preempted by a clock interrupt? What is the biggest advantage of implementing threads in user space?
Explain the difference between internal fragmentation and external fragmentation. Which one occurs in paging systems?
Describe the working mechanism of any one disk scheduling algorithm with example.
Why do we need interrupt driven I/O? Justify.
A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer.Sonnet 4.6 HighClaude is AI and can mak