A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

91. ‘Aging’ is :
a. keeping track of cache contents
b. keeping track of what pages are currently residing in memory
c. keeping track of how many times a given page is referenced
d. increasing the priority of jobs to ensure termination in a finite time
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).increasing the priority of jobs to ensure termination in a finite time

92. A solution to the problem of indefinite blockage of low – priority processes is :
a. Starvation
b. Wait queue
c. Ready queue
d. Aging
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Aging

93. 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
a. i only
b. i and iii only
c. ii and iii only
d. i, ii and iii
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).i, ii and iii

94. Which of the following scheduling algorithms gives minimum average waiting time ?
a. FCFS
b. SJF
c. Round – robin
d. Priority
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).SJF

95. 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
a. a-i, b-iii, c-ii, d-iv
b. a-iv, b-iii, c-ii, d-i
c. a-iii, b-i, c-iv, d-i
d. a-ii, b-iii, c-iv, d-i
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).a-ii, b-iii, c-iv, d-i

96. How you will describe Throughput in operating system?
a. Number of times a program produces output.
b. Number of times the program is running.
c. Number of programs processed by it per unit time
d. None of the above.
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Number of programs processed by it per unit time

97. Which of the following scheduling policy is well suited for a time shared operating system?
a. First come first serve.
b. Shortest job first
c. Round robin
d. None of the above.
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Round robin

98. What is the most suitable scheduling policy for a time - shared operating systems?
a. Shortest Job First
b. Elevator
c. First Come First Served
d. Round Robin
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Round Robin

99. 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) ?
a. Round Robin scheduling with a time quantum of 5ms
b. First Come First Served scheduling
c. Shortest remaining time first
d. Static priority scheduling with different priorities for the two processes
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Round Robin scheduling with a time quantum of 5ms

100. 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?
a. 0%
b. 25%
c. 50%
d. 75%
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).0%