Friday, 22 November 2019

UGC NET PAPER 2 June 2019 Question 48 (Shift-I)

48. A computer has six tapes drives with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
A 5
B 4
C 3
D 6
ANS. A

PreviousNext
UGC NET CS 2018 July - II Question 47UGC NET CS 2018 July - II Question 49

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

UGC NET Computer Science December 2019 | Question 16

Question 16 In a certain coding language. 'AEIOU' is written as 'TNHDZ'. Using the same coding language. 'BFJPV' wil...

Popular Posts