CSC 415 Operating System Principles Unit 08
Exam With Complete Solutions
In preemptive scheduling, the sections of code affected by interrupts must be
guarded from simultaneous use.
Select one:
True
False - ANSWER True
Which of the following is true of cooperative scheduling?
Select one:
a. It requires a timer.
b. It incurs a cost associated with access to shared data.
c. A process keeps the CPU until it releases the CPU either by terminating or by
switching to the waiting state.
d. A process switches from the running state to the ready state when an
interrupt occurs. - ANSWER c. A process keeps the CPU until it releases the
CPU either by terminating or by switching to the waiting state.
____ is the number of processes that are completed per time unit.
Select one:
a. Turnaround Time
b. CPU utilization
c. Response Time
d. Throughput - ANSWER d. Throughput
Which of the following is true of multilevel queue scheduling?
Select one:
a. Each queue has its own scheduling algorithm.
b. Processes can move between queues.
c. It is the most general CPU-scheduling algorithm.
d. A queue cannot have absolute priority over lower-priority queues. - ANSWER
a. Each queue has its own scheduling algorithm.
____ scheduling is approximated by predicting the next CPU burst with an
exponential average of the measured lengths of previous CPU bursts.
Select one:
, a. SJF
b. FCFS
c.Multilevel queue
d. RR - ANSWER a. SJF
The ____ scheduling algorithm is designed especially for time-sharing systems.
Select one:
a. RR
b. FCFS
c. Multilevel queue
d. SJF - ANSWER a. RR
____ involves the decision of which kernel thread to schedule onto which CPU.
Select one:
a. Dispatcher
b. Process-contention scope
c. Round-robin scheduling
d. System-contention scope - ANSWER d. System-contention scope
____ allows a thread to run on only one processor.
Select one:
a. Load balancing
b. Processor affinity
c. NUMA
d. Processor Set - ANSWER b. Processor affinity
The two general approaches to load balancing are ____ and ____.
Select one:
a. soft real-time, hard real-time
b. coarse grained, fine grained
c. soft affinity, hard affinity
d. push migration, pull migration - ANSWER d. push migration, pull migration
With ____ a thread executes on a processor until a long-latency event (i.e. a
memory stall) occurs.
Select one:
a. virtualization
b. fine-grained multithreading
c. multicore processors
d. coarse-grained multithreading - ANSWER d. coarse-grained multithreading
Exam With Complete Solutions
In preemptive scheduling, the sections of code affected by interrupts must be
guarded from simultaneous use.
Select one:
True
False - ANSWER True
Which of the following is true of cooperative scheduling?
Select one:
a. It requires a timer.
b. It incurs a cost associated with access to shared data.
c. A process keeps the CPU until it releases the CPU either by terminating or by
switching to the waiting state.
d. A process switches from the running state to the ready state when an
interrupt occurs. - ANSWER c. A process keeps the CPU until it releases the
CPU either by terminating or by switching to the waiting state.
____ is the number of processes that are completed per time unit.
Select one:
a. Turnaround Time
b. CPU utilization
c. Response Time
d. Throughput - ANSWER d. Throughput
Which of the following is true of multilevel queue scheduling?
Select one:
a. Each queue has its own scheduling algorithm.
b. Processes can move between queues.
c. It is the most general CPU-scheduling algorithm.
d. A queue cannot have absolute priority over lower-priority queues. - ANSWER
a. Each queue has its own scheduling algorithm.
____ scheduling is approximated by predicting the next CPU burst with an
exponential average of the measured lengths of previous CPU bursts.
Select one:
, a. SJF
b. FCFS
c.Multilevel queue
d. RR - ANSWER a. SJF
The ____ scheduling algorithm is designed especially for time-sharing systems.
Select one:
a. RR
b. FCFS
c. Multilevel queue
d. SJF - ANSWER a. RR
____ involves the decision of which kernel thread to schedule onto which CPU.
Select one:
a. Dispatcher
b. Process-contention scope
c. Round-robin scheduling
d. System-contention scope - ANSWER d. System-contention scope
____ allows a thread to run on only one processor.
Select one:
a. Load balancing
b. Processor affinity
c. NUMA
d. Processor Set - ANSWER b. Processor affinity
The two general approaches to load balancing are ____ and ____.
Select one:
a. soft real-time, hard real-time
b. coarse grained, fine grained
c. soft affinity, hard affinity
d. push migration, pull migration - ANSWER d. push migration, pull migration
With ____ a thread executes on a processor until a long-latency event (i.e. a
memory stall) occurs.
Select one:
a. virtualization
b. fine-grained multithreading
c. multicore processors
d. coarse-grained multithreading - ANSWER d. coarse-grained multithreading
