Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Process Synchronization
Recent questions tagged process-synchronization
0
votes
0
answers
61
unacademy gate 2023 cse aimt mock test 1
What is the issue with the following version of Dekker’s Algorithm: CSEnter(int i) { inside[i] = true; While(inside[j]) { inside[i] = false; while (turn == j) continue; inside[i] = true; } } CSExit(int k) { turn = j; inside[i]= false; } Deadlock is guaranteed b.Possibility of starvation c.Starvation never happen d.None of the above
What is the issue with the following version of Dekker’s Algorithm:CSEnter(int i){inside[i] = true;While(inside[j]){inside[i] = false;while (turn == j) continue;inside[...
sat0503
552
views
sat0503
asked
Dec 4, 2022
Operating System
process-synchronization
+
–
0
votes
1
answer
62
#strict_alteration #operating_system #process_synchronization
In a strict alteration , we use TURN variable and turn variable is shared variable .So,my doubt is that there's synchronisation problem as it is similar to producer consumer problem. While executing turn variable there might be preemption and it might cause inconsistency ? So how could strict alteration has this disadvantage?
In a strict alteration , we use TURN variable and turn variable is shared variable .So,my doubt is that there's synchronisation problem as it is similar to producer consu...
Srken
548
views
Srken
asked
Nov 20, 2022
Operating System
operating-system
process-synchronization
+
–
0
votes
1
answer
63
Process Synchronisation
What is the significance of infinite loop that is written in every example of process synchronisation? What would happen if there wasn't any infinite loop?
What is the significance of infinite loop that is written in every example of process synchronisation? What would happen if there wasn't any infinite loop?
ajayraho
910
views
ajayraho
asked
Oct 23, 2022
Operating System
operating-system
process-synchronization
semaphore
process-scheduling
inter-process-communication
+
–
1
votes
1
answer
64
Made Easy Test Series 2021: Operating System
Consider the following segment: Note : Assume the count = count + 1; will execute in 3' different instructions. Where, m[count] refers to memory value of count variable. Preemption can occur while executing the above instructions. Each of the tally function has a separate ... 15 b) Min = 2, Maximum = 15 c) Min = 1, Maximum = 15 d) Min = 15, Maximum = 15
Consider the following segment:Note : Assume the count = count + 1; will execute in ‘3’ different instructions.Where, m[count] refers to memory value of count variabl...
DebRC
1.0k
views
DebRC
asked
Sep 12, 2022
Operating System
operating-system
made-easy-test-series
context-switch
process-synchronization
+
–
1
votes
2
answers
65
Process synchronzation
A particular computation of counting semaphore is 7 Then 20p operation and x. V operation were completed on this semaphore If the final value of X will be 5 then what will be the value of x? Options a) 13 b) 18 C) 22 d) 2
A particular computation of counting semaphore is 7 Then 20p operation and x. V operation were completed on this semaphore If the final value of X will be 5 then what wi...
Vaishnavi Gadhe
715
views
Vaishnavi Gadhe
asked
Jul 2, 2022
Operating System
operating-system
process-synchronization
semaphore
+
–
0
votes
0
answers
66
In the "Intersted variable method" for synchronization is there a possiblity of deadlock or spinlock?
JAINchiNMay
230
views
JAINchiNMay
asked
Jun 23, 2022
Operating System
deadlock-prevention-avoidance-detection
operating-system
process-synchronization
+
–
3
votes
1
answer
67
BARC 2022
In Dining philospher problem, there are X number of dinners and Y number of chopsticks. What is the minimum number of chopsticks required to insure that there will be no deadlock? A) X B) Y - X C) Y - X + 1 D) [Y/2] + 1
In Dining philospher problem, there are X number of dinners and Y number of chopsticks. What is the minimum number of chopsticks required to insure that there will be no ...
Udit Narayan
502
views
Udit Narayan
asked
Apr 4, 2022
Operating System
barc-2022
operating-system
process-synchronization
+
–
0
votes
3
answers
68
Is priority inversion problem a case of deadlock?
I have read in some notes that priority inversion problem is a case of spin lock, not deadlock because in deadlock the processes are in blocked state, but here the processes are busy waiting and consuming memory. I have also read in a note ... different states. Which one of this is true? Is this problem a case of spin-lock or live lock or deadlock?
I have read in some notes that priority inversion problem is a case of spin lock, not deadlock because in deadlock the processes are in blocked state, but here the proces...
abhilashbal
1.5k
views
abhilashbal
asked
Mar 1, 2022
Operating System
operating-system
process-synchronization
+
–
12
votes
3
answers
69
GATE CSE 2022 | Question: 9
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\text{S}_{1}, \text{S}_{2},$ and $\text{S}_{3},$ operated upon using standard $\textsf{wait}()$ ... $\text{S}_{1} = 0; \text{S}_{2} = 1; \text{S}_{3} = 1$
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\t...
Arjun
9.0k
views
Arjun
asked
Feb 15, 2022
Operating System
gatecse-2022
operating-system
process-synchronization
semaphore
1-mark
+
–
2
votes
1
answer
70
GATE Overflow Test Series | Mock GATE | Test 6 | Question: 55
Consider the following synchronization solution. do { key = TRUE; while ( key == TRUE) atomic_swap (&lock, &key); <Critical Section> lock = FALSE; } while (TRUE); Here, atomic_swap ... appropriate choices) Race condition may be possible Mutual exclusion is guaranteed Progress is guaranteed Starvation freedom is guaranteed
Consider the following synchronization solution.do { key = TRUE; while ( key == TRUE) atomic_swap (&lock, &key); <Critical Section lock = FALSE; } while (TRUE);Here, atom...
Arjun
228
views
Arjun
asked
Jan 30, 2022
Operating System
go2025-mockgate-6
operating-system
process-synchronization
multiple-selects
2-marks
+
–
4
votes
0
answers
71
made east test series - synchronization - OS
Consider the following proposed solution to Dining Philosopher's problem to avoid deadlock. The binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. It will work fine. Removing (iii) ... fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.
Consider the following proposed solution to Dining Philosopher’s problem to avoid deadlock. The binary semaphore lock is initialized to 1.Which of the following is corr...
atulcse
988
views
atulcse
asked
Jan 19, 2022
Operating System
operating-system
process-synchronization
made-easy-test-series
concurrency
critical-section
+
–
2
votes
1
answer
72
NPTEL Assignment Question
Suppose we want to synchronize two concurrent processes P and Q
Suppose we want to synchronize two concurrent processes P and Q
rsansiya111
544
views
rsansiya111
asked
Dec 8, 2021
Operating System
nptel-quiz
operating-system
process-synchronization
binary-semaphore
+
–
3
votes
1
answer
73
Applied Test Series
Let S be a binary semaphore variable. Let S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. 5 P, 7 V, 10 P, 13 V, 17 P The number of blocked processes at the end are _________.
Let S be a binary semaphore variable. Let S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are perform...
LRU
591
views
LRU
asked
Oct 17, 2021
Operating System
test-series
operating-system
process-synchronization
binary-semaphore
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
16
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
