Philosophers is a project from the 42 school curriculum that explores concurrent programming with threads and mutexes, processes and semaphores. It is a variation on the famous dining philosophers problem.

A C implementation of the classic Dining Philosophers problem. A 42 school project exploring threading, mutexes, and semaphores to solve synchronization issues.

Operating System Code in Python 3

Process synchronization, Deadlock avoidance and Disk scheduling algorithms implemented in Java.

This repository contains the Python Programs for various algorithms of Operating Systems

Various flavored solutions to the Dining Philosophers problem.

[documented code / -pedantic -std=c89] - 42School variant of the dining philosophers problem to learn the basics of threading a process, how to create threads and use mutexes.

Solution to Operating System Dining Philosophers problem using threading and synchronization. It ensures smooth resource sharing among philosophers, preventing conflicts like deadlock.

This Repo Contains Network Lab and OS Lab Assignment

Solutions for the Operating Systems Lab in Sem 4, B.Tech in CS

To whom it may concern

My Presentation For OS class | Topic: Simulation for Dining Philosophers

📌 The Dining Philosophers Problem / 食事する哲学者の問題

Philosophers: Concurrency and synchronization by simulating the "Dining Philosophers Problem". It demonstrates resource-sharing management using threads and mutexes, and processes and semaphores in the bonus part.

Rust / C++ Implementation of the three execution models used in concurrent programming

This repository contains implementations of two classic synchronization problems in operating systems: Dining Philosophers Problem & Readers-Writers Problem

Chandy/Misra solution of the dining philosophers problem using python

Interactive tutorials to learn os concepts

Java concurrency exercises

A simulation of dining philosophers problem and its solutions