1. Write a C/C++ program that creates a table consisting of 500 randomly generated 3- tuple entries where each entry consists of processID, arrivalTime, and burstTime. The processID should be a “unique” 3-digit positive integer (e.g., 382, 881, 923, …). The arrivalTime should be an integer randomly picked from a range of values between 1 and 1,000. Note that the arrival times of two processes can be the same. The burstTime is an integer randomly picked from a range of values between 1 and 500. Your program should print out the table. An example output of your program would look something like this: processID arrivalTime burstTime 839 1 83 228 4 20 102 3 30 … 2. Using the code for Problem 1, write a C/C++ program that simulates execution of the Round Robin (RR) Algorithm with Time Quantum of 10 and calculates the average waiting time. Your program should run the RR algorithm 500 times. Note that each time you run the algorithm, a new table should be generated, and thus, the average waiting time would be different. An example output would look like this: Average waiting time for RR 12.2 13.3 15.2 …

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

 

1. Write a C/C++ program that creates a table consisting of 500 randomly generated 3-

tuple entries where each entry consists of processID, arrivalTime, and burstTime. The processID

should be a “unique” 3-digit positive integer (e.g., 382, 881, 923, …). The arrivalTime should be

an integer randomly picked from a range of values between 1 and 1,000. Note that the arrival

times of two processes can be the same. The burstTime is an integer randomly picked from a

range of values between 1 and 500. Your program should print out the table. An example

output of your program would look something like this:

processID arrivalTime burstTime

839 1 83

228 4 20

102 3 30

2. Using the code for Problem 1, write a C/C++ program that simulates execution of the

Round Robin (RR) Algorithm with Time Quantum of 10 and calculates the average waiting

time. Your program should run the RR algorithm 500 times. Note that each time you run the

algorithm, a new table should be generated, and thus, the average waiting time would be

different. An example output would look like this:

Average waiting time for RR

12.2

13.3

15.2

Expert Solution
steps

Step by step

Solved in 6 steps with 2 images

Blurred answer
Knowledge Booster
Problems on Dynamic Programming
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education