Deck 10: Operating Systems

Question 1

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

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

Answer 1

C

Question 2

Which of the following best describes a partitioning approach that uses the base register to store the beginning address of the current partition?

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

Answer 2

C

Question 3

Which of the following best describes a partitioning approach that uses the bounds register to store the last address of the current position?

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

Answer 3

D

Question 4

Which of the following describes the act of storing register values for the currently executing process and loading the register values for the process taking over the CPU?

A) Swapping
B) Context switch
C) Demand paging
D) Thrashing
E) Virtual memory

Question 5

To which state does a process move when the CPU scheduling algorithm determines it may next use the CPU?

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

Question 6

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

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

Question 7

Application software interacts directly with the computer hardware.

Question 8

A computer could have two or more operating systems, but only one operating system controls the computer at any given time.

Question 9

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

Question 10

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

Question 11

A process in the ready state may be terminated because needed resources are not available.

Question 12

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

Question 13

A(n) _______________ is a program in execution, which the operating system must manage carefully.

Question 14

The _______________ register holds the address of the beginning of a partition.

Question 15

_______________ occurs when pages are moved in and out of secondary memory excessively, degrading system performance.

Question 16

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

Question 17

A CPU scheduling decision made when a process moves from the waiting state to the ready state is an example of _____________ scheduling.

Question 18

What is a physical address?

Question 19

Name the five process states.

Question 20

Which of the following tracks the progress of a program during execution?

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

Question 21

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

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

Question 22

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

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

Question 23

Which of the following describes a CPU scheduling algorithm in which each process is given a small amount of time to use the CPU before being forced to wait until its turn comes around again?

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

Question 24

If a program is loaded into memory beginning at address 555555, what is the physical address of relative address 333333?

A) 222222
B) 888888
C) 555555
D) 333333
E) 888888011

Question 25

Which of the following is the technique for keeping multiple programs in main memory at the same time, competing for their chance at the CPU?

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

Question 26

In which state is a process that is currently being executed by the CPU?

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

Question 27

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

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

Question 28

Application software is written to solve problems in the real world.

Question 29

The operating system has a dedicated CPU and therefore does not compete with other application programs for CPU time.

Question 30

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

Question 31

The process life cycle describes the conceptual states through which a process moves as it is managed by the operating system.

Question 32

In preemptive CPU scheduling, a process may be forced to wait even though all its necessary resources are available.

Question 33

A relative address is an actual location in main memory.

Question 34

An operating system uses nonpreemptive CPU scheduling when a process moves from the waiting state to the ready state.

Question 35

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

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

Question 36

Which of the following describes a memory management technique in which only one application program was loaded into memory?

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

Question 37

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

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

Question 38

In which state does a process reside if it does not have a needed resource, such as a page from secondary memory?

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

Question 39

Which of the following is a CPU scheduling algorithm that gives priority to the process with the smallest estimated remaining run time?

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

Question 40

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

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

Question 41

An operating system is the core part of the system software of a computer.

Question 42

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

Question 43

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

Question 44

A context switch occurs each time a process moves to the running state.

Question 45

The first-come, first-served (FCFS) CPU scheduling algorithm is a preemptive approach.

Question 46

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

Question 47

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

Question 48

When interrupted by the CPU scheduler, the currently executing process returns to the _______________ state.

Question 49

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