0
muje pta hota tho ish site par kya karti
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
What is the Limitations of implementing non-preemptive SJF algorithm?
i like moldy chess. cheese....shests
Can starvation occurs in SJF?
yes in the preemptive sjf where every time the system recieve job shorter than the current it stop the current and start the new one
Can you give a C program about SJF algorithm?
no.
Example of preemptive sjf scheduling?
find primitive sjf? with avg waiting time and TAW? P Bust TIme Arivel time p1 5 1 p2 3 0 p3 2 2 p4 4 3 p5 8 2
University solved slips for third year bsc computer science?
The university solved slips for third year Bsc Computer Science are usually issued after the students satisfy the conditions set out by the examination body. The students also have to meet the conditions set out by the senate.
What do you mean by non-preemptive shortest job first scheduling explain with an example?
Non pre-emptive means once CPU starts executing one process, it will not be taken out of the CPU until it is terminated or it has to wait for some event. In preemptive SJF scheduling, current running process is moved to the ready queue when a new process with a shorter CPU burst joins the ready queue.
What is Short job first?
short job first (SJF) is a job scheduling algorithm where shorter jobs are favored for being serviced first. this increases the overall system's number of processed jobs but has the disadvantage that long jobs can face starvation in waiting state irrespective to their wait time..
What is the code for shortest job first?
It is SJF.
What is the difference between pre emptive and non preemptive scheduling?
in pre emptive scheduling. a limited time period is fixed for every process in the CPU. no matter whether the process is completed or not ... the resource assinged to it will be taken back back abd will be given to the next process in the queue.while in non preemptive the resorces are with a process untill it finishes completely others wait for their turn till then. this kind of scheduling has a high probability of going into a deadlock.
What is difference between SJF and SRTF?
Bugger Off
What relation between priority and shortest job first?
Priority scheduling is a CPU scheduling algorithm where each process has a priority associated with it. Shortest job first (SJF) is a scheduling algorithm where the process with the shortest burst time is scheduled first. The relationship between the two is that a priority scheduling algorithm can be used where the priority of a process is determined by its burst time, effectively making it similar to a shortest job first algorithm.
What do you understand by queue Discipline?
IN QUEueing theory,it is like how we serve people in waiting line --- 1.fcfs 2.round robin 3.sjf 4. siro 5.fifo
