Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1991+operating-system+normal
9
votes
3
answers
1
GATE CSE 1991 | Question: 11,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] ... j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$.Pi; repeat flag[i] := true; while flag [j] or f...
Kathleen
4.1k
views
Kathleen
asked
Sep 12, 2014
Operating System
gate1991
process-synchronization
normal
operating-system
descriptive
+
–
43
votes
4
answers
2
GATE CSE 1991 | Question: 03-xi
Indicate all the false statements from the statements given below: The amount of virtual memory available is limited by the availability of the secondary memory Any implementation of a critical section requires the use of an indivisible machine- ... for some type of programs. The best fit techniques for memory allocation ensures that memory will never be fragmented.
Indicate all the false statements from the statements given below:The amount of virtual memory available is limited by the availability of the secondary memoryAny impleme...
Kathleen
10.6k
views
Kathleen
asked
Sep 12, 2014
Operating System
gate1991
operating-system
virtual-memory
normal
multiple-selects
+
–
8
votes
2
answers
3
GATE CSE 1991 | Question: 11,b
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag ... in which a waiting process can never enter the critical section? If so, explain and suggest modifications to the code to solve this problem
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$.Pi;repeat flag[i] := true; while flag [j] or fl...
go_editor
2.0k
views
go_editor
asked
Apr 18, 2016
Operating System
gate1991
process-synchronization
normal
operating-system
descriptive
+
–
24
votes
1
answer
4
GATE CSE 1991 | Question: 02-iii
Match the pairs in the following questions by writing the corresponding letters only. ...
Match the pairs in the following questions by writing the corresponding letters only.$$\begin{array}{|ll|ll|}\hline \text{(a)} & \text{Buddy system} & \text{(p)} & \tex...
Kathleen
5.7k
views
Kathleen
asked
Sep 12, 2014
Operating System
gate1991
operating-system
normal
match-the-following
runtime-environment
+
–
16
votes
1
answer
5
GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
Kathleen
3.1k
views
Kathleen
asked
Sep 12, 2014
Operating System
gate1991
operating-system
normal
precedence-graph
fill-in-the-blanks
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register