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

Q. We have a uniprocessor machine where a set of n tasks with known run times r1, r2, r3,….rn are to be run. What will be the maximum throughput result of the processor scheduling algorithm?

View solution

Q. Three CPU intensive processes requires 10, 20 and 30 time units and arrive at times 0, 2 and 6 respectively. The operating system implements a shortest remaining time first scheduling algorithm. Considering that the context switches at time zero and at the end are not counted the number of context switches are needed is ______.

View solution

Q. What is the non - preemptive scheduling algorithm?

View solution

Q. Which of the following statements are true?

View solution

Q. On a single processor four jobs are to be executed. At time t = (0) + (jobs arrive in the order of A, B, C, D). The burst CPU time requirements are 4, 1, 8, 1 time units respectively.
Under Round Robin Scheduling with the time slice of 1 time unit the completion time of A is ______.

View solution

Q. Interval between the time of submission and completion of the job is called

View solution

Q. A scheduler which selects processes from secondary storage device is called

View solution

Q. The scheduling in which CPU is allocated to the process with least CPU-burst time is called

View solution

Q. The “turn-around” time of a user job is the

View solution

Q. Program ‘preemption’ is

View solution