Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged process-scheduling
1
votes
2
answers
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)
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
276
views
delxbydelt
asked
Mar 15
Operating System
process-scheduling
operating-system
round-robin-scheduling
context-switch
process-synchronization
+
–
5
votes
3
answers
2
GATE CSE 2024 | Set 2 | Question: 27
Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is its arrival time, and the second value is its $\text{CPU}$ ... $\mathrm{SRTF}=7, \mathrm{NP}-\mathrm{SJF}=7.5$ $\mathrm{SRTF}=7, \mathrm{NP}-\mathrm{SJF}=8.5$
Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is...
Arjun
2.4k
views
Arjun
asked
Feb 16
Operating System
gatecse2024-set2
operating-system
process-scheduling
+
–
2
votes
1
answer
3
GATE CSE 2024 | Set 1 | Question: 15
Which of the following process state transitions is/are NOT possible? Running to Ready Waiting to Running Ready to Waiting Running to Terminated
Which of the following process state transitions is/are NOT possible?Running to ReadyWaiting to RunningReady to WaitingRunning to Terminated
Arjun
2.7k
views
Arjun
asked
Feb 16
Operating System
gatecse2024-set1
operating-system
process-scheduling
multiple-selects
+
–
3
votes
2
answers
4
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 24
Consider a job A arrives at time $T=0$ and job length of $500 \mathrm{~ms}$. Job $B$ arrives at time $\mathrm{T}=100 \mathrm{~ms}$ with a length of $100 \mathrm{~ms}$. Considering the Shortest Remaining Time First Scheduler, what does ... for $100 \mathrm{~ms}$, then $B$ runs for $100 \mathrm{~ms}$, then A runs for $300 \mathrm{~ms}$
Consider a job A arrives at time $T=0$ and job length of $500 \mathrm{~ms}$. Job $B$ arrives at time $\mathrm{T}=100 \mathrm{~ms}$ with a length of $100 \mathrm{~ms}$.Con...
GO Classes
422
views
GO Classes
asked
Feb 5
Operating System
goclasses2024-mockgate-14
operating-system
process-scheduling
1-mark
+
–
0
votes
3
answers
5
Operating System Round Robin
Does Round Robin guarantee bounded waiting?
Does Round Robin guarantee bounded waiting?
Mrityudoot
304
views
Mrityudoot
asked
Jan 24
Operating System
operating-system
round-robin-scheduling
process-scheduling
+
–
1
votes
2
answers
6
Arihant Gate Tutor Operating System Intro Excercise 1
6. Consider a set of 5 processes whose arrival time, CPU time needed are given below. Process Arrival time CPU time P1 0 10 P₂ 0 5 P3 2 3 P4 5 20 P5 10 2 If the CPU scheduling is SJF with pre-emption, the average waiting time will be (a) 8 ms (b) 14 ms (c) 6.2 ms (d) None of these
6. Consider a set of 5 processes whose arrival time, CPU time needed are given below. Process Arrival time CPU time P1 0 10 P₂ 0 5 P3 2 3 P4 5 20 P5 10 2 If the CPU sch...
rajRaunakKumar
275
views
rajRaunakKumar
asked
Jan 21
Operating System
operating-system
process-scheduling
+
–
0
votes
0
answers
7
GATE Previous Year
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Each Process spends 20% of its Service time on I/O followed by 70% of its ... Concurrent I/O and Scheduling Overhead to be 1 second. Calculate for FCFS Scheduling (i) Average TAT of Processes (2)% CPU idleness.
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Eac...
rajRaunakKumar
215
views
rajRaunakKumar
asked
Jan 21
Operating System
operating-system
process-scheduling
+
–
4
votes
2
answers
8
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 38
Consider the following jobs along with their arrival and execution time. ... What is the average turnaround time for these processes with the preemptive shortest remaining processing time first (SRPT) algorithm?
Consider the following jobs along with their arrival and execution time.$$\begin{array}{c|c|c}\textbf{Job} & \textbf{Arrival time} & \textbf{Execution time} \\\hline \mat...
GO Classes
727
views
GO Classes
asked
Jan 21
Operating System
goclasses2024-mockgate-12
goclasses
numerical-answers
operating-system
process-scheduling
2-marks
+
–
5
votes
1
answer
9
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
427
views
GO Classes
asked
Jan 13
Operating System
goclasses2024-mockgate-11
goclasses
numerical-answers
operating-system
process-scheduling
round-robin-scheduling
2-marks
+
–
1
votes
2
answers
10
ISRO 2024
Process Scheduler Type Activity (i) Long Term Scheduler (P) executes much faster to reduce wastage of CPU time (ii) Medium term scheduler (Q) controls degree of multi programming (iii) Short Term scheduler (R) is associated with swapping with respect to Process Schedulers of an operating system mentioned above in the table ... P), (ii) - (R), (iii) - (Q) (i) - (R), (ii) - (Q), (iii) - (P)
Process Scheduler Type Activity(i)Long Term Scheduler(P)executes much faster to reduce wastage of CPU time(ii)Medium term scheduler(Q)controls degree of multi programming...
Ramayya
333
views
Ramayya
asked
Jan 7
Operating System
isro-2024
operating-system
process-scheduling
+
–
0
votes
0
answers
11
MadeEasy Test Series 2024 - In this question they have asked about the number of context switches that are happening. (Excluding the first and the last context switch). I am getting the answer as 5, according to the answer key it should be 6. I am not pre-empting process P when Q arrives as P has a higher priority than Q, in the solutions they have done the exact opposite, can anyone please tell me whether my approach is correct or I am missing onto something.
tishhaagrawal
441
views
tishhaagrawal
asked
Dec 4, 2023
Operating System
gate-preparation
operating-system
made-easy-test-series
process-scheduling
self-doubt
test-series
process
+
–
0
votes
1
answer
12
operating system
Consider a process scenario with n processes (n>1) with process ids P0, P1, .,Pn-1; with all processes arrive at time 0. The arrival times of all processes are stored in an array AT[] of size n with arrival time of process P0 at index 0, arrival time of process P1 at index 1 and so on. ... and O(n) 2.O(n) and O(n logn) 3.O(n) and O(n2) 4.O(n2) and O(n2) answer is 3 why not 2..
Consider a process scenario with n processes (n>1) with process ids P0, P1, ….,Pn-1; with all processes arrive at time 0. The arrival times of all processes are stored ...
24aaaa23
395
views
24aaaa23
asked
Oct 4, 2023
Operating System
operating-system
process-scheduling
+
–
0
votes
1
answer
13
Do implementing non preemptive scheduling requires hardware support?
Let’s take an example if I am scheduling processes in CPU using FCFS with IO Burst Time, then there will be context switching that requires hardware support. But my Teacher said Non-preemptive Algo’s don’t require hardware support.
Let’s take an example if I am scheduling processes in CPU using FCFS with IO Burst Time, then there will be context switching that requires hardware support. But my Tea...
vedantk
395
views
vedantk
asked
Aug 25, 2023
Operating System
operating-system
process-scheduling
+
–
1
votes
1
answer
14
UGC NET CSE | June 2023 | Part 2: 22
Consider the following table of arrival time and burst time for three processes $\text{P0,P1 P2}$: Process arrival time Burst time $\text{P0}$ $0 \mathrm{~ms}$ $7$ $\text{P1}$ $1 \mathrm{~ms}$ $3$ $\text{P2}$ $2 \mathrm{~ms}$ $7$ The pre-emptive ... waiting time for the three processes? $3 \mathrm{~ms}$ $3.67 \mathrm{~ms}$ $4.47 \mathrm{~ms}$ $4 \mathrm{~ms}$
Consider the following table of arrival time and burst time for three processes $\text{P0,P1 P2}$:Processarrival timeBurst time$\text{P0}$$0 \mathrm{~ms}$$7$$\text{P1}$$1...
admin
697
views
admin
asked
Jul 28, 2023
Operating System
ugcnetcse-june2023-paper2
operating-system
process-scheduling
+
–
0
votes
1
answer
15
OS handout
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Each Process spends 20% of its Service time on I/O followed by 70% ... . Assuming Concurrent I/O and negligible Scheduling Overhead. Calculate for FCFS Scheduling (i) Average TAT of Processes (2)% CPU idleness.
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Eac...
Aniket1710
2.0k
views
Aniket1710
asked
Jul 25, 2023
Operating System
process-scheduling
operating-system
+
–
2
votes
2
answers
16
GO Classes 2023 | IIITH Mock Test 1 | Question: 26
Four processes- $\text{P}_1, \text{P}_2, \text{P}_3,$ and $\text{P}_4-$ ... -job-first scheduling algorithm, what is the average waiting time for the four processes, in seconds? $2$ $3$ $4$ $5$
Four processes- $\text{P}_1, \text{P}_2, \text{P}_3,$ and $\text{P}_4-$ are scheduled to use a single processor. The following table shows the arrival time and duration o...
GO Classes
1.1k
views
GO Classes
asked
Mar 26, 2023
Operating System
goclasses2023-iiith-mock-1
goclasses
operating-system
process-scheduling
1-mark
+
–
1
votes
1
answer
17
#Operating system question #cpu scheduling
Consider arrival time and execution time for the following process:- P.id A.T B.T 1 2 5 2 7 9 3 8 3 4 10 4 Assume, each context switch requires 1ms time (excluding first and last context switch).then solve it using SRTF(shortest remaining time first)
Consider arrival time and execution time for the following process:-P.id A.T B.T1 2 52 7 93 8 34 10 4 Ass...
Syntax-error
1.7k
views
Syntax-error
asked
Mar 13, 2023
Operating System
operating-system
process-scheduling
context-switch
+
–
21
votes
5
answers
18
GATE CSE 2023 | Question: 17
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation? First-in First-Out Round Robin Priority Scheduling Shortest Job First
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation?First-in First-OutRound RobinPriority SchedulingShortest Job First
admin
14.6k
views
admin
asked
Feb 15, 2023
Operating System
gatecse-2023
operating-system
process-scheduling
multiple-selects
1-mark
+
–
Page:
1
2
3
4
5
6
...
15
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register