Search results for round-robin / GATE Overflow for GATE CSE

16 votes

2 answers

1

GATE CSE 2022 | Question: 32
Consider four processes $\text{P, Q, R,}$ and $\text{S}$ scheduled on a $\text{CPU}$ as per round robin algorithm with a time quantum of $4\text{ units.}$ The processes arrive in the order $\text{P, Q, R, S,}$ all at time $\text{t = 0}.$ ... $\text{P = 4, Q = 12, R = 5, S = 4}$ $\text{P = 3, Q = 7, R = 7, S = 3}$

Consider four processes $\text{P, Q, R,}$ and $\text{S}$ scheduled on a $\text{CPU}$ as per round robin algorithm with a time quantum of $4\text{ units.}$ The processes a...

Arjun

10.7k views

Arjun asked Feb 15, 2022

1 votes

2 answers

2

OS, Process Scheduling
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and the context switch takes 0 seconds. At what time the first process will complete the execution? (assume all the variables as integers). A) nkx B) k(nx-1) C) k(nk+n) D) x(nk-n+1)

Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...

delxbydelt

297 views

delxbydelt asked Mar 15

5 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 46
The following table lists the arrival time and execution time of $5$ ... of $20$ units. If the Gantt chart starts at zero, what is the time at which $\mathrm{E}$ finishes its execution?

The following table lists the arrival time and execution time of $5$ threads.$$\begin{array}{c|c|c}\text{Job} & \text{Arrival time} & \text{Execution time} \\\hline \math...

GO Classes

431 views

GO Classes asked Jan 13

0 votes

3 answers

4

Operating System Round Robin
Does Round Robin guarantee bounded waiting?

Does Round Robin guarantee bounded waiting?

Mrityudoot

312 views

Mrityudoot asked Jan 24

8 votes

6 answers

5

OS:- Round Robin scheduling
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.Assume that dispatching the process first time is not counted as a context switch.

If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum q ,where q<m.A...

rahul sharma 5

4.6k views

rahul sharma 5 asked Aug 26, 2017

0 votes

1 answer

6

Ace Test Series | Operating System | Scheduling
Given a system using Round Robin scheduling, assuming it can perform a context- switch in zero time. Each process is allowed to run only one instruction before the next instruction is allocated to the CPU. The ready queue always contains n-processes. If ... -processing environment, how long will it take to execute on this system? n+t n*t n/t (n^2)t

Given a system using Round Robin scheduling, assuming it can perform a context- switch in zero time. Each process is allowed to run only one instruction before the next i...

none30

369 views

none30 asked Jul 1, 2023

3 votes

1 answer

7

Operating System | Round Robin | Preemption & Context Switch
Suppose only a process P1 is executing, using Round Robin scheduling. After the time slice expires, the same process comes back into execution. This could be considered as: (Time Slice of RR is smaller than burst of P1) Only preemption Only context switch Both preemption and context switch None

Suppose only a process P1 is executing, using Round Robin scheduling. After the time slice expires, the same process comes back into execution. This could be considered a...

Souvik33

793 views

Souvik33 asked Nov 25, 2022

3 votes

3 answers

8

Round Robin Scheduling
Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request consumes 20 ms of CPU time after which it spends 10 ms of time on I/O,thereafter ... ii. Response time of the 1st Request of the last Process. iii. Response time of the subsequent request of any process.

Consider a System using Round Robin scheduling with 10 Processes all arriving at the time 0. Each Process is associated with 20 identical Request. Each Process request co...

Karan Dodwani 1

2.7k views

Karan Dodwani 1 asked Aug 22, 2018

0 votes

1 answer

9

Operating System | Process Scheduling | Round Robin
Lets consider one situation where, OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue is also P1 (this case is possible in Round Robin). ... take place in Round Robin scheduling method with quantum=3unit for the given data below. AT=Arrival Time, BT=Burst Time

Lets consider one situation where,OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue ...

anupamsworld

1.4k views

anupamsworld asked Jun 6, 2022

1 votes

0 answers

10

GATE CS previuos year question but with change :Operating System
Q.1 In round-robin scheduling there are 'n' no. of processes in ready queue and time slice is 'q' units in worst case, the interrupted process will get the CPU again after (a) (n-1)q units (b) nq units (c) (q-1)n units (d) (q + 1)n units (PLEASE Answer with Explanation if possible )

