Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for scheduling
19
votes
1
answer
1
GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $$10, 7...
Kathleen
122k
views
Kathleen
asked
Oct 8, 2014
Operating System
gate1995
operating-system
disk-scheduling
normal
descriptive
+
–
105
votes
14
answers
2
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
+
–
35
votes
6
answers
3
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
+
–
94
votes
16
answers
4
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...
Ishrat Jahan
23.2k
views
Ishrat Jahan
asked
Oct 30, 2014
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
92
votes
4
answers
5
GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were crea...
Kathleen
19.7k
views
Kathleen
asked
Sep 17, 2014
Operating System
gatecse-2003
operating-system
process-scheduling
normal
+
–
43
votes
5
answers
6
GATE CSE 2006 | Question: 64
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 ... the process 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 lon...
Rucha Shelke
24.9k
views
Rucha Shelke
asked
Sep 26, 2014
Operating System
gatecse-2006
operating-system
process-scheduling
normal
+
–
21
votes
5
answers
7
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
+
–
60
votes
7
answers
8
GATE CSE 2006 | Question: 65
Consider three processes, all arriving at time zero, with total execution time of $10$, $20$ and $30$ units, respectively. Each process spends the first $\text{20%}$ of execution time doing I/O, the next $\text{70%}$ ... percentage of time does the CPU remain idle? $\text{0%}$ $\text{10.6%}$ $\text{30.0%}$ $\text{89.4%}$
Consider three processes, all arriving at time zero, with total execution time of $10$, $20$ and $30$ units, respectively. Each process spends the first $\text{20%}$ of e...
Rucha Shelke
31.5k
views
Rucha Shelke
asked
Sep 26, 2014
Operating System
gatecse-2006
operating-system
process-scheduling
normal
+
–
40
votes
4
answers
9
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
29.0k
views
Arjun
asked
Feb 7, 2019
Operating System
gatecse-2019
numerical-answers
operating-system
process-scheduling
2-marks
+
–
63
votes
5
answers
10
GATE CSE 2013 | Question: 10
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates the process priorities every $T$ time units and decides the next process ... is equivalent to the shortest-job-first algorithm. This algorithm is equivalent to the shortest-remaining-time-first algorithm.
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler re-evaluates th...
Arjun
28.6k
views
Arjun
asked
Sep 23, 2014
Operating System
gatecse-2013
operating-system
process-scheduling
normal
+
–
16
votes
2
answers
11
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.6k
views
Arjun
asked
Feb 15, 2022
Operating System
gatecse-2022
operating-system
process-scheduling
round-robin-scheduling
2-marks
+
–
57
votes
4
answers
12
GATE CSE 2004 | Question: 12
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give ... is the expected improvement in the I/O performance of user programs? $50 \%$ $40\%$ $25\%$ $0\%$
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Serv...
Kathleen
17.0k
views
Kathleen
asked
Sep 18, 2014
Operating System
gatecse-2004
operating-system
disk-scheduling
normal
+
–
52
votes
5
answers
13
GATE CSE 2016 Set 1 | Question: 20
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ... quantum less than the shortest CPU burst Uniform random Highest priority first with priority proportional to CPU burst length
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process schedu...
Sandeep Singh
14.3k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
process-scheduling
normal
+
–
47
votes
6
answers
14
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
+
–
29
votes
2
answers
15
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
go_editor
12.7k
views
go_editor
asked
Sep 29, 2014
Operating System
gatecse-2011
operating-system
process-scheduling
normal
+
–
89
votes
5
answers
16
GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the over...
Kathleen
22.1k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
+
–
10
votes
4
answers
17
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
+
–
60
votes
6
answers
18
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
+
–
17
votes
6
answers
19
GATE CSE 2020 | Question: 12
Consider the following statements about process state transitions for a system using preemptive scheduling. A running process can move to ready state. A ready process can move to running state. A blocked process can move to running state. A blocked process can move to ready state. ... TRUE? I, II, and III only II and III only I, II, and IV only I, II, III and IV only
Consider the following statements about process state transitions for a system using preemptive scheduling.A running process can move to ready state.A ready process can m...
Arjun
12.9k
views
Arjun
asked
Feb 12, 2020
Operating System
gatecse-2020
operating-system
process-scheduling
1-mark
easy
+
–
2
votes
1
answer
20
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
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register