Multiple Choice Questions and Answers
Question 1 : An O.S. program module that selects the next job to be admitted for execution is called as
(a) Scheduler
(b) Compiler
(c) Throughput
(d) None of the above
Answer : (a)
Question 2 : A short-term scheduler executes at least once every
(a) 1 ms
(b) 5 ms
(c) 10 ms
(d) None of the above
Answer : (c)
Question 3 : A program responsible for assigning the CPU to the process that has been selected by the short-term scheduler is known as a
(a) Scheduler
(b) Dispatcher
(c) Debugger
(d) None of the above
Answer : (b)
Question 4 : If dispatch latency increases then the degree of multiprogramming
(a) increases
(b) decreases
(c) Remains constant
(d) None of the above
Answer : (b)
Question 5 : The average amount of work completed per unit time is called
(a) CPU utilization
(b) Bandwidth
(c) Turn around time
(d) Throughput
Answer : (d)
Question 6 : The preemption of processes takes place after a fixed interval of time called
(a) Time slice
(b) Time Quantum
(c) Response time
(d) None of the above
Answer : (b)
Question 7 : The indefinite blocking of low priority processes by a high priority process is known as
(a) Starvation
(b) Deadlock
(c) Aging
(d) None of the above
Answer : (a)
Question 8 : The technique of gradually increasing the priority of processes that wait in the system for a long time is called
(a) Aging
(b) Throughout
(c) FCFS
(d) None of the above
Answer : (a)
Question 9 : RMA works on static priorities while EDF algorithm works on
(a) Starvation
(b) Dynamic priorities
(c) RR scheduling
(d) None of the above
Answer : (c)
Question 10 : Round-Robin (RR) scheduling is most suitable for
(a) Time-shared O.S.
(b) Distributed O.S.
(c) Real-time O.S.
(d) None of the above
Answer : (a)
Question 11 : Context switching is
(a) Part of spooling
(b) Part of polling
(c) Part of interrupt handling
(d) None of the above
Answer : (c)
Question 12 : FIFO scheduling is
(a) Preemptive
(b) Non-preemptive
(c) Deadline scheduling
(d) None of the above
Answer : (b)
Question 13 : In RR Scheduling, a ready queue is treated as a
(a) Circular queue
(b) Doubly linked list
(c) Stack
(d) None of the above
Answer : (a)
Question 14 : A scheduling wherein the jobs are allowed to move between the queues
(a) Multilevel queue scheduling
(b) RR Scheduling
(c) Multilevel feedback scheduling
(d) None of the above
Answer : (c)
Question 15 : RR Scheduling is a preemptive version of
(a) FIFO
(b) SJF
(c) MLQ
(d) None of the above
Answer : (a)