Register

Consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, Rand Shaving peak demands of 3, 6, a and b respectively. How many ordered pairs (a, b) are possible, such that the system is deadlock free?

1,183 views
0 votes
0 votes
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
4 answers
2
Prateek Dwivedi asked Jun 27, 2015
31,852 views
'm' processes share 'n' resources of same type. The maximum need of each process does not exceed 'n' and the sum all their maximum needs is always less than m+n. In this setup deadlock can occur or not?
This is a question from Operating System concepts by Silberschatz, Gagne and Galvin. On very first go I could make that in such a situation deadlock can never occur. But ...
User Avatar
0 votes
0 votes
0 answers
3
JustPakYt asked Nov 13, 2022
1,362 views
Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. a. If user A as public key YA=9 what is as private key XA? b. If user B has public key YB= 3 what is the shared secret key K?
Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. If user A as public key YA=9 what is as private key XA? If user B has public key YB= 3...
User Avatar
0 votes
0 votes
1 answer
4
M_Umair_Khan42900 asked Dec 29, 2022
791 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
User Avatar
Link Copied!