Question 1

Name the five process states.

Accepted Answer

New state, ready state, running state, waiting state, and terminated state

Question 2

Which of the following is a CPU scheduling metric used to evaluate scheduling algorithms?

Accepted Answer

A)  Shortest-job-next 
B)  First-come, first-served 
C)  Time slice 
D)  Round robin 
E)  Turnaround time 
A)  Shortest-job-next 
B)  First-come, first-served 
C)  Time slice 
D)  Round robin 
E)  Turnaround time E

Question 3

What is a physical address?

Accepted Answer

The actual address of a stored value in main memory.

Question 4

A program may often make references to a variable's physical address in memory.

Accepted Answer

A) True 
 B)False

Question 5

The operating system is itself just a program that takes its turn being executed by the CPU.

Accepted Answer

A) True 
 B)False

Question 6

Which of the following keeps track of where in memory a process is stored?

Accepted Answer

A)  Process management 
B)  Memory management 
C)  Multiprogramming 
D)  Timesharing 
E)  CPU scheduling 
A)  Process management 
B)  Memory management 
C)  Multiprogramming 
D)  Timesharing 
E)  CPU scheduling

Question 7

To which state does the currently executing process return when it is interrupted by the operating system?

Accepted Answer

A)  Ready 
B)  New 
C)  Waiting 
D)  Terminated 
E)  Running 
A)  Ready 
B)  New 
C)  Waiting 
D)  Terminated 
E)  Running

Question 8

Which of the following describes a reference made by a program relative to itself?

Accepted Answer

A)  Single contiguous 
B)  Logical address 
C)  Physical address 
D)  Partition 
E)  Paged 
A)  Single contiguous 
B)  Logical address 
C)  Physical address 
D)  Partition 
E)  Paged

Question 9

In _______________ CPU scheduling, processes are moved to the CPU in the order in which they arrive.

Accepted Answer

The answer of In _______________ CPU scheduling, processes are moved...

Question 10

Which of the following is a technique for keeping more than one process in memory at the same time?

Accepted Answer

A)  Process management 
B)  Memory management 
C)  Multiprogramming 
D)  Timesharing 
E)  CPU scheduling 
A)  Process management 
B)  Memory management 
C)  Multiprogramming 
D)  Timesharing 
E)  CPU scheduling

Question 11

Which of the following is the amount of time given to each process in a round-robin CPU scheduling algorithm?

Accepted Answer

A)  Arrival time 
B)  Time limit 
C)  Time slice 
D)  Service time value 
E)  Turnaround time 
A)  Arrival time 
B)  Time limit 
C)  Time slice 
D)  Service time value 
E)  Turnaround time

Question 12

The shortest-job-next CPU scheduling algorithm is provably optimal, but requires knowledge of the future.

Accepted Answer

A) True 
 B)False

Question 13

Physical addresses must be converted to logical addresses in order to carry out the reference being made.

Accepted Answer

A) True 
 B)False

Question 14

The _______________ is the core of a computer's system software.

Accepted Answer

The answer of The _______________ is the core of a...

Question 15

Which of the following is a CPU scheduling algorithm that allocates processes to the CPU in the order in which they arrive?

Accepted Answer

A)  Shortest-job-next 
B)  First-come, first-served 
C)  Time slice 
D)  Round robin 
E)  Turnaround time 
A)  Shortest-job-next 
B)  First-come, first-served 
C)  Time slice 
D)  Round robin 
E)  Turnaround time

Question 16

A(n) _______________ address is used by a program to reference a generic memory location.

Accepted Answer

The answer of A(n) _______________ address is used by a...

Question 17

Which of the following best describes a partitioning approach in which all partitions are the same size?

Accepted Answer

A)  Dynamic partitions 
B)  Fixed partitions 
C)  Both dynamic and fixed partitions 
D)  Neither dynamic nor fixed partitions 
A)  Dynamic partitions 
B)  Fixed partitions 
C)  Both dynamic and fixed partitions 
D)  Neither dynamic nor fixed partitions

Question 18

In single contiguous memory management, an entire application program is loaded into one chunk of memory.

