# UGCNET-Dec2019-II: 26

25 views

Which of the following $\text{CPU}$ scheduling algorithms is/are supported by $\text{LINUX}$ operating system?

1. Non-preemptive priority scheduling
2. Preemptive priority scheduling and time sharing $\text{CPU}$ scheduling
3. Time sharing scheduling only
4. Priority scheduling only
in Others
edited

OPTION B

The algorithm used by Linux OS is known as ‘Completely Fair Scheduler’ which is a combination of preemptive priority and time-sharing CPU scheduling.

## Related questions

1 vote
1
233 views
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent
Consider the following Linear programming problem $\text{(LPP)}$: Maximize $z=x_1+x_2$ Subject to the constraints: $x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$ The solution of the above $\text{LPP}$ is $x_1=750, x_2= 750, z=1500$ $x_1=500, x_2= 1000, z=1500$ $x_1=1000, x_2= 500, z=1500$ $x_1=900, x_2= 600, z=1500$
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)}$ $\text{A(GLB – 3, LUB – 12); B(GLB – 1, LUB – 10)}$ $\text{A(GLB – 1, LUB – 36); B(GLB – 2, LUB – 20)}$ $\text{A(GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)}$