Register

UGC NET CSE | December 2019 | Part 2 | Question: 26

• edited by
639 views
0 votes
0 votes

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
• edited by
User Avatar

1 Answer

0 votes
0 votes

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.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
soujanyareddy13 asked May 12, 2021
2,858 views
UGC NET CSE | December 2019 | Part 2 | Question: 1
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
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...
User Avatar
4 votes
4 votes
6 answers
3
soujanyareddy13 asked May 12, 2021
1,937 views
UGC NET CSE | December 2019 | Part 2 | Question: 3
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$
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$
User Avatar
Link Copied!