Write a program in C to implement the following scheduling algorithms: 1. Round Robin scheduling algorithm with variable quantum (q). The user should enter the quantum (q), a number of processes, their arrival times and their burst times in seconds. 2. Pre-emptive Shortest Job First. The user should enter a number of processes, arrival times and burst times in seconds. The 2 options above should be displayed as menu options in a console or GUI. Data entry can be through console or graphical interfaces. Your program should find, select and display the order in which the processes are executed and the start and end of each execution cycle (you can add the length of the execution cycle) supported by a Gantt chart. The program should be able to tell the user which algorithm was more efficient than the other if you run it on the same input using the metrics below. At the end, for each option do the following calculations and display them: 1. the average waiting time 2. the average response time 3. the average turnaround time 4. the throughput in some time unit that is entered by the user.

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...
icon
Related questions
Question
Scheduling Algorithms:
Write a program in C to implement the following scheduling algorithms:
1. Round Robin scheduling algorithm with variable quantum (q). The user should enter the
quantum (q), a number of processes, their arrival times and their burst times in seconds.
2. Pre-emptive Shortest Job First. The user should enter a number of processes, arrival
times and burst times in seconds.
The 2 options above should be displayed as menu options in a console or GUI. Data entry can be
through console or graphical interfaces. Your program should find, select and display the order in
which the processes are executed and the start and end of each execution cycle (you can add the
length of the execution cycle) supported by a Gantt chart. The program should be able to tell the
user which algorithm was more efficient than the other if you run it on the same input using the
metrics below.
At the end, for each option do the following calculations and display them:
1. the average waiting time
2. the average response time
3. the average turnaround time
4. the throughput in some time unit that is entered by the user.
Transcribed Image Text:Scheduling Algorithms: Write a program in C to implement the following scheduling algorithms: 1. Round Robin scheduling algorithm with variable quantum (q). The user should enter the quantum (q), a number of processes, their arrival times and their burst times in seconds. 2. Pre-emptive Shortest Job First. The user should enter a number of processes, arrival times and burst times in seconds. The 2 options above should be displayed as menu options in a console or GUI. Data entry can be through console or graphical interfaces. Your program should find, select and display the order in which the processes are executed and the start and end of each execution cycle (you can add the length of the execution cycle) supported by a Gantt chart. The program should be able to tell the user which algorithm was more efficient than the other if you run it on the same input using the metrics below. At the end, for each option do the following calculations and display them: 1. the average waiting time 2. the average response time 3. the average turnaround time 4. the throughput in some time unit that is entered by the user.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
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