Dining philosophers problem's guide for 42 school

Philosophers is a comprehensive guide and solution to the classic Dining Philosophers Problem in computer science. This project uses the C programming language and multithreading to implement a solution that prevents deadlocks and resource conflicts.

Philosophers dinner problem in C. Introduction to threads, mutexes, processes, and semaphores

[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.

Philosophers an individual project at 42 about introduction to the basics of process threading, and how work on the same memory space. And learn about mutexes, semaphores, and shared memory.

Everyone has got to eat and sleep and think and potentially die! Welcome to the life of Philosophers!

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.

42 São Paulo - Philosophers

This project is about learning threads and processes, mutexes and semaphores.

Apply the basics of threading a process. Creating threads and discover mutexes.

🍽️ dining philosophers problem in C.

Visualising dining philosophers problem using threads and processes, 42 curriculum

Implementação do Problema do Jantar dos Filósofos usando o conceito de threads e semáforos apresentados na disciplina de Sistema Operacionais.

Dining Philosophers Problem

In this project, I tackled the Philosopher's Problem. By coding the solution to this problem, I aimed to grasp the functioning and usage logic of threads in the C language, as well as learn how to effectively utilize mutexes.

This project introduces the concepts of multi-threading and mutexes.

A simulation that solves the famous Dining Philosophers problem.

The basics of threading a process.