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.

121. Throughput of a system is
a. Number of programs processed by it per unit time
b. Number of times the program is invoked by the system
c. Number of requests made to a program by the system
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Number of programs processed by it per unit time

122. Round robin scheduling is essentially the preemptive version of ...........
a. first in first out
b. shortest job first
c. shortest remaining
d. longest time first
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).first in first out

123. The process that are residing in the main memory and are waiting to execute are kept on a list called the ............
a. job queue
b. ready queue
c. wait queue
d. device queue
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).ready queue

124. Special software to create a job queue is called a
a. Drive
b. Spooler
c. Interpreter
d. Linkage editor
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Spooler

125. The strategy of allowing processes that are logically runnable to be temporarily suspended is called
a. preemptive scheduling
b. non preemptive scheduling
c. shortest job first
d. first come first served
View Answer Report Discuss Too Difficult!
Answer: (a).preemptive scheduling

126. The FIFO algorithm
a. executes first the job that last entered the queue
b. executes first the job that first entered the queue
c. execute first the job that has been in the queue the longest
d. executes first the job with the least processor needs
View Answer Report Discuss Too Difficult!
Answer: (b).executes first the job that first entered the queue

127. The CPU, after receiving an interrupt from an I/O device
a. halts for a predetermined time
b. hands over control of address bus and data bus to the interrupting device
c. branches off to the interrupt service routine immediately
d. branches off to the interrupt service routine after completion of the current instruction
View Answer Report Discuss Too Difficult!
Answer: (d).branches off to the interrupt service routine after completion of the current instruction

128. Seeks analysis
a. is used for analyzing paging problems
b. is used for analyzing device busy problems
c. is used for analyzing control-unit busy problems
d. is only shown on real-time displays
View Answer Report Discuss Too Difficult!
Answer: (b).is used for analyzing device busy problems

129. The dispatcher
a. actually schedules the tasks into the processor
b. puts tasks in I/O wait
c. is always small and simple
d. never changes task priorities
View Answer Report Discuss Too Difficult!
Answer: (a).actually schedules the tasks into the processor

130. The SJF algorithm executes first the job
a. that last entered the queue
b. that first entered the queue
c. that has been in the queue the longest
d. with the least processor needs
View Answer Report Discuss Too Difficult!
Answer: (d).with the least processor needs

Page 13 of 14