Discord Community: discord.gg/dK6cB24ATp
GitHub Repository: github.com/geekific-official/

It’s been a while since we tackled a concurrency problem. Therefore, in this video we bring you one of the most classic synchronization problems: The Dining Philosophers.

Timestamps:
00:00 Introduction
00:07 The Dining Philosophers Problem
01:30 Deadlocks vs Race Conditions
03:49 Potential Java Solution
05:57 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:
Object-Oriented Programming Fundamentals:    • What is Object-Oriented Programming? | Obj...  
SOLID Principles and Best Practices:    • SOLID Design Principles with Java Examples...  
Recursion Made Simple, Recursive Methods:    • What is Recursion? | Recursion Made Simple...  
Use-Case and Sequence Diagrams:    • UML Use-Case and Sequence Diagrams Made Si...  
What is a Thread? (Process, Program, Parallelism, Scheduler Explained):    • What is a Thread? | Threads, Process, Prog...  
The Volatile and Synchronized Keywords in Java, Atomic Variables in Java:    • The Volatile and Synchronized Keywords in ...  
Creating Threads and Executing Tasks in Java (Thread, Runnable, Callable, Future, ExecutorService):    • Creating Threads and Executing Tasks | Thr...  
Locks, Monitors and Semaphores Explained in Java, Optimistic Locking:    • Locks, Monitors and Semaphores Explained i...  

#Geekific #DiningPhilosophers #Deadlock #RaceCondition