Recent questions tagged process-synchronization / GATE Overflow for GATE CSE

25 votes

6 answers

151

GATE CSE 2019 | Question: 23
Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ ... values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ______

Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ $$\begin{array}{|c|c|c|} \...

Arjun

17.1k views

Arjun asked Feb 7, 2019

30 votes

7 answers

152

GATE CSE 2019 | Question: 39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$

Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all...

Arjun

12.4k views

Arjun asked Feb 7, 2019

2 votes

1 answer

153

Is priority inversion and spinlock same?

Soham Mukherjee

1.6k views

Soham Mukherjee asked Jan 24, 2019

3 votes

1 answer

154

Ace Test Series: Operating System - Deadlock

Na462

701 views

Na462 asked Jan 21, 2019

3 votes

4 answers

155

Ace Test Series: Operating System - Reader Writer Problem

Na462

1.9k views

Na462 asked Jan 21, 2019

1 votes

1 answer

156

ME & Deadlock - Semaphores
Will there be Mutual Exclusion & Deadlock ?

Will there be Mutual Exclusion & Deadlock ?

SamAddy

767 views

SamAddy asked Jan 20, 2019

3 votes

1 answer

157

MadeEasy CBT Test 2019: Operating System - Process Syncronization
Consider the below code for synchronizing the classical readers and writers. int rc = 0; int c = 0; Semaphore mutex =1; Semaphore db =1; void Reader(void) { L1: down (mutex): if (c ! = 0 && rc! = 0) { up ... the database at the same time. c) more than one writers can access the database at the same time. d) None of these.

