Register

UGCNET CSE December 2022: 51

• retagged by
381 views
0 0 votes

 

Which of the following statements are true?

A. Shortest remaining time first scheduling may cause starvation
B. Preemptive scheduling may cause starvation
C. Round robin is better than $\text{FCFS}$ in terms of response time

Choose the correct answer from the options given below:

  1. $\text{A}$ only
  2. $\text{B, C}$ only
  3. $\text{A, B}$ only
  4. $\text{A, B, C}$

(Option $1 [39501]) 1$
(Option $2 [39502]) 2$
(Option $3 [39503]) 3$
(Option $4 [39504]) 4$

Answer Given by Candidate: $4$

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · UGCNET CSE December ...Next → · UGCNET CSE December ...
← Previous in category · UGCNET CSE December ...Next in category → · UGCNET CSE December ...
Position:
Show:

Related questions

1 1 vote
1 1 answer
873
873 views
admin asked May 20, 2023
873 views
UGCNET CSE December 2022: 88
An $\text{OS}$ follows round-robin scheduling with time quantum of $4 \mathrm{~ms}$. Assuming that the $\mathrm{CPU}$ is free now and there are $20$ processes waiting in ...
4 4 votes
1 1 answer
222
222 views
GO Classes asked Jul 21
222 views
GO Classes DPP | GATE CS | Operating System | Round Robin Scheduling
A system has two processes, $P_1$ and $P_2$.$P_1$ is currently running. $P_2$ is ready. The operating system uses preemptive Round Robin scheduling. $P_1$'s scheduling qu...
6 6 votes
2 2 answers
276
276 views
GO Classes asked Jul 23
276 views
GO Classes DPP | GATE CS | Operating System | Scheduling
Match the following$$\begin{array}{ll}\text{I. FCFS} & \text{i. Optimal Waiting Time} \\\text{II. SJF} & \text{ii. Convoy effect} \\\text{III. Round Robin} & \text{iii. N...
0 0 votes
1 1 answer
572
572 views
admin asked May 20, 2023
572 views
UGCNET CSE December 2022: 20
For the following set of processes scheduled using $\text{FCFS}$ policy, determine the average waiting time. Assume that the processes arrived in the order $\text{P1, P2,...