menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent questions tagged sjf
Recent Blog Comments
Mock 2 are live now.
sir ,it's already 17th
It will be live soon.
This Year IISc is not taking students of computer...
Hi, could you please update us about the Mock...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Recent questions tagged sjf
0
votes
0
answers
1
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 they have given as the process which comes first should get first priority instead in ... first.My approach and the solution given ends up giving the same answer,does this happen for all cases or just happening for this question?
asked
Jan 1, 2019
in
Operating System
sripo
398
views
cpu-scheduling
operating-system
sjf
process-scheduling
made-easy-test-series
0
votes
1
answer
2
#OS Cpu scheduling doubt about SRTF turning into FCFS.
Let's say we have four processes as (P1, P2, P3, P4) and have Arrival time as (0,1,2,3) respectively, but all of them has same CPU Burst time as (10ms) then does SRTF will simply be behaving like FCFS?
Let's say we have four processes as (P1, P2, P3, P4) and have Arrival time as (0,1,2,3) respectively, but all of them has same CPU Burst time as (10ms) then does SRTF will simply be behaving like FCFS?
asked
Jul 17, 2018
in
Operating System
iarnav
307
views
cpu-scheduling
operating-system
sjf
process-scheduling
0
votes
1
answer
3
Scheduling SJF
asked
Jul 12, 2018
in
Operating System
Na462
467
views
cpu-scheduling
operating-system
sjf
0
votes
0
answers
4
#Galvin #CpuScheduling SJF VS SRTF Average waiting time doubt.
Let's say we have two CPU scheduling algorithm as SJF and SRTF and we have a arbitrary pool/set of processes with different ARRIVAL TIME and CPU BURST, then what CPU scheduling algorithm will result in minimum average ... of values or when arrival times are different than SRTF will ALWAYS have the less average waiting time over SJF?
Let's say we have two CPU scheduling algorithm as SJF and SRTF and we have a arbitrary pool/set of processes with different ARRIVAL TIME and CPU BURST, then what CPU scheduling algorithm will result in minimum average waiting time? Note : We know, with processes ... for only this set of values or when arrival times are different than SRTF will ALWAYS have the less average waiting time over SJF?
asked
Jul 11, 2018
in
Operating System
iarnav
1.4k
views
operating-system
cpu-scheduling
sjf
2
votes
0
answers
5
process Question
Facts about SJF Algorithm: Maximum Throughput Minimum Average TAT Maximum Response Time Maximum CPU Utilization
Facts about SJF Algorithm: Maximum Throughput Minimum Average TAT Maximum Response Time Maximum CPU Utilization
asked
May 28, 2018
in
Operating System
gulsanchouhan
483
views
operating-system
process-scheduling
sjf
0
votes
1
answer
6
UGCNET-dec2008-ii-8
Four jobs J1, J2, J3 and J4 are waiting to be run. Their expected run times are 9, 6, 3 and 5 respectively. In order to minimize average response time, the jobs should be run in the order: (A) J1 J2 J3 J4 (B) J4 J3 J2 J1 (C) J3 J4 J1 J2 (D) J3 J4 J2 J1
Four jobs J1, J2, J3 and J4 are waiting to be run. Their expected run times are 9, 6, 3 and 5 respectively. In order to minimize average response time, the jobs should be run in the order: (A) J1 J2 J3 J4 (B) J4 J3 J2 J1 (C) J3 J4 J1 J2 (D) J3 J4 J2 J1
asked
Sep 25, 2017
in
Operating System
rishu_darkshadow
238
views
ugcnetdec2008ii
operating-system
sjf
scheduling
0
votes
2
answers
7
Virtual Gate Test Series: Operating System - SJF (Exponential Averaging)
Calculate the Exponential averaging for the $\text{SJF}$ with $T_{1}=10,\alpha = 0.5$ and previous runs as $8,7,4,16$ $\text{(Give the answer correct to one decimal place).}$
Calculate the Exponential averaging for the $\text{SJF}$ with $T_{1}=10,\alpha = 0.5$ and previous runs as $8,7,4,16$ $\text{(Give the answer correct to one decimal place).}$
asked
Jan 13, 2017
in
Operating System
Purple
294
views
operating-system
process-scheduling
sjf
exponential-averaging
virtual-gate-test-series
0
votes
1
answer
8
SJF Next burst prediction
Please help me in understanding the followign formulae? Prediction of the Length of the Next CPU Burst Pn+1 = a tn +(1-a)Pn This formula defines an exponential average Pn stores the past history tn contents are most recent information the parameter a ... a = 1 then Pn +1 = tn Prediction is last cpu burst I dont want to learn this.Please provide some logical explanation
Please help me in understanding the followign formulae? Prediction of the Length of the Next CPU Burst Pn+1 = a tn +(1-a)Pn This formula defines an exponential average Pn stores the past history tn contents are most recent information the parameter a controls the relative ... If a = 1 then Pn +1 = tn Prediction is last cpu burst I dont want to learn this.Please provide some logical explanation
asked
Dec 6, 2016
in
Operating System
rahul sharma 5
651
views
sjf
cpu-scheduling
To see more, click for the
full list of questions
or
popular tags
.
...