Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur ?
| A. | 7 |
| B. | 9 |
| C. | 10 |
| D. | 13 |
|
Option: D Explanation : Click on Discuss to view users comments. |
The grammar ‘G1’
S ---> OSO| ISI | 0|1|∈
and the grammar ‘G2’ is
S ---> as |asb| X,
X -----> Xa | a.
Which is the correct statement ?
| A. | G1 is ambiguous, G2 is unambiguous |
| B. | G1 is unambiguous, G2 is ambiguous |
| C. | Both G1 and G2 are ambiguous |
| D. | Both G1 and G2 are unambiguous |
|
Option: B Explanation : Click on Discuss to view users comments. |
Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds ?
| A. | q ≤ (t – ns)/ (n – 1) |
| B. | q ≥ (t – ns)/ (n – 1) |
| C. | q ≤ (t – ns)/ (n + 1) |
| D. | q ≥ (t – ns)/(n + 1) |
|
Option: B Explanation : Click on Discuss to view users comments. |
