Which of the following scheduling algorithms could result in starvation? A) FCFS B) SJN C) RR D) Priority
Added by Tiffany G.
Step 1
D) Priority scheduling algorithm could result in starvation if a process with a high priority continuously arrives, preventing lower priority processes from executing. Show more…
Show all steps
Your feedback will help us improve your experience
Pritesh Ranjan and 81 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
Akash M.
Five batch jobs, A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 minutes. Their (externally determined) priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the average process waiting time. Ignore process switching overhead. a. Round robin b. Priority scheduling c. First-come, first-served (run in order 10, 6, 2, 4, 8) d. Shortest job first For (a), assume that the system is multiprogrammed, and that each job gets its fair share of the CPU with a quantum of 4. For (b) through (d), assume that only one job at a time runs until it finishes. All jobs are completely CPU bound.
Madhur L.
Supreeta N.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD