Register

#self doubt

• edited by
367 views
1 1 vote
please clear the doubts below:

is there any relation between bounded wait, deadlock and starvation like
if bounded wait is there and no deadlock then starvation will not occur?
please give examples if yes/no

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Dijkstra AlgorithmNext → · SEM Exam IIT Kanpur
← Previous in category · Banker's Algorithm p...Next in category → · SEM Exam IIT Kanpur
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.0k
1.0k views
iarnav asked Jul 22, 2018
1,014 views
#OS #Semaphores Producer Consumer Problem Self Doubt.
I know, that both P and C can go and fall into sleeping state in case of preemption and this can be solved via Semaphores. Now, my doubt is that integer bit that will be ...
0 0 votes
1 1 answer
843
843 views
N3314nch41 asked Sep 10, 2023
843 views
process synchronization
How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??
0 0 votes
2 2 answers
313
313 views
Dknights asked Dec 7, 2024
313 views
#self doubt
can someone please explain the exact difference between binary semaphores and mutex?not able to find any simple explanation.
1 1 vote
1 1 answer
601
601 views
yuvrajeyes asked Dec 31, 2022
601 views
#Self doubt
Since Dealock No Progressthen Does Progess No Deadlockbcoz contrapositive should be true.