Accepted Answer

A) True 
 B)False

Question 19

In partitioned memory management, an application program is separated into pieces and loaded into multiple partitions.

Accepted Answer

A) True 
 B)False

Question 20

A process in the _______________ state has no barriers to its execution and is merely waiting for its turn to use the CPU.

Accepted Answer

The answer of A process in the _______________ state has...

Name the five process states.

Which of the following is a CPU scheduling metric used to evaluate scheduling algorithms?

What is a physical address?

A program may often make references to a variable's physical address in memory.

The operating system is itself just a program that takes its turn being executed by the CPU.

Which of the following keeps track of where in memory a process is stored?

To which state does the currently executing process return when it is interrupted by the operating system?

Which of the following describes a reference made by a program relative to itself?

In _______________ CPU scheduling, processes are moved to the CPU in the order in which they arrive.

Which of the following is a technique for keeping more than one process in memory at the same time?

Which of the following is the amount of time given to each process in a round-robin CPU scheduling algorithm?

The shortest-job-next CPU scheduling algorithm is provably optimal, but requires knowledge of the future.

Physical addresses must be converted to logical addresses in order to carry out the reference being made.

The _______________ is the core of a computer's system software.

Which of the following is a CPU scheduling algorithm that allocates processes to the CPU in the order in which they arrive?

A(n) _______________ address is used by a program to reference a generic memory location.

Which of the following best describes a partitioning approach in which all partitions are the same size?

In single contiguous memory management, an entire application program is loaded into one chunk of memory.

In partitioned memory management, an application program is separated into pieces and loaded into multiple partitions.

A process in the _______________ state has no barriers to its execution and is merely waiting for its turn to use the CPU.

The Big Picture

Binary Values and Number Systems

Data Representation

Gates and Circuits

Computing Components

Low-Level Programming Languages and Pseudocode

Problem Solving and Algorithms

Abstract Data Types and Subprograms

Object-Oriented Design and High-Level Programming Languages

File Systems and Directories

Information Systems

Artificial Intelligence

Simulation, Graphics, Gaming, and Other Applications

Networks

The World Wide Web

Computer Security

Limitations of Computing

broad concept of computer security and its importance in modern society.

Filters

Exam 10: Operating Systems

Name the five process states.

Which of the following is a CPU scheduling metric used to evaluate scheduling algorithms?

What is a physical address?

A program may often make references to a variable's physical address in memory.

The operating system is itself just a program that takes its turn being executed by the CPU.

Which of the following keeps track of where in memory a process is stored?

To which state does the currently executing process return when it is interrupted by the operating system?

Which of the following describes a reference made by a program relative to itself?

In _______________ CPU scheduling, processes are moved to the CPU in the order in which they arrive.

Which of the following is a technique for keeping more than one process in memory at the same time?

Which of the following is the amount of time given to each process in a round-robin CPU scheduling algorithm?

The shortest-job-next CPU scheduling algorithm is provably optimal, but requires knowledge of the future.

Physical addresses must be converted to logical addresses in order to carry out the reference being made.

The _______________ is the core of a computer's system software.

Which of the following is a CPU scheduling algorithm that allocates processes to the CPU in the order in which they arrive?

A(n) _______________ address is used by a program to reference a generic memory location.

Which of the following best describes a partitioning approach in which all partitions are the same size?

In single contiguous memory management, an entire application program is loaded into one chunk of memory.

In partitioned memory management, an application program is separated into pieces and loaded into multiple partitions.

A process in the _______________ state has no barriers to its execution and is merely waiting for its turn to use the CPU.

The Big Picture

Binary Values and Number Systems

Data Representation

Gates and Circuits

Computing Components

Low-Level Programming Languages and Pseudocode

Problem Solving and Algorithms

Abstract Data Types and Subprograms

Object-Oriented Design and High-Level Programming Languages

File Systems and Directories

Information Systems

Artificial Intelligence

Simulation, Graphics, Gaming, and Other Applications

Networks

The World Wide Web

Computer Security

Limitations of Computing

broad concept of computer security and its importance in modern society.

Filters