Multi-threaded simulation of the Dining Philosophers Problem extended to multiple tables. Detects and handles deadlocks as philosophers move between tables. Written in Java.

Drinking Philosopher

Examble about Deadlock ( OS Course )

Implementation of Concurrency Programming problem, Dining Philosophers.

A classic example problem often used in concurrent algorithm design.

Explores classic concurrency problems using Java.

Assignment in Operating Systems Course to implement a solution to the Dining Philosopher's Problem

A solution to the famous concurrency problem, Dining Philosophers.

This project is a tool to help better understand classic problems of synchronization in multi-threading using synchronization primitives.

Operating system programming concepts, Operating Systems with System Programming (IDATA2305) course, spring 2022.

Implenting Dinning Philosophers problem in a client-server style with nice GUI using java and javafx

Data structures, algorithms, etc. Solutions to some common interview questions.

A dining philosophers implementation done in java, making use of Semaphores

Implementation of Dining Philosophers Solution in Java

This repository is an example of the Dining Philosopher's Problem, and how it can be solved in a multi-threading method.

Miscellaneous JAVA tests and trials, including lifedays, decathlon calculations, dining philosophers simulation and other interview questions

A simple example of the Dining Philosophers problem. Deadlock purposefully created.

Dining philosophers problem

🍽️ A dining philosophers problem simulator.

Dining Philosophers Problem, Race conditions & JUnit Testing