Consider the below code for synchronizing the classical readers and writers. int rc = 0; int c = 0; Semaphore mutex =1; Semaphore db =1; void Reader(void) { L1: down (mut...

shaz

794 views

shaz asked Jan 16, 2019

1 votes

1 answer

158

Applied Course | Mock GATE | Test 1 | Question: 22
Consider there are $3$ threads T1, T2, and T3. And there are $4$ locks L1, L2, L3, and L4. T1 acquires and releases the locks L1 and L2. T2 acquires and releases the locks L1 and L3. T3 acquires and releases the ... runs concurrently to completion and then T3 runs. T1 and T3 runs concurrently to completion and then T2 runs. None of the above.

Consider there are $3$ threads T1, T2, and T3. And there are $4$ locks L1, L2, L3, and L4.T1 acquires and releases the locks L1 and L2.T2 acquires and releases the locks ...

Applied Course

485 views

Applied Course asked Jan 16, 2019

1 votes

0 answers

159

MadeEasy Subject Test 2019: Operating System - Process Syncronization
Fails to Guarantee mutual exclusion Guarantee mutual exclusion and prevents deadlock Fails to prevent deadlock Fails to guarantee mutual exclusion and fails to prevent deadlock

Fails to Guarantee mutual exclusion Guarantee mutual exclusion and prevents deadlockFails to prevent deadlockFails to guarantee mutual exclusion and fails to prevent dead...

snaily16

496 views

snaily16 asked Jan 12, 2019

0 votes

1 answer

160

Operating system test zeal
Consider a paged virtual memory system with 32-bit virtual addresses and 1K-byte pages. Each page table entry requires 32 bits. It is desired to limit the page table size to one page. One page table size is smaller. The smaller page size could be used at the top level or the ... .......... respectively. 1. 8321, 32987 2. 16,641, 65,973 3. 64, 256 4. 4161, 16494

Consider a paged virtual memory system with 32-bit virtual addresses and 1K-byte pages. Each page table entry requires 32 bits. It is desired to limit the page table size...

Prince Sindhiya

346 views

Prince Sindhiya asked Jan 6, 2019

1 votes

1 answer

161

Testbook Test Series: Operating System - Process Synchronization
Que- Consider the following statements about the dining philosopher problem. 1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers. 2. If the asymmetric solution is implemented then $1^{st}$ philosopher picks up her right ... above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above

Que- Consider the following statements about the dining philosopher problem.1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers.2. If the asymme...

Soumya29

798 views

Soumya29 asked Jan 6, 2019

0 votes

0 answers

162

UPPCL AE 2018:52
Consider the following implementation as a solution to the critical section problem for two processes $\text{P}_{0}$ and $\text{P}_{1}$ with id $0$ and $1,$ respectively. int flag[2] = {0,0}; int turn = 0; void lock (int id) /* ... exclusion is guaranteed Mutual exclusion is guaranteed if $\text{S1}$ and $\text{S2}$ are interchanged Solution leads to a deadlock None of the above

Consider the following implementation as a solution to the critical section problem for two processes $\text{P}_{0}$ and $\text{P}_{1}$ with id $0$ and $1,$ respectively....

admin

211 views

admin asked Jan 5, 2019

0 votes

0 answers

163

UPPCL AE 2018:51
Consider the following code. int count = 0; void *thfunc () { int ctr = 0; for(ctr=0; ctr<100; ctr++) count++; } If thfunc is executed by two threads concurrently in a uniprocessor system, what will be the $\textbf{MINIMUM}$ value of count when both threads complete ... increament $\text{R},$ and (iii) store the value of $\text{R}$ in memory. $200$ $100$ $2$ None of the above

Consider the following code.int count = 0; void *thfunc () { int ctr = 0; for(ctr=0; ctr<100; ctr++) count++; }If thfunc is executed by two threads concurrently in a unip...

admin

240 views

admin asked Jan 5, 2019

1 votes

0 answers

164

UPPCL AE 2018:3
Consider the C program as below. There is a problem with this program which could lead to a cyber-attack on the program: #include<stdio.h> #include<string.h> #include<stdlib.h> intmain(intargc, char*argv[]) { char ... 0; } What kind of problem is it? Format String Vulnerability Problem Heap Overflow Problem Integer Overflow Problem Buffer Overflow Problem

Consider the C program as below. There is a problem with this program which could lead to a cyber-attack on the program:#include<stdio.h #include<string.h #include<stdlib...

admin

305 views

admin asked Jan 5, 2019

2 votes

3 answers

165

MadeEasy Test Series: Operating System - Process Synchronization
P1 terminates but P2 does not P2 terminates but P1 does not Both P1 and P2 terminate Neither P1 nor P2 terminate

P1 terminates but P2 does notP2 terminates but P1 does notBoth P1 and P2 terminateNeither P1 nor P2 terminate

Sambhrant Maurya

1.5k views

Sambhrant Maurya asked Jan 3, 2019

2 votes

2 answers

166

UGC NET CSE | December 2018 | Part 2 | Question: 69
To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true? Writers are given exclusive access to shared objects. Readers are given exclusive access to shared objects. Both Readers and Writers are given exclusive ... the code given below : $Code:$ (i) only (ii) only (iii) only Both (ii) and (iii)

To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?Writers are given exclusive access to shared obje...

Arjun

2.7k views

Arjun asked Jan 2, 2019

1 votes

0 answers

167

MadeEasy Test Series: Operating System - Process Synchronization
Consider the following 2 functions P and Q which share 2 common variables A and B: P() Q() { { A=A+5; A=B+6; B=A-3; B=A-2; } } If P and Q execute concurrently, the initial value of A=2 and B=3 then the sum of all different values that B can take ____ (do not count B=3) Why have they taken intermediate values of B like 4..? :/

Consider the following 2 functions P and Q which share 2 common variables A and B:P() Q() { { A=A+5; A=B+6; B=A-3; B=A-2; } }If P and Q execute concurrently, the initial ...

MiNiPanda

732 views

MiNiPanda asked Jan 1, 2019

3 votes

0 answers

168

Ace Test Series: Operating System - Minimum value Of Critical Data
Ans:2

Ans:2

amitqy

929 views

amitqy asked Dec 26, 2018

2 votes

1 answer

169

self doubt Deadlock
is there deadlock in the concurrent execution of two thread given below? void laurel() { lock_acquire(mutex); /* do something */ lock_acquire(file1); /* write to file 1 */ lock_acquire(file2); /* write to file 2 */ lock_release(file1); lock_release(mutex); ... (file1); lock_release(mutex); } i'm not getting any deadlock. please comment below if you find any. *Idon't have answer.

is there deadlock in the concurrent execution of two thread given below?void laurel() { lock_acquire(mutex); /* do something */ lock_acquire(file1); ...

aambazinga

1.0k views

aambazinga asked Dec 24, 2018

0 votes

0 answers

170

Process Synchronization
Please suggest in revising the topic process synchronization. 1. After completing the full process synchronization Im totally confuse while solving problems which technique to apply. 2.Any summarized difference between every technique list or chart or link would be very helpful . Please help me on this . Thanks

Please suggest in revising the topic process synchronization.1. After completing the full process synchronization Im totally confuse while solving problems which techniqu...

Mayankprakash

233 views

Mayankprakash asked Dec 22, 2018

0 votes

1 answer

171

MadeEasy Test Series: Operating System - Process Synchronization
The definition of progress is: When no process is in the critical section and another process wants to enter the critical section, then it should be allowed without any delay Suppose we do a context switch from 1 ... critical section, the second process is unable to enter the critical section. How does this achieve progress then?

The definition of progress is: “When no process is in the critical section and another process wants to enter the critical section, then it should be allowed without an...

Gokulnath

554 views

Gokulnath asked Dec 21, 2018

0 votes

0 answers

172

synchronization
test and set is used to implement Lock / Unlock to avoid BUSSY WAITING. above statement is true or false?

test and set is used to implement Lock / Unlock to avoid BUSSY WAITING.above statement is true or false?

Rahul_Rathod_

760 views

Rahul_Rathod_ asked Dec 21, 2018

0 votes

0 answers

173

Gateforum Test Series: Operating System - Process Synchronization
which of the following statement is true with respect to the following program? unsigned long flags; Acquire(lock); .. if(something_bad){ return ERROR; } Release(lock); return 0; The program acquires and release lock ... lock, The Release(lock) statement should be moved inside the If(something_bad) , block Both B and C

which of the following statement is true with respect to the following program?unsigned long flags;Acquire(lock);………..if(something_bad){…return ERROR;}Release(loc...

Shivam Kasat

651 views

Shivam Kasat asked Dec 21, 2018

0 votes

0 answers

174

Process Synchronization
Does Progress implies freedom from Deadlock?

Does Progress implies freedom from Deadlock?

Nirmal Gaur

552 views

Nirmal Gaur asked Dec 19, 2018

1 votes

0 answers

175

Zeal Test Series 2019: Operating System - Process Synchronization
ANSWER GIVEN IS A) IN THESE QUESTION I GOT THAT IT WILL NOT SATISFIED ME AND BOUNDED WAIT BUT HOW PROGRESS IS SATISFIED I AM NOT GETTING WHAT I UNDERSTOOD THAT IF BOUNDED WAIT IS NOT SATISFIED MEANS ONE PROCESS IS ... (BW) NOT SATISFIED THEN HOW PROGRESS CAN BE SATISFIED PLEASE CLEAR THIS POINT AND TELL ME HOW TO APPROACH HERE

ANSWER GIVEN IS A)IN THESE QUESTION I GOT THAT IT WILL NOT SATISFIED ME AND BOUNDED WAIT BUT HOW PROGRESS IS SATISFIED I AM NOT GETTINGWHAT I UNDERSTOOD THAT IF BOUNDED W...

Prince Sindhiya

592 views

Prince Sindhiya asked Dec 16, 2018

0 votes

1 answer

176

Deadlock condition in synchronization
Please describe the Deadlock Condition in synchronization and when will be synchronization possible and condition ..?

Please describe the Deadlock Condition in synchronization and when will be synchronization possible and condition ..?

Rackson

421 views

Rackson asked Dec 14, 2018

1 votes

2 answers

177

synchronization
does it guarantee mutual exclusion and deadlock prevention?

does it guarantee mutual exclusion and deadlock prevention?

Rahul_Rathod_

914 views

Rahul_Rathod_ asked Dec 12, 2018

1 votes

1 answer

178

semaphore
a) s1-wait(p) , s2-wait(q) , s3-wait(q) , s4-wait(p) b) s1-wait(p) , s2-wait(q) , s3-wait(p) , s4-wait(q) c) s1-wait(q) , s2-wait(p) , s3-wait(p) , s4-wait(q) d) none of above

a) s1-wait(p) , s2-wait(q) , s3-wait(q) , s4-wait(p)b) s1-wait(p) , s2-wait(q) , s3-wait(p) , s4-wait(q)c) s1-wait(q) , s2-wait(p) , s3-wait(p) , s4-wait(q)d) none of...

Rahul_Rathod_

1.6k views

Rahul_Rathod_ asked Dec 12, 2018

0 votes

1 answer

179

Ace Test Series: Operating System - Semaphores
Is this correct? Counting Semaphore can be implemented using a binary semaphore and normal machine instructions.

Is this correct?Counting Semaphore can be implemented using a binary semaphore and normal machine instructions.

smsubham

655 views

smsubham asked Dec 3, 2018

1 votes

1 answer

180

Interprocess Communication
Consider the following statements: S1 : Interprocess communication and sharing is easier in process rather than threads. S2 : There is no protection between threads of same process. Which of the following statements are Valid ?

Consider the following statements:S1 : Interprocess communication and sharing is easier in process rather than threads.S2 : There is no protection between threads of same...

Na462

2.1k views

Na462 asked Dec 2, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true