Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged process-scheduling
0
votes
1
answer
61
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
Operating System
operating-system
process-scheduling
round-robin-scheduling
context-switch
+
–
0
votes
2
answers
62
Self Doubt
Suppose we have priority-based processes. Which scheduler will replace a low priority process which is presently executing when a high priority process arrives in the ready queue? Also which scheduler is responsible for pulling out a process from CPU if it requests I/O?
Suppose we have priority-based processes. Which scheduler will replace a low priority process which is presently executing when a high priority process arrives in the rea...
tusharb
585
views
tusharb
asked
Apr 6, 2022
Operating System
self-doubt
operating-system
job
process-scheduling
+
–
16
votes
2
answers
63
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
Operating System
gatecse-2022
operating-system
process-scheduling
round-robin-scheduling
2-marks
+
–
2
votes
1
answer
64
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
770
views
Gateprepbuddy
asked
Jan 29, 2022
Operating System
ace-test-series
process-scheduling
round-robin-scheduling
operating-system
+
–
0
votes
2
answers
65
#self doubt
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
shivang1234
626
views
shivang1234
asked
Jan 19, 2022
Operating System
process-scheduling
operating-system
+
–
1
votes
1
answer
66
#Self Doubt OS CPU scheduling?
Does non preemptive CPU scheduling needs hardware support. kindly explain.
Does non preemptive CPU scheduling needs hardware support.kindly explain.
iarnav
406
views
iarnav
asked
Jan 12, 2022
Operating System
process-scheduling
operating-system
context-switch
+
–
2
votes
1
answer
67
Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O of all the processes can proceed in parallel. The absolute difference of CPU utilization (over a long period of time) using FCFS and Round Robin (time quantum 10ms) for this system is _____ %
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O ...
LRU
2.4k
views
LRU
asked
Dec 22, 2021
Operating System
test-series
operating-system
process-scheduling
+
–
1
votes
0
answers
68
Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O of all the processes can proceed in parallel. The absolute difference of CPU utilization (over a long period of time) using FCFS and Round Robin (time quantum 10ms) for this system is _____ %
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O ...
LRU
386
views
LRU
asked
Dec 14, 2021
Operating System
test-series
operating-system
cpu
process-scheduling
process
+
–
2
votes
1
answer
69
Applied Grand Test 2
Three processes P1, P2 and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent the first 20% of their execution time doing I/O and the rest 80% in CPU processing. What is the percentage utilization of CPU using FCFS scheduling algorithm?
Three processes P1, P2 and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent the first 20% of the...
LRU
5.8k
views
LRU
asked
Nov 24, 2021
Operating System
test-series
operating-system
process-scheduling
+
–
1
votes
1
answer
70
self doubt - FCFS - OS
Does FCFS suffer from starvation?
Does FCFS suffer from starvation?
atulcse
1.0k
views
atulcse
asked
Nov 4, 2021
Operating System
operating-system
process-scheduling
+
–
1
votes
1
answer
71
#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
Operating System
operating-system
process-scheduling
round-robin-scheduling
context-switch
+
–
25
votes
2
answers
72
GATE CSE 2021 Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy ... $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...
Arjun
10.6k
views
Arjun
asked
Feb 18, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
process-scheduling
1-mark
+
–
14
votes
6
answers
73
GATE CSE 2021 Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$ bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
Arjun
9.3k
views
Arjun
asked
Feb 18, 2021
Operating System
gatecse-2021-set1
operating-system
process-scheduling
numerical-answers
1-mark
+
–
4
votes
4
answers
74
NIELIT 2016 MAR Scientist C - Section C: 7
In real-time operating systems, which of the following is the most suitable scheduling scheme? round-robin first-come-first-served preemptive random scheduling
In real-time operating systems, which of the following is the most suitable scheduling scheme?round-robinfirst-come-first-servedpreemptiverandom scheduling
admin
1.3k
views
admin
asked
Apr 2, 2020
Operating System
nielit2016mar-scientistc
operating-system
process-scheduling
+
–
3
votes
2
answers
75
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 9
Which of the following scheduling algorithms could result in starvation? Priority Round Robin FCFS None of the above
Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above
admin
3.5k
views
admin
asked
Apr 1, 2020
Operating System
nielit2017oct-assistanta-it
operating-system
process-scheduling
+
–
4
votes
3
answers
76
NIELIT 2017 DEC Scientific Assistant A - Section B: 34
Process is in a ready state _______ . when process is scheduled to run after some execution when process is unable to run until some task has been completed when process is using the $CPU$ none of the options
Process is in a ready state _______ .when process is scheduled to run after some executionwhen process is unable to run until some task has been completedwhen process is ...
admin
2.3k
views
admin
asked
Mar 31, 2020
Operating System
nielit2017dec-assistanta
operating-system
process-scheduling
+
–
2
votes
3
answers
77
NIELIT 2017 DEC Scientific Assistant A - Section B: 57
Starvation can be avoided by which of the following statements: By using shortest job first resource allocation policy . By using first come first serve resources allocation policy. (i) only (i) and (ii) only (ii) only None of the options
Starvation can be avoided by which of the following statements:By using shortest job first resource allocation policy .By using first come first serve resources allocatio...
admin
2.3k
views
admin
asked
Mar 31, 2020
Operating System
nielit2017dec-assistanta
operating-system
process-scheduling
+
–
1
votes
2
answers
78
NIELIT 2016 DEC Scientist B (IT) - Section B: 56
The degree of multi programming is controlled by: CPU Scheduler Long-term Scheduler Context Switching Medium term Scheduler
The degree of multi programming is controlled by:CPU SchedulerLong-term SchedulerContext SwitchingMedium term Scheduler
admin
2.7k
views
admin
asked
Mar 31, 2020
Operating System
nielit2016dec-scientistb-it
operating-system
process-scheduling
+
–
2
votes
2
answers
79
NIELIT 2017 July Scientist B (IT) - Section B: 44
Consider three processes (process id $0,1,2$ respectively) with compute time bursts $2,4$ and $8$ time units. All processes arrive at time zero. Consider the Longest Remaining Time First (LRTF) scheduling algorithm. In LRTF ties are broken by ... with the lowest process id. The average turn around time is $13$ units $14$ units $15$ units $16$ units
Consider three processes (process id $0,1,2$ respectively) with compute time bursts $2,4$ and $8$ time units. All processes arrive at time zero. Consider the Longest Rema...
admin
1.7k
views
admin
asked
Mar 30, 2020
Operating System
nielit2017july-scientistb-it
operating-system
process-scheduling
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
15
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
