Q. The most optimal scheduling algorithm is :

View solution

Q. The real difficulty with SJF in short term scheduling is :

View solution

Q. The FCFS algorithm is particularly troublesome for ____________.

View solution

Q. Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3

i) Assuming the above process being scheduled with the SJF scheduling algorithm :

View solution

Q. Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm :

View solution

Q. Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm:

View solution

Q. Consider the following set of processes, the length of the CPU burst time given in milliseconds :
Process Burst time
P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm :

View solution

Q. Preemptive Shortest Job First scheduling is sometimes called :

View solution

Q. An SJF algorithm is simply a priority algorithm where the priority is :

View solution

Q. One of the disadvantages of the priority scheduling algorithm is that :

View solution

Q. ‘Aging’ is :

View solution

Q. A solution to the problem of indefinite blockage of low – priority processes is :

View solution

Q. Which of the following statements are true ?
i) Shortest remaining time first scheduling may cause starvation
ii) Preemptive scheduling may cause starvation
iii) Round robin is better than FCFS in terns of response time

View solution

Q. Which of the following scheduling algorithms gives minimum average waiting time ?

View solution

Q. Match the following:
List – I - - - - - - - - - - - - - - - - - - - - - - - - - List – II
a. Multilevel feedback queue - - - - - - - - - i. Time-slicing
b. FCFS - - - - - - - - - - - - - - - - - - - - - - - -ii. Criteria to move processes between queues
c. Shortest process next - - - - - - - - - - - -iii. Batch processing
d. Round robin scheduling - - - - - - - - - - -iv. Exponential smoothing

View solution

Q. How you will describe Throughput in operating system?

View solution

Q. Which of the following scheduling policy is well suited for a time shared operating system?

View solution

Q. What is the most suitable scheduling policy for a time - shared operating systems?

View solution

Q. Consider a uniprocessor computer system that has 2 processes and both of them alternate 10ms CPU bursts with 90ms I / O bursts. Both the processes were created at nearly the same time and can proceed in parallel. What is the scheduling strategy for this system that will result in the least CPU utilization (over a long period of time) ?

View solution

Q. We have an operating system, which is capable of loading and executing a single sequential user process at a time. If the disk head scheduling algorithm which is initially First Come First Served (FCFS) is replaced by Shortest Seek Time First (SSTF) claimed by the vendor to give 50% better benchmark results then what is the expected improvement in the I / O performance of the user programs?

View solution