the bounded buffer problem is a specific case of the consumer-producer problem that introduces the constraint of a fixed buffer size. The core challenge in both problems is coordinating the actions of the producer and consumer processes to ensure safe and efficient access to the shared buffer.
Wait (P) Operation: If the semaphore value is 1, it decrements the value by 1 and allows the process to proceed. If the value is 0, it blocks the process until the semaphore becomes 1. Signal (V) Operation: Increments the semaphore value by 1, potentially allowing a waiting process to proceed.
Mam, you had put a lot of effort into this, but you are confusing us for simple problems because you are not connecting from previous concepts why they are not useful and there is no logical derivation in your lecture, it is like you read the content and just putting it forward. Sorry mam, my concern was not to point you out but your work should not go in vain. Thank you.
empty is initialised with N not 1.....in the problem is N value equal to 1?
very good explanation. thank you
You are great !!!! And a life saver !!!
u are traching is so good mam.
Thank you
Empty is initialized to n not 1🙄
You are right, is a mistake for sure ...I hope it will be corrected in a new video ...
Happens..its ok
2:50 is right in the video. unless we are watching two different videos
Empty is initialized N but its also given that N can hold one item per buffer this is why we take N=1
is this and producer consumer problem same ?
Yes en.wikipedia.org/wiki/Producer%E2%80%93consumer_problem
Yes
the bounded buffer problem is a specific case of the consumer-producer problem that introduces the constraint of a fixed buffer size. The core challenge in both problems is coordinating the actions of the producer and consumer processes to ensure safe and efficient access to the shared buffer.
❤
good .......explanation
Ахереть. Как только люди не изворачиваются, чтобы заработать. И правильно делают.
unless vdo...fully copied from slides of operating system ch 5
What is mutex mean
means "Lock" it is short name of mutual something -forgot-
@@msRama-sz7bh mutual exclusion
Wait (P) Operation: If the semaphore value is 1, it decrements the value by 1 and allows the process to proceed. If the value is 0, it blocks the process until the semaphore becomes 1.
Signal (V) Operation: Increments the semaphore value by 1, potentially allowing a waiting process to proceed.
thank you soo much akka
Mam, you had put a lot of effort into this, but you are confusing us for simple problems because you are not connecting from previous concepts why they are not useful and there is no logical derivation in your lecture, it is like you read the content and just putting it forward. Sorry mam, my concern was not to point you out but your work should not go in vain. Thank you.
good one. those who are complaining about the empty - n , I think they can not get the exact logic of the solution
Pls explain then
Tomorrow os sem exam
Mam..I'm not understanding the code correctly
kudos to your effort but very bad explanation looks like you are just reading the content
ı love eating cow
it is not clarity
"philospher" loooool
not explained clearly
Stupids won't understand good explanation 😂
Very bad explanation I didn't get anything 🙁
Thank you