5 Questions
Which one of these is the most correct?
5
What must be the quantum q such that the overhead of context switching is minimized and at the same time each process is getting guaranteed execution on the CPU at least once in every t seconds?
q = (t - ns)/ (n-1)
Find the completion time of A under round robin scheduling with a time slice of one-time unit.
9
Paging suffers from what?
Internal fragmentation
What is the minimum number of processes in the system that may cause a deadlock?
4
This quiz tests your knowledge of deadlock and context switching in operating systems. It includes questions on the minimum number of processes that can cause a deadlock in a system and how to minimize the overhead of context switching in a round robin scheduling algorithm.
Make Your Own Quizzes and Flashcards
Convert your notes into interactive study material.
Get started for free
