Q. There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms ?

View solution

Q. Which of the following algorithms tends to minimize the process flow time ?

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 terms of response time

View solution

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