Question 1

A risk with _________ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.

Accepted Answer

A)  SRT 
B)  SPN 
C)  FIFO 
D)  FCFS 
A)  SRT 
B)  SPN 
C)  FIFO 
D)  FCFS

Question 2

A disadvantage of simulation is that results for a given run only apply to that particular collection of processes under that particular set of assumptions.

Accepted Answer

A) True 
 B)False

Question 3

The need to know or estimate required processing times for each process, the starvation of longer processes, and the lack of preemption are all difficulties with the __________ scheduling technique.

Accepted Answer

Shortest P

Question 4

The objective of a fair-share scheduler is to monitor usage to give fewer resources to users who have had more than their fair share, and more to those who have had less than their fair share.

Accepted Answer

A) True 
 B)False

Question 5

The decision as to which available process will be executed by the processor:

Accepted Answer

A)  long-term scheduling 
B)  I/O scheduling 
C)  medium-term scheduling 
D)  short-term scheduling 
A)  long-term scheduling 
B)  I/O scheduling 
C)  medium-term scheduling 
D)  short-term scheduling

A risk with _________ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.

A disadvantage of simulation is that results for a given run only apply to that particular collection of processes under that particular set of assumptions.

The need to know or estimate required processing times for each process, the starvation of longer processes, and the lack of preemption are all difficulties with the __________ scheduling technique.

The objective of a fair-share scheduler is to monitor usage to give fewer resources to users who have had more than their fair share, and more to those who have had less than their fair share.

The decision as to which available process will be executed by the processor:

Computer Systems Overview

Operating System Overview

Process Description and Control

Threads

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Deadlock and Starvation

Memory Management

Virtual Memory

Multiprocessor and Real-Time Scheduling

Io Management and Disk Scheduling

File Management

Embedded Operating Systems

Computer Security Threats

Computer Security Techniques

Distributed Processing, Clientserver, and Clusters

Network Protocols

Distributed Process Management

Filters

Exam 9: Uniprocessor Scheduling

A risk with _________ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.

A disadvantage of simulation is that results for a given run only apply to that particular collection of processes under that particular set of assumptions.

The need to know or estimate required processing times for each process, the starvation of longer processes, and the lack of preemption are all difficulties with the __________ scheduling technique.

The objective of a fair-share scheduler is to monitor usage to give fewer resources to users who have had more than their fair share, and more to those who have had less than their fair share.

The decision as to which available process will be executed by the processor:

Computer Systems Overview

Operating System Overview

Process Description and Control

Threads

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Deadlock and Starvation

Memory Management

Virtual Memory

Multiprocessor and Real-Time Scheduling

Io Management and Disk Scheduling

File Management

Embedded Operating Systems

Computer Security Threats

Computer Security Techniques

Distributed Processing, Clientserver, and Clusters

Network Protocols

Distributed Process Management

Filters