Q.1 In round-robin scheduling there are 'n' no. of processes in ready queue and time slice is 'q' units in worst case, the interrupted process will get the CPU again afte...

abhinowKatore

566 views

abhinowKatore asked Mar 10, 2022

2 votes

1 answer

11

Process scheduling
Consider the following : Process Arrival Time Burst Time A 0.000 3 B 1.001 6 C 4.001 4 D 6.001 2 Which of the following options is true? a) FCFS and SJF have same average throughput but not SRTF b) SJF and SRTF have same average ... have same average throughput d) FCFS, SJF and SRTF have same average throughput but not Round Robin with time quantum=2 Please explain in detail.

Consider the following :ProcessArrival TimeBurst Time A 0.000 3 B 1.001 6 C 4.001 4 D 6.001 2Which of the followin...

Gateprepbuddy

769 views

Gateprepbuddy asked Jan 29, 2022

1 votes

1 answer

12

#self doubt #round robin #cpu scheduling
in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the process will be?

in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the proces...

jayadev

1.3k views

jayadev asked Oct 10, 2021

1 votes

2 answers

13

UGC NET CSE | December 2018 | Part 2 | Question: 73
Consider the following set of processes and the length of CPU burst time given in milliseconds : ... -Robin Scheduling Algorithm with time quantum $4$ ms. Then the waiting time for $P_4$ is ______ ms $0$ $4$ $12$ $6$

Consider the following set of processes and the length of CPU burst time given in milliseconds :$\begin{array}{|c|c|} \hline \text{Process} & \text{...

Arjun

3.1k views

Arjun asked Jan 2, 2019

3 votes

3 answers

14

TIFR CSE 2020 | Part B | Question: 8
Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs may keep running indefinitely. A $\textsf{starvation free}$ ... job-scheduling policies is starvation free? Round - robin Shortest job first Priority queuing Latest job first None of the others

Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs ...

admin

1.2k views

admin asked Feb 10, 2020

2 votes

1 answer

15

Ace Test Series: Operating System - CPU Scheduling
Consider a system having $10$ IO bound jobs and $1$ CPU bound job.. If IO bound job issue an IO request once for every ms of CPU computation and that each IO request takes $10$ ms. If context switch overhead is $0.1$ ms.Using round -robin scheduling with a time quantum of $10$ ms. , the CPU efficiency is __________________

Consider a system having $10$ IO bound jobs and $1$ CPU bound job.. If IO bound job issue an IO request once for every ms of CPU computation and that each IO request take...

srestha

797 views

srestha asked Mar 11, 2019

4 votes

2 answers

16

Context switches in round robin
Here what are the number of context switches ? Is it 5 or 6? Do we consider context switch before P1 (i.e during the start) ?

Here what are the number of context switches ? Is it 5 or 6? Do we consider context switch before P1 (i.e during the start) ?

Xylene

13.3k views

Xylene asked Aug 12, 2017

0 votes

1 answer

17

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 42 (Page No. 177)
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.

Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.

admin

2.3k views

admin asked Oct 25, 2019

1 votes

1 answer

18

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 43 (Page No. 177)
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectively wasted (overhead). For round-robin scheduling with quantum $Q$, give a formula ... $Q > T$ $S < Q < T $ $Q = S$ $Q\: \text{nearly}\: 0$

Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectiv...

admin

2.0k views

admin asked Oct 25, 2019

6 votes

1 answer

19

CPU efficiency in round robin algorithm
Measurements of a certain system have shown that a process runs, on the average, for time T before blocking for Input/Output. Process switch requires time S which is overhead. For round robin scheduling with quantum Q, give a formula for the ... Can somebody please explain option c and hence option D with example ,Thanks and sorry if it is naive question :)

Measurements of a certain system have shown that a process runs, on the average, for time T before blocking for Input/Output. Process switch requires t...

sunil sarode

11.4k views

sunil sarode asked Nov 15, 2017

1 votes

0 answers

20

Galvin 9th edition, exercise 6.17
The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system ... the case that in Round Robin, we neglect the priorities and schedule only on the basis of time quantum ?

The following processes are being scheduled using a preemptive, roundrobin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indic...

Harsh Kumar

3.8k views

Harsh Kumar asked Aug 22, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true