Dark Mode

Recent questions tagged semaphore

3 votes

1 answer

1

GATE CSE 2023 | Question: 28
Consider the two functions $\textsf{incr}$ and $\textsf{decr}$ shown below. incr(){ decr(){ wait(s); wait(s); X = X+1; X = X-1; signal(s); signal(s); } } There are $5$ threads each invoking $\textsf{incr}$ once, and $3$ threads each ... of the following choices corresponds to the minimum possible values of $\text{V1, V2},$ respectively? $15,7$ $7,7$ $12,7$ $12,8$

admin asked in Operating System Feb 15

by admin

1.2k views

0 votes

0 answers

2

OS Self doubt (Semaphore)
At the end of chapter 2, we studied a solution to the readers and writers problem, given below:- In this solution, as long as one reader is having the resource any new reader can get access to the resource. Thus, the writer will ... expressing interest the writer will also have to wait for all the existing resource-occupyingreader(s) to be done and release the resource.

legacy asked in Operating System Nov 27, 2022

by legacy

67 views

0 votes

1 answer

3

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?

ajayraho asked in Operating System Oct 23, 2022

265 views

0 votes

1 answer

4

Ace Test Series

Neelu Lalchandani asked in Operating System Aug 19, 2022

by Neelu Lalchandani

216 views

1 vote

2 answers

5

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

Vaishnavi Gadhe asked in Operating System Jul 3, 2022

by Vaishnavi Gadhe

349 views

0 votes

0 answers

6

Semaphores
Using semaphores, design a solution to manage clients access to five banking tellers given the following operation scenario: The bank has a space with 15 chairs and a standing area that can accommodate up to 10 clients. Hence, the maximum number of clients allowed to ... ticket, the client needs to enter his ID. When a teller is available, one. help me to answer this question please.

merna asked in Operating System May 13, 2022

by merna

331 views

10 votes

3 answers

7

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$

Arjun asked in Operating System Feb 15, 2022

by Arjun

5.0k views

0 votes

0 answers

8

self-doubt operating-system semaphore
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectively I know this implementation is deadlock free just want to ask if it will follow bounded waiting and progress and how both of them are different?

Arbaz__Malik asked in Operating System Dec 25, 2021

by Arbaz__Malik

344 views

1 vote

2 answers

9

Operation system Applied test series 2022
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct? Mutual exclusion satisfied Progress is not satisfied Bounded waiting is not satisfied None of the above Can anyone help me in this A should not be the ans as there is no restriction on atomicity. What about b and c.

ramakrushna asked in Operating System Dec 18, 2021

472 views

1 vote

1 answer

10

Applied Test Series
It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mutual exclusion. Initial value of M is 1. The value of M is decremented by any process ... = 1, E = 7, F = 0 Out of the four combinations given above, the total number of combinations which cannot exist is ____

LRU asked in Operating System Oct 17, 2021

by LRU

391 views

14 votes

4 answers

11

GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads

Arjun asked in Operating System Feb 18, 2021

by Arjun

8.8k views

2 votes

5 answers

12

UGC NET CSE | January 2017 | Part 2 | Question: 36
There are three processes $P_{1}, P_{2}$ and $P_{3}$ sharing a semaphore for synchronizing a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... section $P1$ exits critical section The final value of semaphore will be : $0$ $1$ $-1$ $-2$

go_editor asked in Operating System Mar 24, 2020

1.1k views

14 votes

3 answers

13

GATE CSE 2020 | Question: 34
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ ... all processes execute CODE SECTION P mutually exclusively. It ensures that at most $n-1$ processes are in CODE SECTION P at any time.

Arjun asked in Operating System Feb 12, 2020

by Arjun

9.1k views

4 votes

4 answers

14

ISRO2020-57
The hardware implementation which provides mutual exclusion is Semaphores Test and set instructions Both options None of the options

Satbir asked in Operating System Jan 13, 2020

by Satbir

3.5k views

0 votes

0 answers

15

Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 39 (Page No. 469)
A student majoring in anthropology and minoring in computer science has embarked on a research project to see if African baboons can be taught about deadlocks. He locates a deep canyon and fastens a rope across ... . Do not worry about a series of eastward-moving baboons holding up the westward-moving baboons indefinitely.

Lakshman Patel RJIT asked in Operating System Oct 30, 2019

by Lakshman Patel RJIT

423 views

1 vote

0 answers

16

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 64 (Page No. 179 - 180)
The objective of this exercise is to implement a multithreaded solution to find if a given number is a perfect number. $N$ is a perfect number if the sum of all its factors, excluding itself, is $N;$ examples are ... can make the computation faster by restricting the numbers searched from $1$ to the square root of $N.)$

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

263 views

0 votes

0 answers

17

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 62 (Page No. 179)
Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared data structures. Just let each thread access them when ... Do not print more than one number every minute because the I/O could affect the race conditions.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

599 views

Page:

1
2
3
4
5
next »

Recent questions tagged semaphore