Question 1

Which of the following scheduling algorithms must be nonpreemptive?

Accepted Answer

A)   SJF
B)   RR
C)   FCFS
D)   priority algorithms

Question 2

Explain the process of starvation and how aging can be used to prevent it.

Accepted Answer

Starvation occurs when a process is read...

Question 3

For interactive systems, it is more important to minimize ________.

Accepted Answer

A)   the average response time
B)   the average turnaround time
C)   the variance in response time
D)   the waiting time

Question 4

Providing a preemptive, priority-based scheduler guarantees hard real-time functionality.

Accepted Answer

A) True 
 B)False

Question 5

The ready queue can be implemented as a _______________.

Accepted Answer

A)   FIFO queue
B)   priority queue
C)   tree
D)   unordered linked list
E)   all of the above

Question 6

A significant problem with priority scheduling algorithms is _____.

Accepted Answer

A)   complexity
B)   starvation
C)   determining the length of the next CPU burst
D)   determining the length of the time quantum

Question 7

In Solaris, if an interactive thread with priority 25 is waiting for I/O, what is its priority recalculated to when it is eligible to run again?

Accepted Answer

A)   15
B)   120
C)   52
D)   It remains at 25

Question 8

Which of the following circumstances can cooperative scheduling take place?

Accepted Answer

A)   when a process switches from the running state to the waiting state
B)   when a process switches from the running state to the ready state
C)   when a process switches from the waiting state to the ready state
D)   none of the above

Question 9

Which of the following is preemptive?

Accepted Answer

A)   rate-monotonic scheduling
B)   earliest-deadline-first scheduling
C)   both of the above
D)   none of the above

Question 10

Systems using a one-to-one model (such as Windows, Solaris , and Linux) schedule threads using process-contention scope (PCS).

Accepted Answer

A) True 
 B)False

Question 11

The default scheduling class for a process in Solaris is ____.

Accepted Answer

A)   time sharing
B)   system
C)   interactive
D)   real-time

Question 12

In Pthread real-time scheduling, the SCHED_FIFO class provides time slicing among threads of equal priority.

Accepted Answer

A) True 
 B)False

Question 13

Which of the following processes usually have highest priority?

Accepted Answer

A)   real-time processes
B)   system processes
C)   interactive processes
D)   batch processes

Question 14

A multicore system allows two (or more) threads that are in compute cycles to execute at the same time.

Accepted Answer

A) True 
 B)False

Question 15

Load balancing algorithms have no impact on the benefits of processor affinity.

Accepted Answer

A) True 
 B)False

Question 16

The Completely Fair Scheduler (CFS) is the default scheduler for Linux systems.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following scheduling algorithm may suffer from convoy effect?

Accepted Answer

A)   SJF
B)   FCFS
C)   RR
D)   Multilevel queue

Question 18

In Windows, how does the dispatcher determine the order of thread execution?

Accepted Answer

The dispatcher uses a 32-level priority ...

Question 19

SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.

Accepted Answer

A) True 
 B)False

Question 20

The length of a time quantum assigned by the Linux CFS scheduler is dependent upon the relative priority of a task.

Accepted Answer

A) True 
 B)False

Exam 5: Cpu Scheduling

SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.

Correct AnswerverifiedShow Answer

The ready queue can be implemented as a _______________.

Correct AnswerverifiedShow Answer

For interactive systems, it is more important to minimize ________.

Correct AnswerverifiedShow Answer

The default scheduling class for a process in Solaris is ____.

Correct AnswerverifiedShow Answer

In Solaris, if an interactive thread with priority 25 is waiting for I/O, what is its priority recalculated to when it is eligible to run again?

Correct AnswerverifiedShow Answer

In Pthread real-time scheduling, the SCHED_FIFO class provides time slicing among threads of equal priority.

Correct AnswerverifiedShow Answer

Which of the following circumstances can cooperative scheduling take place?

Correct AnswerverifiedShow Answer

In Windows, how does the dispatcher determine the order of thread execution?

Correct AnswerverifiedThe dispatcher uses a 32-level priority ...View AnswerShow Answer

Systems using a one-to-one model (such as Windows, Solaris , and Linux) schedule threads using process-contention scope (PCS).

Correct AnswerverifiedShow Answer

Load balancing algorithms have no impact on the benefits of processor affinity.

Correct AnswerverifiedShow Answer

Which of the following processes usually have highest priority?

Correct AnswerverifiedShow Answer

Which of the following is preemptive?

Correct AnswerverifiedShow Answer

Which of the following scheduling algorithms must be nonpreemptive?

Correct AnswerverifiedShow Answer

Which of the following scheduling algorithm may suffer from convoy effect?

Correct AnswerverifiedShow Answer

A significant problem with priority scheduling algorithms is _____.

Correct AnswerverifiedShow Answer

The Completely Fair Scheduler (CFS) is the default scheduler for Linux systems.

Correct AnswerverifiedShow Answer

The length of a time quantum assigned by the Linux CFS scheduler is dependent upon the relative priority of a task.

Correct AnswerverifiedShow Answer

A multicore system allows two (or more) threads that are in compute cycles to execute at the same time.

Correct AnswerverifiedShow Answer

Providing a preemptive, priority-based scheduler guarantees hard real-time functionality.

Correct AnswerverifiedShow Answer

Explain the process of starvation and how aging can be used to prevent it.

Correct AnswerverifiedStarvation occurs when a process is read...View AnswerShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
The dispatcher uses a 32-level priority ...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
Starvation occurs when a process is read...
View Answer