Question 1

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 2

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 
A)  complexity 
B)  starvation 
C)  determining the length of the next CPU burst 
D)  determining the length of the time quantum

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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 
A)  the average response time 
B)  the average turnaround time 
C)  the variance in response time 
D)  the waiting time

Question 5

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 
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 6

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

Question 7

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

Accepted Answer

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

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

Which of the following processes usually have highest priority?

Accepted Answer

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

Question 10

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 
A)  rate-monotonic scheduling 
B)  earliest-deadline-first scheduling 
C)  both of the above 
D)  none of the above

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

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 
A)  15 
B)  120 
C)  52 
D)  It remains at 25

Question 13

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 14

Which of the following scheduling algorithms must be nonpreemptive?

Accepted Answer

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

Question 15

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

Accepted Answer

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

Question 16

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

Accepted Answer

The dispatcher uses a 32-level priority

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

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 
A)  FIFO queue 
B)  priority queue 
C)  tree 
D)  unordered linked list 
E)  all of the above

Question 19

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

Accepted Answer

Starvation occurs when a process is read

Question 20

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

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

A significant problem with priority scheduling algorithms is _____.

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

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

Which of the following circumstances can cooperative scheduling take place?

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

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

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

Which of the following processes usually have highest priority?

Which of the following is preemptive?

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

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?

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

Which of the following scheduling algorithms must be nonpreemptive?

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

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

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

The ready queue can be implemented as a _______________.

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

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

Introduction

Operating-System Structures

Processes

Threads Concurrency

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 5: Cpu Scheduling

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

A significant problem with priority scheduling algorithms is _____.

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

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

Which of the following circumstances can cooperative scheduling take place?

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

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

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

Which of the following processes usually have highest priority?

Which of the following is preemptive?

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

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?

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

Which of the following scheduling algorithms must be nonpreemptive?

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

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

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

The ready queue can be implemented as a _______________.

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

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

Introduction

Operating-System Structures

Processes

Threads Concurrency

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters