Question 1

Context switching is required by all preemptive algorithms.

Accepted Answer

A) True 
 B)False

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

Question 3

The ____ is also called a 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 4

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

Accepted Answer

A)  5.5 
B)  6.8 
C)  9.0 
D)  11.1 
A)  5.5 
B)  6.8 
C)  9.0 
D)  11.1

Question 5

A program is an active entity that requires a set of resources,including a processor and special registers,to perform its function.

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

A processor is also known as a CPU.

Accepted Answer

A) True 
 B)False

Question 9

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 10

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 11

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

Question 12

The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the ____ queue by the Job Scheduler.

Accepted Answer

A)  WAITING 
B)  NEXT 
C)  PROCESS 
D)  READY 
A)  WAITING 
B)  NEXT 
C)  PROCESS 
D)  READY

Question 13

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 Process Control Block.

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

Web browsers use multithreading routinely.For example,one thread can retrieve images while another sends and retrieves e-mail.

Accepted Answer

A) True 
 B)False

Question 16

____ 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 17

A single processor can be shared by several jobs,or several processes,but only if the operating system has a scheduling policy,as well as a scheduling algorithm,to determine when to stop working on one job and proceed to another.

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

When the operating system detects a nonrecoverable error,the following step is performed first by the interrupt handler: ____.

Accepted Answer

A)  the state of the interrupted process is saved 
B)  the type of interrupt is described and stored 
C)  the interrupt is processed 
D)  the processor resumes operation 
A)  the state of the interrupted process is saved 
B)  the type of interrupt is described and stored 
C)  the interrupt is processed 
D)  the processor resumes operation

Context switching is required by all preemptive algorithms.

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

The ____ is also called a high-level scheduler.

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

A program is an active entity that requires a set of resources,including a processor and special registers,to perform its function.

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

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

A processor is also known as a CPU.

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.

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

The Job Scheduler seeks to ____ when scheduling jobs.

The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the ____ queue by the Job Scheduler.

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 Process Control Block.

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

Web browsers use multithreading routinely.For example,one thread can retrieve images while another sends and retrieves e-mail.

____ allows for faster turnaround of CPU-bound jobs.

A single processor can be shared by several jobs,or several processes,but only if the operating system has a scheduling policy,as well as a scheduling algorithm,to determine when to stop working on one job and proceed to another.

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

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

When the operating system detects a nonrecoverable error,the following step is performed first by the interrupt handler: ____.

Introducing Operating Systems

Early Memory Management Systems

Memory Management Includes Virtual Memory

Process Synchronization

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating Systems

Windows Operating Systems

Linux Operating Systems

Android Operating Systems

Filters

Exam 4: Processor Management

Context switching is required by all preemptive algorithms.

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

The ____ is also called a high-level scheduler.

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

A program is an active entity that requires a set of resources,including a processor and special registers,to perform its function.

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

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

A processor is also known as a CPU.

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.

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

The Job Scheduler seeks to ____ when scheduling jobs.

The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the ____ queue by the Job Scheduler.

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 Process Control Block.

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

Web browsers use multithreading routinely.For example,one thread can retrieve images while another sends and retrieves e-mail.

____ allows for faster turnaround of CPU-bound jobs.

A single processor can be shared by several jobs,or several processes,but only if the operating system has a scheduling policy,as well as a scheduling algorithm,to determine when to stop working on one job and proceed to another.

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

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

When the operating system detects a nonrecoverable error,the following step is performed first by the interrupt handler: ____.

Introducing Operating Systems

Early Memory Management Systems

Memory Management Includes Virtual Memory

Process Synchronization

Concurrent Processes

Device Management

File Management

Network Organization Concepts

Management of Network Functions

Security and Ethics

System Management

Unix Operating Systems

Windows Operating Systems

Linux Operating Systems

Android Operating Systems

Filters