The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
I have very short time to do this problem which is the Sleeping Barber. codes are already in internet but written by c++ on Unix.
I need this problem in C++ on Microsoft.
Â
The Sleeping-Barber Problem: A barbershop consists of a waiting room with n chairs and a barber room with one barber chair. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop. If the barber is busy but chairs are available, then the customer sits in one of the free chairs. If the barber is asleep, the customer wakes up the barber.
Â
Write a program to coordinate the barber and the customers.
Â
The application must be submitted as a NetBeans project or Microsoft Visual Studio project which includes the source codes of your program. In addition to the NetBean project or Micorsoft Visual Studio project, use Microsoft Word to provide a user-documentation file. Documentation should includes:
Â
A report which clearly describes the design of your software.
Logical flow diagram describes the logical flow structure of the software. (Use Microsoft Visio and include the diagrams in the user-documentation Word document.)
Logical flow diagram for every method, functions, and procedures defined in the software. (Use Microsoft Visio and include the diagrams in the user-documentation Word document )
Description of any input files to test the application. (a file with valid data and a file with invalid data)
A detailed instruction of how the program can be compiled and executed.
Screenshots of execution sessions processing valid inputs and invalid inputs.