Time Left - 10:00 mins

GATE CS 2018 - Operating System Daily Quiz- 6 (Deadlock)

Attempt now to get your rank among 789 students!

Question 1

A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:
 
Which of the following best describes current state of the system ?

Question 2

Is mutual exclusion guaranteed for R1 and R2? If not, show a possible interleaving of the statements of P1 and P2 such that mutual exclusion is violated (i.e., both P1 and P2 use R1 or R2 at the same time).

Question 3

Can deadlock occur in the above program? 

Question 4

Exchange the statements Q1 and Q3 and statements Q2 and Q4. Is mutual exclusion guaranteed now? Can deadlock occur?

Question 5

Which of the following scheduling algorithms is non-preemptive?
  • 789 attempts
  • 2 upvotes
  • 16 comments
Apr 1GATE & PSU CS