1. Solve the following problem by using Priority Scheduling algorithm, draw Gantt Chart and calculate average waiting time. Process Burst Time Priority P1 10 3 P2 1 1 P3 2 4 P4 1 5 P5 5 2
Added by Cameron S.
Close
Step 1
The lower the number, the higher the priority. So, the order will be P2, P5, P1, P3, P4. Show more…
Show all steps
Your feedback will help us improve your experience
Michael Feffer and 92 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Exercise 3.2.1: Scheduling with FIFO, SJF, and SRT. (a) For the 5 processes described below, draw a timing diagram showing when each process executes under FIFO, SJF, and SRT. (b) Determine the ATT for each scheduling algorithm for the 5 processes.
Akash M.
Compare the completion time for different scheduling algorithms: Round-Robin (RR) and Shortest Remaining Time First (SRTF), with the following setup: 5 processes Time slice is 1 second Process switch time is 0.1 seconds Required CPU time for each process is listed Complete the following table. In your answer, please write in the following format: RR-1: RR-2: RR-3: RR-4: RR-5: SRTF-1: SRTF-2: SRTF-3: SRTF-4: SRTF-5: Completion Time Process CPU RR SRTF 1 50 2 15 3 30 4 45 5 10
Supreeta N.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD