Computer Science Test Template
ADVERTISEMENT
1
2
3
41. Which of the following is true of cooperative scheduling?
A)
It requires a timer.
B)
A process keeps the CPU until it releases the CPU either by terminating or by
switching to the waiting state.
C)
It incurs a cost associated with access to shared data.
D)
A process switches from the running state to the ready state when an interrupt
occurs.
Ans: B
2. ____ is the number of processes that are completed per time unit.
A) CPU utilization
B) Response time
C) Turnaround time
D)
Throughput
Ans: D
3. ____ scheduling is approximated by predicting the next CPU burst with an exponential
average of the measured lengths of previous CPU bursts.
A) Multilevel queue
B) RR
C) FCFS
D) SJF
Ans: D
4. The ____ scheduling algorithm is designed especially for time-sharing systems.
A) SJF
B) FCFS
C) RR
D) Multilevel queue
Ans: C
5. Which of the following scheduling algorithms must be nonpreemptive?
A) SJF
B) RR
C) FCFS
D) priority algorithms
Ans: C
6. Which of the following is true of multilevel queue scheduling?
A)
Processes can move between queues.
B)
Each queue has its own scheduling algorithm.
C)
A queue cannot have absolute priority over lower-priority queues.
D)
It is the most general CPU-scheduling algorithm.
Ans: B
7. The idea behind ____ is to create multiple logical processors on the same physical
processor, presenting a view of several logical processors to the operating system.
A) SMT
B) SMP
C) PCB
D) PCP
Ans: A
8. The default scheduling class for a process in Solaris is ____.
A) time sharing
B) system
C) interactive
D) real time
Ans: A
Page 1
ADVERTISEMENT
0 votes
Related Articles
Related forms
Related Categories
Parent category: Education