Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged process-scheduling
0
votes
1
answer
151
Galvin Edition 9 Exercise 6 Question 2 (Page No. 306)
Explain the difference between preemptive and nonpreemptive scheduling.
Explain the difference between preemptive and nonpreemptive scheduling.
akash.dinkar12
280
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
process-scheduling
descriptive
+
–
0
votes
1
answer
152
Galvin Edition 9 Exercise 6 Question 1 (Page No. 305)
A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given $n$ processes to be scheduled on one processor, how many different schedules are possible? Give a formula in terms of $n$.
A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given $n$ processes to be scheduled on one processor, how many different sche...
akash.dinkar12
453
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
process-scheduling
descriptive
+
–
0
votes
0
answers
153
Self doubt
Which is having minimum avg waiting time among all other algorithms shortest job first or srtf?
Which is having minimum avg waiting time among all other algorithms shortest job first or srtf?
Winner
180
views
Winner
asked
Mar 19, 2019
Operating System
process-scheduling
+
–
2
votes
1
answer
154
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
772
views
srestha
asked
Mar 11, 2019
Operating System
ace-test-series
operating-system
process-scheduling
round-robin-scheduling
+
–
1
votes
1
answer
155
cpu scheduling
In which of the following case CPU utilization will be higher? (a) If all the processes are I/O bound (b) Is all the processes are equally CPU bound and I/O bound (c) If all the processes are CPU bound (d) Both (B) and (C)
In which of the following case CPU utilization will be higher?(a) If all the processes are I/O bound(b) Is all the processes are equally CPU bound and I/O bound(c) If all...
Ram Ahuja
2.7k
views
Ram Ahuja
asked
Feb 13, 2019
Operating System
operating-system
process-scheduling
+
–
40
votes
4
answers
156
GATE CSE 2019 | Question: 41
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: ... Time First scheduling algorithm. If the average waiting time of the processes is $1$ millisecond, then the value of $Z$ is _____
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:$$\begin{array}{|c|c|c|c|c|} \h...
Arjun
28.7k
views
Arjun
asked
Feb 7, 2019
Operating System
gatecse-2019
numerical-answers
operating-system
process-scheduling
2-marks
+
–
0
votes
0
answers
157
Self dout
Does increasing number of threads decrease total waiting time of the process in terms of round robin scheduling or does it remain the same? Can you please explain why
Does increasing number of threads decrease total waiting time of the process in terms of round robin scheduling or does it remain the same?Can you please explain why
sreenivas.s1995
348
views
sreenivas.s1995
asked
Jan 31, 2019
Operating System
process-scheduling
+
–
1
votes
1
answer
158
CPU Scheduling (SRTF)
I have solved this but not getting the answer…. will any one verify its correctness plz Thank you:)
I have solved this but not getting the answer…. will any one verify its correctness plzThank you:)
Nandkishor3939
2.7k
views
Nandkishor3939
asked
Jan 17, 2019
Operating System
process-scheduling
operating-system
+
–
1
votes
1
answer
159
Applied Course | Mock GATE | Test 1 | Question: 15
Suppose there are $3$ jobs A, B and C arrive at approximately at the same time. But job A arrives slightly earlier than job B, and job B arrives alightly earlier than job C. Job A requires $2$ sec of CPU, Job B requires $8$ sec ... Given Round Robin scheduler, what is the turn around time of job B? $1$ seconds $4$ seconds $16$ seconds $17$ seconds
Suppose there are $3$ jobs A, B and C arrive at approximately at the same time. But job A arrives slightly earlier than job B, and job B arrives alightly earlier than job...
Applied Course
571
views
Applied Course
asked
Jan 16, 2019
Operating System
applied-course-2019-mock1
operating-system
process-scheduling
+
–
1
votes
1
answer
160
MadeEasy Full Length Test 2019: Operating System - Process Schedule
jatin khachane 1
1.2k
views
jatin khachane 1
asked
Jan 12, 2019
Operating System
operating-system
process-scheduling
made-easy-test-series
+
–
0
votes
0
answers
161
MadeEasy Workbook: Operating System - Process Schedule
How to solve this question?
How to solve this question?
Jyoti Kumari97
395
views
Jyoti Kumari97
asked
Jan 11, 2019
Operating System
operating-system
process-scheduling
made-easy-booklet
+
–
0
votes
1
answer
162
Process vs Threads
Identify Correct Statements : A. Forked Process shares the address space and other resources with parent. B. Forked Process can't use multiprocessor for parallel execution. C. Security is better in Process in comparison to threads. D. Thread switching doesn't require Kernel Support unlike threads. Explain Everyone of them (Mulitiple choices can be present)
Identify Correct Statements :A. Forked Process shares the address space and other resources with parent.B. Forked Process can't use multiprocessor for parallel execution....
Na462
1.8k
views
Na462
asked
Jan 8, 2019
Operating System
operating-system
threads
process-scheduling
+
–
0
votes
0
answers
163
UPPCL AE 2018:74
Consider the following statements regarding life time of any normally terminating process in an operating system. The process must be in $\text{RUNNING}$ state at least once during its execution. The process must be in $\text{RUNNING}$ state at least twice during its execution. The process must be ... $\text{III}$ $\text{I}$ and $\text{II}$ $\text{I, III}$ and $\text{IV}$
Consider the following statements regarding life time of any normally terminating process in an operating system.The process must be in $\text{RUNNING}$ state at least on...
admin
283
views
admin
asked
Jan 5, 2019
Operating System
uppcl2018
operating-system
process-scheduling
+
–
0
votes
0
answers
164
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?
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...
subho16
384
views
subho16
asked
Jan 4, 2019
Operating System
operating-system
round-robin-scheduling
process-scheduling
process
+
–
1
votes
2
answers
165
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
Operating System
ugcnetcse-dec2018-paper2
operating-system
process-scheduling
round-robin-scheduling
+
–
0
votes
0
answers
166
Madeeasy Test Series: Operating System - Process Schedule
For the given question instead of the given order if we take one unit of P2 as its arrival time is 1 and then schedule P1 next we get the same answer,even in the hint they have given as the process which comes first ... and the solution given ends up giving the same answer,does this happen for all cases or just happening for this question?
For the given question instead of the given order if we take one unit of P2 as its arrival time is 1 and then schedule P1 next we get the same answer,even in the hint th...
sripo
891
views
sripo
asked
Jan 1, 2019
Operating System
process-scheduling
operating-system
sjf
made-easy-test-series
+
–
0
votes
2
answers
167
Zeal Test Series 2019: Operating System - Process Schedule
ANSWER IS C) BUT I AM NOT GETTING HOW 2ND IS CORRECT
ANSWER IS C) BUT I AM NOT GETTING HOW 2ND IS CORRECT
Prince Sindhiya
472
views
Prince Sindhiya
asked
Dec 16, 2018
Operating System
zeal
operating-system
process-scheduling
zeal2019
+
–
0
votes
1
answer
168
Zeal Test Series 2019: Operating System - Process Schedule
Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; thisinvolves 1 switching context 2.jumping to the proper location in the user program to restart that program 3 switching to user mode 4. All the above ANSWER IS D I AM NOT GETTING 2 AND 3
Dispatcher module gives control of the CPU to the process selected by the short-term scheduler; thisinvolves1 switching context2.jumping to the proper location in the use...
Prince Sindhiya
2.6k
views
Prince Sindhiya
asked
Dec 16, 2018
Operating System
operating-system
process-scheduling
zeal
zeal2019
+
–
0
votes
1
answer
169
Zeal Test Series 2019: Operating System - Process Schedule
CPU bound jobs will hold CPU until exit or I/O. Long periods where no I/O requests issued, and theCPU is held resulting in poor I/O device utilization. This degradation in performance can be seen inwhich of the following? (A)SJF ( B) RR (C)FCFS (D)SRTF
CPU bound jobs will hold CPU until exit or I/O. Long periods where no I/O requests issued, and theCPU is held resulting in poor I/O device utilization. This degradation i...
Prince Sindhiya
849
views
Prince Sindhiya
asked
Dec 16, 2018
Operating System
zeal
operating-system
process-scheduling
zeal2019
+
–
2
votes
0
answers
170
Zeal Test Series 2019: Operating System - Process Schedule
which one of the following is true. 1. round-robin scheduling minimizes average completion time. 2. during periods when the processor spends all of its cycles handling interrupts, the processscheduler is irrelevant to the machine’s performance. 3. priority scheduling minimizes average waiting time 4. srtf could maximize the cpu utilization
which one of the following is true.1. round-robin scheduling minimizes average completion time.2. during periods when the processor spends all of its cycles handling inte...
Prince Sindhiya
632
views
Prince Sindhiya
asked
Dec 16, 2018
Operating System
zeal
operating-system
process-scheduling
zeal2019
+
–
0
votes
0
answers
171
Zeal Test Series 2019: Operating System - Process Schedule
Consider the following table: Pid BT I/O BT $P_0$ 6 4 1 $P_1$ 8 6 2 $P_2$ 12 8 3 Using the shortest remaining time first, find the completion time of a process P2 , if the context switching overhead is 1 unit 36 ... finishes it's io at 44 unit , please tell me that is it required to consider the context switching time here just see it
Consider the following table:PidBTI/OBT$P_0$ 6 4 1$P_1$ 8 6 2$P_2$ 12 8 3Using the shortest remaining time first, find the completion ...
Prince Sindhiya
474
views
Prince Sindhiya
asked
Dec 12, 2018
Operating System
zeal
operating-system
process-scheduling
zeal2019
+
–
0
votes
1
answer
172
Self Doubt
Which of the following ALWAYS gives MINIMUM average waiting time and minimum average Turn around time SJF (Non preemptive) SRTF (Preemptive)
Which of the following ALWAYS gives MINIMUM average waiting time and minimum average Turn around time SJF (Non preemptive)SRTF (Preemptive)
jatin khachane 1
547
views
jatin khachane 1
asked
Dec 11, 2018
Operating System
operating-system
process-scheduling
+
–
1
votes
3
answers
173
NIELIT 2018-78
Identify the true statement from the given statements. FIFO is non-preemptive Round robin is non-preemptive Multilevel Queue Scheduling is non-preemptive $1$ $1$ and $2$ $1$, $2$ and $3$ $2$
Identify the true statement from the given statements.FIFO is non-preemptiveRound robin is non-preemptiveMultilevel Queue Scheduling is non-preemptive$1$$1$ and $2$$1$, $...
Arjun
2.5k
views
Arjun
asked
Dec 7, 2018
Operating System
nielit-2018
operating-system
process-scheduling
+
–
1
votes
0
answers
174
GELVIN 9th edition
Consider a preemptive priority scheduling algorithm based on dynamically changing priorities . Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue, but not running), its priority changes at the rate A. When it is running, ... algorithm that results from B> A > 0? b. What is the algorithm that results from A < B< 0?
Consider a preemptive priority scheduling algorithm based on dynamically changing priorities . Larger priority numbers imply higher priority. When a process is waiting...
Piyush mishra
681
views
Piyush mishra
asked
Dec 2, 2018
Operating System
process-scheduling
+
–
0
votes
0
answers
175
Test Series (GATE Forum): Operating System - Process Schedule
Gupta731
455
views
Gupta731
asked
Nov 26, 2018
Operating System
gforum-test-series
operating-system
process-scheduling
+
–
0
votes
2
answers
176
MadeEasy Test Series: Operating System - Process Schedule
CHïntän ÞäTël
972
views
CHïntän ÞäTël
asked
Nov 17, 2018
Operating System
made-easy-test-series
operating-system
process-scheduling
+
–
0
votes
0
answers
177
Self doubt
Consider the following justifications for commonly using the two-level CPU scheduling: I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is ... . Which of the following is true ? (A) 1,3 and 4 (B) 1 and 2 (C )3 and 4 (D)1 and 3
Consider the following justifications for commonly using the two-level CPU scheduling: I. It is used when memory is too small to hold all the ready processes. II. Because...
Mahbub Alam
221
views
Mahbub Alam
asked
Nov 16, 2018
Operating System
operating-system
process-scheduling
+
–
1
votes
0
answers
178
Process Management
Consider the following process scheduling data: Process Arrival Time Processing Time A 0.000 3 B 1.001 6 C 4.001 4 D 6.001 2 Which of the following is true? a) FCFS and SJF have same average throughput but not SRTF b) SRTF and SJF have ... with time quantum=1 and SJF have same average throughput d) FCFS,SRTF,Round Robin with time quantum=2 and SJF have same average throughput
Consider the following process scheduling data:Process Arrival Time Processing TimeA 0.000 3B 1.001 ...
RahulRoy31
976
views
RahulRoy31
asked
Oct 29, 2018
Operating System
operating-system
process-scheduling
+
–
0
votes
0
answers
179
Operating system
Vaishnavi01
335
views
Vaishnavi01
asked
Oct 26, 2018
Operating System
operating-system
process-scheduling
+
–
0
votes
0
answers
180
Which mode to take preemptive or non preemptive
If the mode for scheduling is not mentioned whether to do preemptive or non preemptive which one should we take when solving Gate questions?
If the mode for scheduling is not mentioned whether to do preemptive or non preemptive which one should we take when solving Gate questions?
sripo
293
views
sripo
asked
Oct 24, 2018
Operating System
process-scheduling
operating-system
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
15
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register