algorithms
Top Classical OS Problems
1) Sleeping Barber Problem
"The barber shop has a barber, a barber chair, and n chairs for waiting customers. If there are no customer, the barber sit down in the barber chair and falls asleep. When a customer arrives, he/she wakes up the sleeping barber. If a customer arrives while the barber is cutting customer's hair, he/she sit down and wait if there are any empty chairs for waiting customers. If there are no empty chairs, the customer must give up and leave the shop."
2) Dining Philosopers problem
"There are N philosphers sitting around a circular table eating spaghetti and discussing philosphy. The problem is that each philosopher needs 2 forks to eat, and there are only N forks, one between each 2 philosophers. Algorithm should insures that no philosopher starves and the maximum number of philosophers can eat at once."
3) Drinking Philosopers problem
"In the drinking philosophers problem, for each process there is a maximum set of resources that it can request, and each time a process wishes to do some work, it may request an arbitrary subset of its maximum set."
