Question 1

The transition from one job or process status to another is initiated by either the Job Scheduler or the Process Scheduler.

Accepted Answer

A) True 
 B)False  True

Question 2

CPU-bound jobs (such as printing a series of documents) have many brief CPU cycles and long I/O cycles.

Accepted Answer

A) True 
 B)False  False

Question 3

The processor is also known as the CPU.

Accepted Answer

A) True 
 B)False  True

Question 4

From HOLD, the job moves to WAITING when it's ready to run but is waiting for the CPU.

Accepted Answer

A) True 
 B)False

Question 5

No movement between queues is a very simple policy that rewards those who have ____ jobs.

Accepted Answer

A)  high-priority 
B)  low-priority 
C)  CPU-bound 
D)  I/O-bound 
A)  high-priority 
B)  low-priority 
C)  CPU-bound 
D)  I/O-bound

Question 6

Each job is uniquely identified by the user's identification and a pointer connecting it to its descriptor.

Accepted Answer

A) True 
 B)False

Question 7

Aging is used to ensure that jobs in lower-level queues will eventually complete their execution.

Accepted Answer

A) True 
 B)False

Question 8

An I/O request is called a(n) ____ wait in multiprogramming environments.

Accepted Answer

A)  forced 
B)  natural 
C)  scheduled 
D)  indirect 
A)  forced 
B)  natural 
C)  scheduled 
D)  indirect

Question 9

It is possible to minimize response time by running only interactive jobs and letting the batch jobs wait until the interactive load ceases.

Accepted Answer

A) True 
 B)False

Question 10

Shortest job next (SJN) is a nonpreemptive scheduling algorithm (also known as shortest job first, or SJF) that handles jobs based on the length of their CPU cycle time.

Accepted Answer

A) True 
 B)False

Question 11

Context switching is required by all preemptive algorithms.

Accepted Answer

A) True 
 B)False

Question 12

Queues use ____ to track jobs the same way customs officials use passports to track international visitors.

Accepted Answer

A)  jobs 
B)  processes 
C)  PCBs 
D)  record identifiers 
A)  jobs 
B)  processes 
C)  PCBs 
D)  record identifiers

Question 13

The ____ is also called the high-level scheduler.

Accepted Answer

A)  Process Scheduler 
B)  Job Scheduler 
C)  Program Scheduler 
D)  Thread Scheduler 
A)  Process Scheduler 
B)  Job Scheduler 
C)  Program Scheduler 
D)  Thread Scheduler

Question 14

____ allows for faster turnaround of CPU-bound jobs.

Accepted Answer

A)  No movement between queues 
B)  Movement between queues 
C)  Variable time quantum per queue 
D)  Aging 
A)  No movement between queues 
B)  Movement between queues 
C)  Variable time quantum per queue 
D)  Aging

Question 15

In round robin scheduling, if processing isn't finished when time expires, the job is preempted and put at the end of the READY queue and its information is saved in its PCB.

Accepted Answer

A) True 
 B)False

Question 16

The transition from ____ is initiated by the Process Scheduler or the Job Scheduler.

Accepted Answer

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

Question 17

When using priority scheduling, priorities are assigned to jobs by the owner of the job (the user).

Accepted Answer

A) True 
 B)False

Question 18

When the job is accepted by the system, it's put on ____ and placed in a queue.

Accepted Answer

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

Question 19

As a job moves through the system it is always in one of five states (or at least three); these are called the job status or the process status.

Accepted Answer

A) True 
 B)False

Question 20

The process state contains all of the data about the job needed by the operating system to manage the processing of the job.

Accepted Answer

A) True 
 B)False

The transition from one job or process status to another is initiated by either the Job Scheduler or the Process Scheduler.

CPU-bound jobs (such as printing a series of documents) have many brief CPU cycles and long I/O cycles.

The processor is also known as the CPU.

From HOLD, the job moves to WAITING when it's ready to run but is waiting for the CPU.

No movement between queues is a very simple policy that rewards those who have ____ jobs.

Each job is uniquely identified by the user's identification and a pointer connecting it to its descriptor.

Aging is used to ensure that jobs in lower-level queues will eventually complete their execution.

An I/O request is called a(n) ____ wait in multiprogramming environments.

It is possible to minimize response time by running only interactive jobs and letting the batch jobs wait until the interactive load ceases.

Shortest job next (SJN) is a nonpreemptive scheduling algorithm (also known as shortest job first, or SJF) that handles jobs based on the length of their CPU cycle time.

Context switching is required by all preemptive algorithms.

Queues use ____ to track jobs the same way customs officials use passports to track international visitors.

The ____ is also called the high-level scheduler.

____ allows for faster turnaround of CPU-bound jobs.

In round robin scheduling, if processing isn't finished when time expires, the job is preempted and put at the end of the READY queue and its information is saved in its PCB.

The transition from ____ is initiated by the Process Scheduler or the Job Scheduler.

When using priority scheduling, priorities are assigned to jobs by the owner of the job (the user).

When the job is accepted by the system, it's put on ____ and placed in a queue.

As a job moves through the system it is always in one of five states (or at least three); these are called the job status or the process status.

The process state contains all of the data about the job needed by the operating system to manage the processing of the job.

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

The transition from one job or process status to another is initiated by either the Job Scheduler or the Process Scheduler.

CPU-bound jobs (such as printing a series of documents) have many brief CPU cycles and long I/O cycles.

The processor is also known as the CPU.

From HOLD, the job moves to WAITING when it's ready to run but is waiting for the CPU.

No movement between queues is a very simple policy that rewards those who have ____ jobs.

Each job is uniquely identified by the user's identification and a pointer connecting it to its descriptor.

Aging is used to ensure that jobs in lower-level queues will eventually complete their execution.

An I/O request is called a(n) ____ wait in multiprogramming environments.

It is possible to minimize response time by running only interactive jobs and letting the batch jobs wait until the interactive load ceases.

Shortest job next (SJN) is a nonpreemptive scheduling algorithm (also known as shortest job first, or SJF) that handles jobs based on the length of their CPU cycle time.

Context switching is required by all preemptive algorithms.

Queues use ____ to track jobs the same way customs officials use passports to track international visitors.

The ____ is also called the high-level scheduler.

____ allows for faster turnaround of CPU-bound jobs.

In round robin scheduling, if processing isn't finished when time expires, the job is preempted and put at the end of the READY queue and its information is saved in its PCB.

The transition from ____ is initiated by the Process Scheduler or the Job Scheduler.

When using priority scheduling, priorities are assigned to jobs by the owner of the job (the user).

When the job is accepted by the system, it's put on ____ and placed in a queue.

As a job moves through the system it is always in one of five states (or at least three); these are called the job status or the process status.

The process state contains all of the data about the job needed by the operating system to manage the processing of the job.

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