Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged round-robin-scheduling
0
votes
1
answer
1
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)
delxbydelt
asked
in
Operating System
3 days
ago
by
delxbydelt
123
views
process-scheduling
operating-system
round-robin-scheduling
context-switch
process-synchronization
0
votes
3
answers
2
Operating System Round Robin
Does Round Robin guarantee bounded waiting?
Mrityudoot
asked
in
Operating System
Jan 24
by
Mrityudoot
256
views
operating-system
round-robin-scheduling
process-scheduling
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?
GO Classes
asked
in
Operating System
Jan 13
by
GO Classes
392
views
goclasses2024-mockgate-11
goclasses
numerical-answers
operating-system
process-scheduling
round-robin-scheduling
2-marks
0
votes
1
answer
4
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
none30
asked
in
Operating System
Jul 1, 2023
by
none30
333
views
operating-system
ace-test-series
round-robin-scheduling
3
votes
1
answer
5
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
Souvik33
asked
in
Operating System
Nov 26, 2022
by
Souvik33
732
views
round-robin-scheduling
operating-system
context-switch
0
votes
1
answer
6
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
anupamsworld
asked
in
Operating System
Jun 7, 2022
by
anupamsworld
1.3k
views
operating-system
process-scheduling
round-robin-scheduling
context-switch
1
vote
0
answers
7
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 )
abhinowKatore
asked
in
Operating System
Mar 10, 2022
by
abhinowKatore
524
views
operating-system
scheduling
round-robin-scheduling
16
votes
1
answer
8
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}$
Arjun
asked
in
Operating System
Feb 15, 2022
by
Arjun
10.3k
views
gatecse-2022
operating-system
process-scheduling
round-robin-scheduling
2-marks
2
votes
1
answer
9
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.
Gateprepbuddy
asked
in
Operating System
Jan 29, 2022
by
Gateprepbuddy
711
views
ace-test-series
process-scheduling
round-robin-scheduling
operating-system
1
vote
1
answer
10
#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?
jayadev
asked
in
Operating System
Oct 10, 2021
by
jayadev
1.1k
views
operating-system
process-scheduling
round-robin-scheduling
context-switch
3
votes
3
answers
11
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
Lakshman Bhaiya
asked
in
Operating System
Feb 11, 2020
by
Lakshman Bhaiya
1.2k
views
tifr2020
operating-system
process-scheduling
round-robin-scheduling
1
vote
1
answer
12
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$
Lakshman Bhaiya
asked
in
Operating System
Oct 25, 2019
by
Lakshman Bhaiya
1.9k
views
tanenbaum
operating-system
process-and-threads
process-scheduling
round-robin-scheduling
descriptive
0
votes
1
answer
13
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.
Lakshman Bhaiya
asked
in
Operating System
Oct 25, 2019
by
Lakshman Bhaiya
2.2k
views
tanenbaum
operating-system
process-and-threads
context-switch
process-scheduling
round-robin-scheduling
descriptive
2
votes
1
answer
14
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 __________________
srestha
asked
in
Operating System
Mar 11, 2019
by
srestha
766
views
ace-test-series
operating-system
process-scheduling
round-robin-scheduling
0
votes
0
answers
15
Self doubt
In round robin scheduling, which process gets the chance first if a process comes to ready state from running(i.e time quantom getting over) and another from new to ready(i.e due to same arrival time) ? Is there a convention or will it be specified in the question?
subho16
asked
in
Operating System
Jan 4, 2019
by
subho16
378
views
operating-system
round-robin-scheduling
process-scheduling
process
1
vote
2
answers
16
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$
Arjun
asked
in
Operating System
Jan 2, 2019
by
Arjun
3.1k
views
ugcnetcse-dec2018-paper2
operating-system
process-scheduling
round-robin-scheduling
0
votes
0
answers
17
Round Robin
processes 1,2,3,4,5 with burst time as 4,1,8,1,2 and arrival time as 0+ RoundRobin used with TQ=1 what will be arrival time chart for processes 1,2,3,4,5.
Prakhar Singh Gaharw
asked
in
Operating System
Oct 21, 2018
by
Prakhar Singh Gaharw
426
views
operating-system
round-robin-scheduling
process-scheduling
0
votes
0
answers
18
nptel lecture on cpu scheduling
Why P1 is still running after 2ms, shouldn't P2 get the cpu burst? In the video they said that are are no processes present other than P1 when the timer interrupts after 2 time slices. Isn't the gantt chart wrong. What i am missing here, can anyone explain it right?
himanshu6398
asked
in
Operating System
Oct 12, 2018
by
himanshu6398
695
views
round-robin-scheduling
1
vote
0
answers
19
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 ?
Harsh Kumar
asked
in
Operating System
Aug 22, 2018
by
Harsh Kumar
3.7k
views
operating-system
process-scheduling
round-robin-scheduling
3
votes
3
answers
20
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.
Karan Dodwani 1
asked
in
Operating System
Aug 22, 2018
by
Karan Dodwani 1
2.6k
views
round-robin-scheduling
process-scheduling
operating-system
–1
vote
1
answer
21
Ace Test Series 2019: Operating System - Process Scheduling
Na462
asked
in
Operating System
Jul 3, 2018
by
Na462
483
views
ace-test-series
operating-system
process-scheduling
round-robin-scheduling
0
votes
0
answers
22
Computing the average turnaround time using the multilevel queues
In a computing center there are four types of jobs according to their arrival times (in seconds), their priorities and their run times (in seconds); see the table below: -----------------Type 1------ ... - the higher the priority, the sooner they run) scheduling algorithm. [please use a quantum that provides short response time.]
ytr567
asked
in
Operating System
Apr 11, 2018
by
ytr567
783
views
runtime-environment
round-robin-scheduling
computer
1
vote
1
answer
23
IES 2018 - Round robin scheduling
Three processors with their respective process IDs given by P1, P2 and P3, having estimated completion time of 8 ms, 4 ms and 2 ms, respectively, enter a ready queue together in the order P1, P2 and P3. What is the average turn time in the Round Robin Scheduling Algorithm with time 2 ms? (a) 10 ms (b) 15 ms (c) 20 ms (d) 25 ms
sh!va
asked
in
Operating System
Jan 9, 2018
by
sh!va
993
views
round-robin-scheduling
ies
ies-2018
2
votes
1
answer
24
Context switch
Consider 4 processes sharing the CPU in round robin fashion. If context switch time is 1 sec , what must be the time quantum q such that the number of context switches are reduced , but at the same time each process is guaranteed to get the turn at the CPU for every 10 secs? ---------- ... ---------------------- Ans 2 or 1.5 . Is here any formula used like (n-1)q+ns explain in detail
srestha
asked
in
Operating System
Jan 2, 2018
by
srestha
2.1k
views
operating-system
context-switch
process-scheduling
round-robin-scheduling
0
votes
1
answer
25
round robin scheduling
Choose correct answer from the below options: If the following jobs are to be executed on a single processor system The jobs are arrived at time 0 and in the order a, b, c, d, e. Calculate the departure time (completion time) for job ‘a’ if scheduling is round robin with time slice 1 15 5 9 11
Parshu gate
asked
in
Operating System
Dec 10, 2017
by
Parshu gate
1.2k
views
round-robin-scheduling
process-scheduling
context-switch
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged round-robin-scheduling
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation