Question 1

First-come, first-served (FCFS) is a preemptive scheduling algorithm that handles jobs according to their arrival time.

Accepted Answer

A) True 
 B)False

Question 2

Some systems increase the priority of jobs that have been in the system for an unusually long time to expedite their exit, which is known as ____.

Accepted Answer

A)  lagging 
B)  aging 
C)  bumping 
D)  accelerated priority 
A)  lagging 
B)  aging 
C)  bumping 
D)  accelerated priority

Question 3

Assume that jobs A-D arrive in the ready queue in quick succession and have the CPU cycle requirements listed below. Using the SRT algorithm, the average turnaround time is ____. Arrival time: 0 1 2 3
Job: A B C D
CPU cycle: 6 3 1 4

Accepted Answer

A)  2.5 
B)  6.25 
C)  7.75 
D)  9.0 
A)  2.5 
B)  6.25 
C)  7.75 
D)  9.0

Question 4

The transition from ____ is initiated by the Job Scheduler according to some predefined policy.

Accepted Answer

A)  READY to RUNNING 
B)  RUNNING to WAITING 
C)  RUNNING back to READY 
D)  HOLD to READY 
A)  READY to RUNNING 
B)  RUNNING to WAITING 
C)  RUNNING back to READY 
D)  HOLD to READY

Question 5

The Processor Manager is a composite of two submanagers: one in charge of job scheduling and the other in charge of program scheduling.

Accepted Answer

A) True 
 B)False

Question 6

The control program that handles the interruption sequence of events is called the interrupt scheduler.

Accepted Answer

A) True 
 B)False

Question 7

In a highly interactive environment there is a third layer of the Processor Manager called the ____ scheduler.

Accepted Answer

A)  Managing 
B)  Subprocess 
C)  middle-level 
D)  Program 
A)  Managing 
B)  Subprocess 
C)  middle-level 
D)  Program

Question 8

____ contains information used mainly for billing purposes and performance measurement.

Accepted Answer

A)  Accounting 
B)  Process State 
C)  Process Identification 
D)  Process Status 
A)  Accounting 
B)  Process State 
C)  Process Identification 
D)  Process Status

Question 9

First-come, first-served (FCFS) is a very simple algorithm to implement because it ____.

Accepted Answer

A)  uses a FIFO queue 
B)  uses a LIFO queue 
C)  uses a circular queue 
D)  uses a directed graph 
A)  uses a FIFO queue 
B)  uses a LIFO queue 
C)  uses a circular queue 
D)  uses a directed graph

Question 10

Assume that four jobs A-D require the CPU cycles listed below. Using the SJN algorithm, the ____ job is run first. Job: A B C D
CPU cycle: 5 2 6 4

Accepted Answer

A)  A 
B)  B 
C)  C 
D)  D 
A)  A 
B)  B 
C)  C 
D)  D

Question 11

Multiple-level queues isn't really a separate scheduling algorithm but works in conjunction with several other schemes.

Accepted Answer

A) True 
 B)False

Question 12

The shortest remaining time (SRT) algorithm is often used in interactive systems.

Accepted Answer

A) True 
 B)False

Question 13

____ jobs are treated like all the others once they are in the system.

Accepted Answer

A)  Low-priority 
B)  High-priority 
C)  Variable-priority 
D)  Moving-priority 
A)  Low-priority 
B)  High-priority 
C)  Variable-priority 
D)  Moving-priority

Question 14

After a job has been placed on the READY queue by the Job Scheduler, the Process Scheduler takes over.

Accepted Answer

A) True 
 B)False

Question 15

____ holds pertinent information, including the address where the job is stored and, in the case of virtual memory, the mapping between virtual and physical memory locations.

Accepted Answer

A)  Main memory 
B)  Register content 
C)  Process priority 
D)  The process state 
A)  Main memory 
B)  Register content 
C)  Process priority 
D)  The process state

Question 16

Most computer programs alternate between CPU cycles and I/O cycles.

Accepted Answer

A) True 
 B)False

Question 17

A process is an inactive unit, such as a file stored on a disk.

Accepted Answer

A) True 
 B)False

Question 18

When selecting the proper time quantum it should be long enough to allow ____ percent of the CPU cycles to run to completion.

Accepted Answer

A)  20 
B)  60 
C)  80 
D)  100 
A)  20 
B)  60 
C)  80 
D)  100

Question 19

The Process Scheduler often uses a timing mechanism and periodically interrupts running processes when a predetermined slice of time has expired.

Accepted Answer

A) True 
 B)False

Question 20

The Job Scheduler seeks to ___ , when scheduling jobs.

Accepted Answer

A)  Run all CPU intensive jobs first. 
B)  Run all I/O intensive jobs first. 
C)  Balance CPU and I/O intensive jobs. 
D)  Run the quickest jobs first. 
A)  Run all CPU intensive jobs first. 
B)  Run all I/O intensive jobs first. 
C)  Balance CPU and I/O intensive jobs. 
D)  Run the quickest jobs first.

First-come, first-served (FCFS) is a preemptive scheduling algorithm that handles jobs according to their arrival time.

Some systems increase the priority of jobs that have been in the system for an unusually long time to expedite their exit, which is known as ____.

Assume that jobs A-D arrive in the ready queue in quick succession and have the CPU cycle requirements listed below. Using the SRT algorithm, the average turnaround time is ____. Arrival time: 0 1 2 3 Job: A B C D CPU cycle: 6 3 1 4

The transition from ____ is initiated by the Job Scheduler according to some predefined policy.

The Processor Manager is a composite of two submanagers: one in charge of job scheduling and the other in charge of program scheduling.

The control program that handles the interruption sequence of events is called the interrupt scheduler.

In a highly interactive environment there is a third layer of the Processor Manager called the ____ scheduler.

____ contains information used mainly for billing purposes and performance measurement.

First-come, first-served (FCFS) is a very simple algorithm to implement because it ____.

Assume that four jobs A-D require the CPU cycles listed below. Using the SJN algorithm, the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4

Multiple-level queues isn't really a separate scheduling algorithm but works in conjunction with several other schemes.

The shortest remaining time (SRT) algorithm is often used in interactive systems.

____ jobs are treated like all the others once they are in the system.

After a job has been placed on the READY queue by the Job Scheduler, the Process Scheduler takes over.

____ holds pertinent information, including the address where the job is stored and, in the case of virtual memory, the mapping between virtual and physical memory locations.

Most computer programs alternate between CPU cycles and I/O cycles.

A process is an inactive unit, such as a file stored on a disk.

When selecting the proper time quantum it should be long enough to allow ____ percent of the CPU cycles to run to completion.

The Process Scheduler often uses a timing mechanism and periodically interrupts running processes when a predetermined slice of time has expired.

The Job Scheduler seeks to ___ , when scheduling jobs.

Introducing Operating Systems

Memory Management: Early Systems

Memory Management: Virtual Memory

Process Management

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating System

Ms-Dos Operating System

Windows Operating Systems

Linux Operating System

Filters

Exam 4: Processor Management

First-come, first-served (FCFS) is a preemptive scheduling algorithm that handles jobs according to their arrival time.

Some systems increase the priority of jobs that have been in the system for an unusually long time to expedite their exit, which is known as ____.

Assume that jobs A-D arrive in the ready queue in quick succession and have the CPU cycle requirements listed below. Using the SRT algorithm, the average turnaround time is ____. Arrival time: 0 1 2 3 Job: A B C D CPU cycle: 6 3 1 4

The transition from ____ is initiated by the Job Scheduler according to some predefined policy.

The Processor Manager is a composite of two submanagers: one in charge of job scheduling and the other in charge of program scheduling.

The control program that handles the interruption sequence of events is called the interrupt scheduler.

In a highly interactive environment there is a third layer of the Processor Manager called the ____ scheduler.

____ contains information used mainly for billing purposes and performance measurement.

First-come, first-served (FCFS) is a very simple algorithm to implement because it ____.

Assume that four jobs A-D require the CPU cycles listed below. Using the SJN algorithm, the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4

Multiple-level queues isn't really a separate scheduling algorithm but works in conjunction with several other schemes.

The shortest remaining time (SRT) algorithm is often used in interactive systems.

____ jobs are treated like all the others once they are in the system.

After a job has been placed on the READY queue by the Job Scheduler, the Process Scheduler takes over.

____ holds pertinent information, including the address where the job is stored and, in the case of virtual memory, the mapping between virtual and physical memory locations.

Most computer programs alternate between CPU cycles and I/O cycles.

A process is an inactive unit, such as a file stored on a disk.

When selecting the proper time quantum it should be long enough to allow ____ percent of the CPU cycles to run to completion.

The Process Scheduler often uses a timing mechanism and periodically interrupts running processes when a predetermined slice of time has expired.

The Job Scheduler seeks to ___ , when scheduling jobs.

Introducing Operating Systems

Memory Management: Early Systems

Memory Management: Virtual Memory

Process Management

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating System

Ms-Dos Operating System

Windows Operating Systems

Linux Operating System

Filters