Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged process-scheduling
1
votes
1
answer
391
Virtual Gate Test Series: Operating System - I/O Operation
Suppose that a process spends a fraction of time P performing CPU activity. With n processes in memory at once, the probability that all n processes are performing I/O operation. $P^{n}$ $1-P^{n}$ $(1-P)^{n}$ $1-(1-P)^{n}$
Suppose that a process spends a fraction of time P performing CPU activity. With n processes in memory at once, the probability that all n processes are performing I/O op...
khushtak
319
views
khushtak
asked
Jan 13, 2016
Operating System
operating-system
process-scheduling
virtual-gate-test-series
+
–
2
votes
1
answer
392
MadeEasy Test Series: Operating System - Process Schedule
Consider four processes all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time doing CPU, the next 60% of doing I/O computation and the last ... high priority given to lowest process id] (upto one decimal place) my ans is 16.5 but ans is given 24.5
Consider four processes all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution ti...
khushtak
1.4k
views
khushtak
asked
Jan 9, 2016
Operating System
operating-system
process-scheduling
made-easy-test-series
+
–
0
votes
1
answer
393
Better avg turnaround time
Round robin scheduling or shortest job first scheduling,which one has better average turnaround time?
Round robin scheduling or shortest job first scheduling,which one has better average turnaround time?
Sara
440
views
Sara
asked
Jan 8, 2016
Operating System
operating-system
process-scheduling
+
–
1
votes
1
answer
394
Problem on Round Robin scheduling with scheduling overhead given
worst_engineer
1.4k
views
worst_engineer
asked
Jan 4, 2016
Operating System
operating-system
process-scheduling
+
–
1
votes
1
answer
395
Minimum possible schedule length for the completion of three process
worst_engineer
1.1k
views
worst_engineer
asked
Jan 4, 2016
Operating System
operating-system
process-scheduling
+
–
3
votes
1
answer
396
Process Scheduling State
A process in which of the following state is best suited for swapping into main memory? (A) Ready Suspended (B) Blocked Suspended (C) Running (D) Blocked
A process in which of the following state is best suited for swapping into main memory?(A) Ready Suspended (B) Blocked Suspended (C) Running ...
Hardi Shah
2.2k
views
Hardi Shah
asked
Dec 27, 2015
Operating System
process-scheduling
operating-system
test-series
+
–
2
votes
3
answers
397
OS Scheduling
We are given a computer system consisting of a CPU and a disk. We are told that, each user request has a compute time of 80 msec and an average generates 10 disk requests. We are further told that, the service time at the disk is 10 msec. What is the maximum number of user requests that can be satisfied per second?
We are given a computer system consisting of a CPU and a disk. We are told that, each user request has a compute time of 80 msec and an average generates 10 disk requests...
Abhishekcs10
1.6k
views
Abhishekcs10
asked
Dec 27, 2015
Operating System
process-scheduling
operating-system
+
–
3
votes
1
answer
398
MadeEasy Test Series: Operating System - Process Schedule
Suppose a system uses shortest job first scheduling and exponential average of the measured length of previous CPU burst is 0.25. If the initial value of the predicted CPU burst time is 4 unit. The predicted time for 4th CPU burst for a process with burst time of 4 unit, 12 unit and 8 unit respectively (units) is ______.
Suppose a system uses shortest job first scheduling and exponential average of the measured length of previous CPU burst is 0.25. If the initial value of the predicted CP...
Sandeep Singh
1.5k
views
Sandeep Singh
asked
Dec 21, 2015
Operating System
operating-system
process-scheduling
made-easy-test-series
+
–
1
votes
1
answer
399
CPU Scheduling
Anurag_s
483
views
Anurag_s
asked
Dec 20, 2015
Operating System
process-scheduling
+
–
2
votes
1
answer
400
Round Robin Scheduling
How round robin will work
How round robin will work
Pradip Nichite
842
views
Pradip Nichite
asked
Dec 9, 2015
Operating System
process-scheduling
operating-system
+
–
3
votes
2
answers
401
CPU utilization
If the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by, a. $\frac{p}{n}$ b. $p^{n}$ c. $1-p^{n}$ d. $n-p^{n}$
If the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by,a. $\frac{p}{n}$b. $p^{n}$c. $1-p^{n}$d. $n-p^{n}$
Pradip Nichite
3.9k
views
Pradip Nichite
asked
Dec 9, 2015
Operating System
operating-system
process-scheduling
+
–
6
votes
4
answers
402
Question on process state transition
Answer to the above question is (C). I am unable to understand that how can a process in ready state can get blocked. Please give an explanation.
Answer to the above question is (C). I am unable to understand that how can a process in ready state can get blocked. Please give an explanation.
shikharV
3.3k
views
shikharV
asked
Nov 28, 2015
Operating System
process-scheduling
operating-system
+
–
3
votes
2
answers
403
Question on CPU scheduling algorithm
Between Round robin and shortest job first CPU scheduling algorithm which one has better average turnaround time?
Between Round robin and shortest job first CPU scheduling algorithm which one has better average turnaround time?
shikharV
1.9k
views
shikharV
asked
Nov 27, 2015
Operating System
process-scheduling
operating-system
+
–
5
votes
1
answer
404
OS Gateforum Section test
Consider four processes with a burst time of $10, 20, 30, 40$ all process arrived at time $0$. Each process spends first $10$% of its execution time doing $i/0$, next $40$% time doing CPU operations, next $20$ ... last $30$% time doing CPU operations. The system uses shortest remaining time next algorithm for scheduling. Calculate the completion time of $P3$?
Consider four processes with a burst time of $10, 20, 30, 40$ all process arrived at time $0$. Each process spends first $10$% of its execution time doing $i/0$, next $40...
Akshay Jindal
979
views
Akshay Jindal
asked
Oct 30, 2015
Operating System
operating-system
test-series
process-scheduling
+
–
11
votes
10
answers
405
ISRO2015-38
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run sequentially? 10 20 30 40
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run...
ajit
11.2k
views
ajit
asked
Oct 12, 2015
Operating System
process-scheduling
isro2015
+
–
2
votes
4
answers
406
When ever a process is going running to blocked state its get pre-empted right ??
When ever a process is going running to blocked state its get pre-empted right ?? so this is also a preemptive scheduling ??
When ever a process is going running to blocked state its get pre-empted right ??so this is also a preemptive scheduling ??
Pranay Datta 1
2.7k
views
Pranay Datta 1
asked
Oct 11, 2015
Operating System
process-scheduling
+
–
6
votes
2
answers
407
Scheduling algorithm
Which of the following Algorithm favour CPU bound Bound process ? 1) RR 2) FCFS 3) Multilevel feedback queue option are : a) 1 only b) 2 only c) 1 and 2 only d) 1 and 3 only
Which of the following Algorithm favour CPU bound Bound process ?1) RR 2) FCFS 3) Multilevel feedback queueoption are : a) 1 onlyb) 2 onlyc) 1 and 2 onlyd) 1 and 3 ...
priti sharma
10.2k
views
priti sharma
asked
Oct 6, 2015
Operating System
process-scheduling
+
–
0
votes
3
answers
408
Which of the following is correct?
Consider all the processes are arriving at large time intervals. Let $t$ be the time interval between two processes $p_i$ and $p_{i+1}$ for any $i$ and service time of $p_i$ is $s_i$. If $t > s_i$ for every $i$, then find the best strategy to schedule the processes. (a) FCFS (b) SJN (c) RR (d) SRTF
Consider all the processes are arriving at large time intervals.Let $t$ be the time interval between two processes $p_i$ and $p_{i+1}$ for any $i$ and service time of $...
Nishikant kumar
1.4k
views
Nishikant kumar
asked
Sep 19, 2015
Operating System
process-scheduling
+
–
0
votes
1
answer
409
Which scheduling algo has the second highest TAT?
Shefali
489
views
Shefali
asked
Sep 11, 2015
Operating System
process-scheduling
+
–
10
votes
4
answers
410
Which of the following process scheduling algorithm may lead to starvation?
Which of the following process scheduling algorithm may lead to starvation (1)SJF (2)SRTF (3)Priority(without preemption) (4)Priority(with preemption) a)1,2,3 b)1,2,4 c)1,3,4 d)1,2,3,4 e)1,3 f)1,4
Which of the following process scheduling algorithm may lead to starvation (1)SJF(2)SRTF(3)Priority(without preemption)(4)Priority(with preemption)a)1,2,3 ...
ajit
23.1k
views
ajit
asked
Sep 9, 2015
Operating System
process-scheduling
+
–
47
votes
6
answers
411
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered:$$\begin{arr...
Arjun
12.9k
views
Arjun
asked
Jul 10, 2015
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
42
votes
5
answers
412
GATE CSE 2015 Set 3 | Question: 34
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? ... First Come First Serve Non-preemptive Shortest job first Shortest Remaining Time Round Robin with Quantum value two
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?$$\small \begin{array}{|c|c|c|} \h...
go_editor
19.1k
views
go_editor
asked
Feb 15, 2015
Operating System
gatecse-2015-set3
operating-system
process-scheduling
normal
+
–
35
votes
6
answers
413
GATE CSE 2015 Set 3 | Question: 1
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is : $n$ $n^2$ $2^n$ Independent of $n$
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is :$n$$n^2$$2^n$Independent of $n$
go_editor
30.5k
views
go_editor
asked
Feb 14, 2015
Operating System
gatecse-2015-set3
operating-system
process-scheduling
easy
+
–
105
votes
14
answers
414
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...
makhdoom ghaya
38.1k
views
makhdoom ghaya
asked
Feb 13, 2015
Operating System
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
+
–
2
votes
2
answers
415
CPU Scheduling
Q1) An OS contains 10 identical processes that were initiated at the same time. Each process contains 15 identical requests, and each request consumes 20msec of CPU time. A request is followed by an I/O operation that consumes 10 msec. The system consumes 2 msec in CPU ... Q 2) In the above problem , the scheduler length is A) 3300 msec B) 3600 msec C) 6300 msec D) 6600 msec
Q1)An OS contains 10 identical processes that were initiated at the same time. Each process contains 15 identical requests, and each request consumes 20msec of CPU time. ...
tushark
2.2k
views
tushark
asked
Nov 5, 2014
Operating System
process-scheduling
+
–
27
votes
1
answer
416
GATE IT 2005 | Question: 60
We wish to schedule three processes $P1$, $P2$ and $P3$ ... scheduling respectively? $30$ sec, $30$ sec $30$ sec, $10$ sec $42$ sec, $42$ sec $30$ sec, $42$ sec
We wish to schedule three processes $P1$, $P2$ and $P3$ on a uniprocessor system. The priorities, CPU time requirements and arrival times of the processes are as shown be...
Ishrat Jahan
5.4k
views
Ishrat Jahan
asked
Nov 3, 2014
Operating System
gateit-2005
operating-system
process-scheduling
normal
+
–
30
votes
4
answers
417
GATE IT 2006 | Question: 54
The arrival time, priority, and duration of the CPU and I/O bursts for each of three processes $P_1, P_2 $ and $P_3$ ... $P_3$? $\text{11, 15, 9}$ $\text{10, 15, 9}$ $\text{11, 16, 10}$ $\text{12, 17, 11}$
The arrival time, priority, and duration of the CPU and I/O bursts for each of three processes $P_1, P_2 $ and $P_3$ are given in the table below. Each process has a CPU ...
Ishrat Jahan
12.8k
views
Ishrat Jahan
asked
Oct 31, 2014
Operating System
gateit-2006
operating-system
process-scheduling
normal
+
–
40
votes
5
answers
418
GATE IT 2006 | Question: 12
In the working-set strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there are enough extra frames. It selects a process to suspend if the sum of the sizes of the working-sets exceeds the total number of available frames. I only II only Neither I nor II Both I and II
In the working-set strategy, which of the following is done by the operating system to prevent thrashing?It initiates another process if there are enough extra frames.It ...
Ishrat Jahan
10.6k
views
Ishrat Jahan
asked
Oct 31, 2014
Operating System
gateit-2006
operating-system
process-scheduling
normal
+
–
60
votes
6
answers
419
GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs...
Ishrat Jahan
14.6k
views
Ishrat Jahan
asked
Oct 29, 2014
Operating System
gateit-2007
operating-system
process-scheduling
normal
+
–
26
votes
4
answers
420
GATE IT 2008 | Question: 55
If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process, then the policy will degenerate to shortest job first degenerate to priority scheduling degenerate to first come first serve none of the above
If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process, then the policy willdegenerate to shortest job ...
Ishrat Jahan
5.6k
views
Ishrat Jahan
asked
Oct 28, 2014
Operating System
gateit-2008
operating-system
process-scheduling
easy
+
–
Page:
« prev
1
...
9
10
11
12
13
14
15
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register