Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
# of burgers to cook per Consumer = 4 Producer is Cooking Burger #1 Producer is Cooking Burger #2 Consumer #1 of Thread# 1 buys 1 burger Consumer #2 of Thread# 1 buys 1 burger Producer is Cooking Burger #3 Consumer #1 of Thread# 2 buys 1 burger Producer is Cooking Burger #4 Producer is Cooking Burger #5 Producer is Cooking Burger #6 Consumer #3 of Thread# 1 buys 1 burger Producer is Cooking Burger #7 Consumer #2 of Thread# 2 buys 1 burger Consumer #3 of Thread# 2 buys 1 burger Producer is Cooking Burger #8 Consumer #4 of Thread# 1 buys 1 burger Consumer #4 of Thread# 2 buys 1 burger # of Available burgers [1] Customer (s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer (s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer (s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer (s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer (s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer (s) Waiting: [0] # of Available burgers [0] Customer (s) Waiting: [0]

# of burgers to cook per Consumer = 4 Producer is Cooking Burger #1 Producer is Cooking Burger #2 Consumer #1 of Thread# 1 buys 1 burger Consumer #2 of Thread# 1 buys 1 burger Producer is Cooking Burger #3 Consumer #1 of Thread# 2 buys 1 burger Producer is Cooking Burger #4 Producer is Cooking Burger #5 Producer is Cooking Burger #6 Consumer #3 of Thread# 1 buys 1 burger Producer is Cooking Burger #7 Consumer #2 of Thread# 2 buys 1 burger Consumer #3 of Thread# 2 buys 1 burger Producer is Cooking Burger #8 Consumer #4 of Thread# 1 buys 1 burger Consumer #4 of Thread# 2 buys 1 burger # of Available burgers [1] Customer (s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer (s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer (s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer (s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer (s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer (s) Waiting: [0] # of Available burgers [0] Customer (s) Waiting: [0]

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

I have to display the number of available burgers and customers waiting in my program. If the producer cooks a burger, it adds up to the available burgers and whenever a customer buys a burger, the number of the available burgers is reduced. And when there are 0 burgers available left and a customer buys a burger, it is added up to the customer waiting. Then if the producer cooks a burger, the available burgers will remain the same but the customer waiting is decreased. 

The code is given below and I am stuck at display the correct output. What should be done?

 

Sample output: Assume the system generates 4 Command Prompt # of burgers to cook per Consumer = 4 Producer is Cooking Burger #1 Producer is Cooking Burger #2 Consumer #1 of Thread# 1 buys 1 burger Consumer #2 of Thread# 1 buys 1 burger Producer is Cooking Burger #3 Consumer #1 of Thread# 2 buys 1 burger Producer is Cooking Burger #4 Producer is Cooking Burger #5 Producer is Cooking Burger #6 Consumer #3 of Thread# 1 buys 1 burger Producer is Cooking Burger #7 Consumer #2 of Thread# 2 buys 1 burger Consumer #3 of Thread# 2 buys 1 burger Producer is Cooking Burger #8 Consumer #4 of Thread# 1 buys 1 burger Consumer #4 of Thread# 2 buys 1 burger # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] Sample output: Assume the system generates 2 %3D Command Prompt # of burgers to cook per Consumer = 2 Producer is Cooking Burger #1 Consumer #1 of Thread# 1 buys 1 burger Consumer #1 of Thread# 2 buys 1 burger Consumer #2 of Thread# 1 buys 1 burger Producer is Cooking Burger #2 Consumer #2 of Thread# 2 buys 1 burger Producer is Cooking Burger #3 Producer is Cooking Burger #4 # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [1] # of Available burgers [0] Customer(s) Waiting: [2] # of Available burgers [0] Customer(s) Waiting: [1] # of Available burgers [0] Customer(s) Waiting: [2] # of Available burgers [0] Customer(s) Waiting: [1] # of Available burgers [0] Customer(s) Waiting: [0] Note: |Customer(s) Waiting: [1] Since There are no more Available burgers created by the Producer Thread, the Customer “waits" ! until the Producer makes a new Burger. Producer is Cooking Burger #2 # of Available burgers [0] Customer(s) Waiting: [1] Although the Producer creates a new Burger, It will not be counted on the “Available" because there were 2 customer(s) waiting. That's why on this line, Waiting was instead decremented from 2 (see previous line) to 1. Waiting: [1] The same concept happened here.
Transcribed Image Text:Sample output: Assume the system generates 4 Command Prompt # of burgers to cook per Consumer = 4 Producer is Cooking Burger #1 Producer is Cooking Burger #2 Consumer #1 of Thread# 1 buys 1 burger Consumer #2 of Thread# 1 buys 1 burger Producer is Cooking Burger #3 Consumer #1 of Thread# 2 buys 1 burger Producer is Cooking Burger #4 Producer is Cooking Burger #5 Producer is Cooking Burger #6 Consumer #3 of Thread# 1 buys 1 burger Producer is Cooking Burger #7 Consumer #2 of Thread# 2 buys 1 burger Consumer #3 of Thread# 2 buys 1 burger Producer is Cooking Burger #8 Consumer #4 of Thread# 1 buys 1 burger Consumer #4 of Thread# 2 buys 1 burger # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [3] Customer(s) Waiting: [0] # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: # of Available burgers [2] Customer(s) Waiting: [0] # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] Sample output: Assume the system generates 2 %3D Command Prompt # of burgers to cook per Consumer = 2 Producer is Cooking Burger #1 Consumer #1 of Thread# 1 buys 1 burger Consumer #1 of Thread# 2 buys 1 burger Consumer #2 of Thread# 1 buys 1 burger Producer is Cooking Burger #2 Consumer #2 of Thread# 2 buys 1 burger Producer is Cooking Burger #3 Producer is Cooking Burger #4 # of Available burgers [1] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [0] # of Available burgers [0] Customer(s) Waiting: [1] # of Available burgers [0] Customer(s) Waiting: [2] # of Available burgers [0] Customer(s) Waiting: [1] # of Available burgers [0] Customer(s) Waiting: [2] # of Available burgers [0] Customer(s) Waiting: [1] # of Available burgers [0] Customer(s) Waiting: [0] Note: |Customer(s) Waiting: [1] Since There are no more Available burgers created by the Producer Thread, the Customer “waits" ! until the Producer makes a new Burger. Producer is Cooking Burger #2 # of Available burgers [0] Customer(s) Waiting: [1] Although the Producer creates a new Burger, It will not be counted on the “Available" because there were 2 customer(s) waiting. That's why on this line, Waiting was instead decremented from 2 (see previous line) to 1. Waiting: [1] The same concept happened here.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS