1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Nataliya [291]
3 years ago
14

5.20 Which of the following scheduling algorithms could result in starvation? a. First-come, first-served b. Shortest job first

c. Round robin d. Priority
Computers and Technology
2 answers:
fomenos3 years ago
6 0

Answer:

b. Shortest job first and d. Priority

Explanation:

First let us understand what starvation is. Starvation is basically situation in which a process does not get required resources because other processes are being allocated to these resources and are utilizing those resources. So that process is in starvation as it does not get access to the resource and it is unable to execute.

In the First-come first-served scheduling algorithm the processes are executed in the order or sequence such that the first process is executed first and the second process is executed after the first process finishes its execution. So in this scheduling algorithm no starvation can occur as there is no process which will never get a resource and will never be able to execute.

Shortest job first chooses out of the waiting processes, the process which has the shortest execution time to be executed first. This results in the processes with long execution time to wait for their execution. This wait can go till infinity and the waiting long processes might never get the resources for their execution if the shorter processes keep arriving. So this can result in starvation.

Round robin algorithm gives each process a fixed time slot called quantum time for its execution.  So no process will have to wait for long and wait for a resource to be allocated for long in order to be executed. So this is a starvation free scheduling algorithm.

In priority scheduling the processes are given priorities to execute which means that the process with high priority will be allocated the resource and will be executed first.  This causes the low priority processes to wait for long and this waiting can go to infinity and the low priority process might not be able to get a resource for their execution. So this scheduling algorithm could result in starvation.

NARA [144]3 years ago
5 0

Answer: (b) and (d)

Explanation:

Shortest job first and Priority are scheduling algorithms that could result in starvation.

The others won't result in starvation

You might be interested in
An auxiliary view is always projected from the view that shows the inclined surface as a(n) _____.
ValentinkaMS [17]
Auxiliary section i think
8 0
3 years ago
Which component of a computing device drains the battery the fastest?(1 point)
Lostsunrise [7]
The display screen since it’s always bright
8 0
3 years ago
Read 2 more answers
Convert 192.16.3.1 to a Binary number
jenyasd209 [6]
Converting a decimal number into binary would be:

192/2= 96   remainder=0  
96/2= 48    remainder=0
48/2=24     remainder=0
24/2=12      remainder=0
12/2=6        remainder=0
6/2=3         remainder=0
3/2=1          remainder=1
1/2= 0         remainder=1
The binary number would be: 11 00 00 00

For 16
16/2=8     remainder=0
8/2=4      remainder=0
4/2=2       remainder=0
2/2=1         remainder=0
1/2= 0         remainder=1
The binary would be: 00 01 00 00

For 3
3/2=1       remainder=1
1/2= 0         remainder=1
The binary would be: 00 00 00 11

For 1
1/2= 0         remainder=1
The binary would be: 00 00 00 01

The binary number would be:  
11000000.00010000.00000011.00000001
5 0
4 years ago
APCS A: I'm reviewing an old ap test and can't get past this problem:
yaroslaw [1]

Answer:

The answer is "Option A"

Explanation:

Following are the complete code to these question:

public class Arr//defining a class-Arr

{

public static void main(String[] args)//main method  

{

        int [][] numbers={{1, 2, 3},{4,5,6}}; //defining 2D array numbers

for(int[] row : numbers) //use for loop that holds all array value into 1D  array

{

for (int n: row)//defining n variable that holds row array values  

{

System.out.print (n); //print n variable value

}

}

}

}

The code comment explains its functioning.

7 0
3 years ago
Nowadays computer games are mostly available on external<br> hard disk.<br> Is it true or false?
sergey [27]

Answer:

false

Explanation:

because a lot of times they are downloads without the disk

7 0
4 years ago
Read 2 more answers
Other questions:
  • What type of data visual would you use to illustrate trends over time? Gantt chart Bar graph Line chart Scatter diagrams
    5·1 answer
  • public class BaseballTeam { private String city, mascot; private int numberOfPlayers; @Override public boolean equals(Object obj
    10·1 answer
  • If you like to spend time outdoors working with plants and animals, you have a(n) _____. a. bodily/kinesthetic learning style b.
    6·2 answers
  • On a Linux system, which command allows you to modify settings used by the built-in packet filtering firewall?
    15·1 answer
  • At the frequency of 2.4 GHz what is the free-space path loss in dB.
    9·1 answer
  • Sarah has entered data about football players from team A and team B in a worksheet. She enters names of players from team A wit
    9·2 answers
  • Understanding the link between education and your desired career is an integral part of your career _______.
    7·2 answers
  • PLEASE AWNSER 50 POINTS PLUS BRAINLEST ILL FAIL MY GRADE IF I DONT AWNSER IN A HOUR!
    15·1 answer
  • Technology, by itself is neither good nor bad.<br> A) true<br> B) false
    11·2 answers
  • Which of the following security policies can be implemented to prevent removable media from automatically launching potentially
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!