Consider the following processes and answer the questions, the burst time for processes p1 to p4 is the last 4 numbers of your university ID. le. If your id number is 201811853 then p1 burst time is 1 and p2 burst time is 8 and p3 burst time is 5 and p4 burst time is 3. Note: if there is a 0 in your id number then consider burst time 10, i.e. if your id is 201811850 then burst time for p1,p2,p3,p4 will be 1,8,5,10. Process name Arrival time Burst Time Proiarity P1 1 P2 1 3 P3 2 P4 Show your work What will be the waiting time for p3 if we applied premptive proiarity scheduling algorithm.

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

I WANT THE ANSWER OF THIS oPERATING sYSTEM 

Consider the following processes and answer the questions, the burst time for processes p1
to p4 is the last 4 numbers of your university ID. le. If your id number is 201811853 then p1
burst time is 1 and p2 burst time is 8 and p3 burst time is 5 and p4 burst time is 3. Note: if
there is a 0 in your id number then consider burst time 10, i.e. if your id is 201811850 then
burst time for p1,p2,p3,p4 will be 1,8,5,10.
Process name
Arrival time
Burst Time
Proiarity
P1
1
P2
1
3
P3
2
P4
Show your work
What will be the waiting time for p3 if we applied premptive proiarity scheduling
algorithm.
Transcribed Image Text:Consider the following processes and answer the questions, the burst time for processes p1 to p4 is the last 4 numbers of your university ID. le. If your id number is 201811853 then p1 burst time is 1 and p2 burst time is 8 and p3 burst time is 5 and p4 burst time is 3. Note: if there is a 0 in your id number then consider burst time 10, i.e. if your id is 201811850 then burst time for p1,p2,p3,p4 will be 1,8,5,10. Process name Arrival time Burst Time Proiarity P1 1 P2 1 3 P3 2 P4 Show your work What will be the waiting time for p3 if we applied premptive proiarity scheduling algorithm.
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Linux
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.
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