Q. With round robin scheduling algorithm in a time shared system,

View solution

Q. The portion of the process scheduler in an operating system that dispatches processes is concerned with :

View solution

Q. Complex scheduling algorithms :

View solution

Q. The FIFO algorithm :

View solution

Q. The strategy of making processes that are logically runnable to be temporarily suspended is called :

View solution

Q. CPU Scheduling is :

View solution

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