Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
2. Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 Process ID Arrival Time Burst Time P1 4 P2 3 P3 2 P4 4 P5 5 P6 1 a) Based on the above information, Draw a Gantt chart for the following algorithms: i. Round-Robin (Time Quantum: 3 milliseconds) Shortest Remaining Time (SRT) i. iii. First-come-First Serve (FCFS) iv. Shortest Job First (SJF) 21 3. 2.

2. Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 Process ID Arrival Time Burst Time P1 4 P2 3 P3 2 P4 4 P5 5 P6 1 a) Based on the above information, Draw a Gantt chart for the following algorithms: i. Round-Robin (Time Quantum: 3 milliseconds) Shortest Remaining Time (SRT) i. iii. First-come-First Serve (FCFS) iv. Shortest Job First (SJF) 21 3. 2.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

Operating System

b) Compute the following using Shortest Remaining Time: i. Response time ii. Throughput iIi. Average waiting time iv. Average turn-around time
Transcribed Image Text:b) Compute the following using Shortest Remaining Time: i. Response time ii. Throughput iIi. Average waiting time iv. Average turn-around time
2. Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 Process ID Arrival Time Burst Time P1 4 P2 1 3 P3 2 P4 4 3 P5 2 P6 6 1 a) Based on the above information, Draw a Gantt chart for the following algorithms: i. Round-Robin (Time Quantum: 3 milliseconds) ii. Shortest Remaining Time (SRT) i. First-come-First Serve (FCFS) iv. Shortest Job First (SJF)
Transcribed Image Text:2. Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 Process ID Arrival Time Burst Time P1 4 P2 1 3 P3 2 P4 4 3 P5 2 P6 6 1 a) Based on the above information, Draw a Gantt chart for the following algorithms: i. Round-Robin (Time Quantum: 3 milliseconds) ii. Shortest Remaining Time (SRT) i. First-come-First Serve (FCFS) iv. Shortest Job First (SJF)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 6 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS