Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
Excellent explaination
Life saver❤❤
Just Brilliant 🤗
Very helpful. Thanks allot 😀
Awesome sir👌👌
Thanks a ton
Topper🤓🥳🥳
This is amazing however, this might create a deadlock, try asymmertic solution
These are amazing videos. Do you plan to create more video labs on systems programming? Say network programming or device driver interaction or ARM?
if all philosopher picked their left chopsticks which is possible in this code then we can get dead lock is it correct ?
Yes
@@dextutor thank you for reply sir
Yeah in that case do something like if all philosophers have taken left fork then for last philosopher first take right fork and then take left fork
link for the code is not accessible
Check now
Great video but two questions I have: 1. What if the philosopher puts down first the right then left chopsticks, would it make any difference? (it seems to me it wouldn't) 2. Why different outputs produce different order of iterations?
1. No it won't 2. Because the simulation is such that the philosophers pick chopsticks at random hence the iterations are diff
@@dextutor thank you for your teachings!
nice video man! just one question, what is the type of the semaphore used? is it a binary semaphore?
Binary
plz make video on bankers algorithm
@DexTutor I'm running the code in vs code and it is not accepting these header files like semaphore.h what should I do
Try running in WSL
@@dextutor what's that?
Can we complie this in online pls answer sir
Sir, please can you share producer- consumer problem in c
There's an error in the code
Do share the error
Possible for deadlock
Sir in this code there is a possibility for deadlock
Excellent explaination
Life saver❤❤
Just Brilliant 🤗
Very helpful. Thanks allot 😀
Awesome sir👌👌
Thanks a ton
Topper🤓🥳🥳
This is amazing however, this might create a deadlock, try asymmertic solution
These are amazing videos. Do you plan to create more video labs on systems programming? Say network programming or device driver interaction or ARM?
if all philosopher picked their left chopsticks which is possible in this code then we can get dead lock
is it correct ?
Yes
@@dextutor thank you for reply sir
Yeah in that case do something like if all philosophers have taken left fork then for last philosopher first take right fork and then take left fork
link for the code is not accessible
Check now
Great video but two questions I have: 1. What if the philosopher puts down first the right then left chopsticks, would it make any difference? (it seems to me it wouldn't) 2. Why different outputs produce different order of iterations?
1. No it won't
2. Because the simulation is such that the philosophers pick chopsticks at random hence the iterations are diff
@@dextutor thank you for your teachings!
nice video man! just one question, what is the type of the semaphore used? is it a binary semaphore?
Binary
plz make video on bankers algorithm
@DexTutor I'm running the code in vs code and it is not accepting these header files like semaphore.h what should I do
Try running in WSL
@@dextutor what's that?
Can we complie this in online pls answer sir
Yes
Sir, please can you share producer- consumer problem in c
There's an error in the code
Do share the error
Possible for deadlock
Sir in this code there is a possibility for deadlock
Yes