1- which of the following scheduling algorithms could result in starvation? why? if any, show how can starvation problem be resolved.
a. first-come, first-served (fcfs)
b. shortest job first (sjf)
c. round robin (rr)
d. priority?

answer: the answer is one of

step-by-step explanation:   we are given to write a proper fraction where the whole is divided into an even number of equal parts less than ten, and an odd number of those parts exist.

an even number less than 10 may be one of 2, 4, 6 or 8. so, the whole may be one of these four evens.

now, an odd number of these parts must exist, so the numerator must be an odd number, one of 1, 3, 5 or 7. it cannot be 9 because then the fraction will become improper.

thus, our fraction may be one of the following

-1   1/6.   you dont subtract the denominators

step-by-step explanation:

the above table 1 will calculate the population size (n) after a certain length of time (t). all you need to do is plug in the initial population number (no), the growth rate (r) and the length of time (t). the constant (e) is already entered into the equation. it stands for the base of the natural logarithms (approximately 2.71828). growth rate (r) and time (t) must be expressed in the same unit of time, such as years, days, hours or minutes. for humans, population growth rate is based on one year. if a population of people grew from 1000 to 1040 in one year, then the percent increase or annual growth rate is 40/1000 x 100 = 4 percent.

step-by-step explanation: