Register

Test Series Question

880 views
0 0 votes

What should be the answer?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · GATE-2019Next → · Grammer
← Previous in category · NIELIT 2018-38Next in category → · Page Size v/s Page f...
Position:
Show:

Related questions

3 3 votes
1 1 answer
160
160 views
GO Classes asked Aug 26
160 views
GO Classes DPP | GATE CS | Operating System | Deadlock Resource Graph
Consider the resource allocation graph below consisting of four tasks $(\text{T1}$, $\text{T2}$, $\text{T3}$, and $\text{T4})$ and three resources $(\text{R1}$, $\text{R2...
3 3 votes
1 1 answer
142
142 views
GO Classes asked Aug 21
142 views
GO Classes DPP | GATE CS | Operating System | Minimum Deadlocked Processes
A system contains three distinct critical resources: $R_1,R_2,R_3$ shared by four processes.Their resource requirements are:$P_1$ requires $R_1$ and $R_2$.$P_2$ requires ...
3 3 votes
1 1 answer
124
124 views
GO Classes asked Aug 21
124 views
GO Classes DPP | GATE CS | Operating System | Preemptible Resource Deadlock
In a multiprocessor system with preemptive scheduling, three processes $P_1,P_2,P_3$ share resources $R_1,R_2,R_3$.$P_1$ and $P_2$ compete for $R_1$. $P_2$ and $P_3$ comp...
3 3 votes
1 1 answer
114
114 views
GO Classes asked Aug 21
114 views
GO Classes DPP | GATE CS | Operating System | Wait-For Graph
In the wait-for graph for transactions $A$ through $G$ shown below, which option lists all transactions that are in a permanent waiting state?Here, an edge $X \to Y$ in t...