Operating System Quiz

Operating System Quiz

Operating System Quiz

Quiz

1 / 4

1. The strategy of making processes that are logically runnable to be temporarily suspended is called :
   1.   Non preemptive scheduling
   2.   Preemptive scheduling
   3.   Shortest job first
   4.   First come First served
2. The most optimal scheduling algorithm is :
   1.   FCFS – First come First served
   2.   SJF – Shortest Job First
   3.   RR – Round Robin
   4.   None of these
3. Which of the following condition is required for deadlock to be possible?
   1.   mutual exclusion
   2.   a process may hold allocated resources while awaiting assignment of other resources
   3.   no resource can be forcibly removed from a process holding it
   4.   all of the mentioned
4. Which one of the following is the deadlock avoidance algorithm?
   1.   banker’s algorithm
   2.   round-robin algorithm
   3.   elevator algorithm
   4.   karn’s algorithm