Term
The permanent blocking of a set of processes that either compete for system resources or communicate with each other is called:
a. Starvation
b. Deadlock
c. Prioritization
d. All of the above |
|
Definition
|
|
Term
All deadlocks involve conflicting needs for resources by:
a. One or more processes
b. Two or more processes
c. Three or more processes
d. None of the above |
|
Definition
|
|
Term
A resource that can be created and destroyed is called a:
a. Reusable resource
b. Producible resource
c. Consumable resource
d. All of the above |
|
Definition
|
|
Term
An example of a consumable resource is the following:
a. Messages
b. Printers
c. Main Memory
d. All of the above |
|
Definition
|
|
Term
A condition of policy that must be present for a deadlock to be possible is:
a. Mutual exclusion
b. Hold and wait
c. No preemption
d. All of the above |
|
Definition
|
|
Term
A direct method of deadlock prevention is to prevent the occurrence of:
a. Mutual exclusion
b. Hold and wait
c. Circular wait
d. All of the above |
|
Definition
|
|
Term
One approach to deadlock avoidance is called:
a. Process Termination Denial
b. Resource Allocation Denial
c. Hold and wait
d. None of the above |
|
Definition
| Resource Allocation Denial |
|
|
Term
In the Resource Allocation Denial approach to Deadlock Avoidance, a safe state is defined as one in which:
a. At least one potential process sequence does not result in a deadlock
b. All potential process sequences do not result in a deadlock:
c. Several potential process sequences do not result in a deadlock:
d. None of the above |
|
Definition
| At least one potential process sequence does not result in a deadlock |
|
|
Term
. A conservative strategy for dealing with deadlocks that involves limiting access to resources and imposing restrictions on processes is called:
a. Deadlock Prevention
b. Deadlock Avoidance
c. Deadlock Detection
d. None of the above |
|
Definition
|
|
Term
In deadlocked process recovery, selection criteria for choosing a particular
process to abort or rollback includes designating the process with the:
a. Most estimated time remaining
b. Lowest priority
c. Least total resources allocated so far
d. All of the above |
|
Definition
|
|
Term
One approach to an integrated strategy for dealing with deadlocks involves the
implementation of:
a. Resource classes
b. Process rollbacks
c. Virtual memory
d. None of the above |
|
Definition
|
|
Term
The Dining Philosopher’s Problem is a standard test case for evaluating
approaches to implementing:
a. Deadlock
b. Starvation
c. Synchronization
d. All of the above |
|
Definition
|
|
Term
A software mechanism that informs a process of the occurrences of
asynchronous events in UNIX are called:
a. Pipes
b. Messages
c. Signals
d. All of the above |
|
Definition
|
|
Term
Thread synchronization primitives supported by Solaris include:
a. Mutual exclusion (mutex) locks
b. Semaphores
c. Condition variables
d. All of the above |
|
Definition
|
|
Term
The family of synchronization objects implemented by W2K include:
a. Mutex objects
b. Semaphore objects
c. Event objects
d. All of the above |
|
Definition
|
|
Term
The task of subdividing memory between the O/S and processes is performed
automatically by the O/S and is called:
a. Protection
b. Relocation
c. Memory Management
d. All of the above |
|
Definition
|
|
Term
The concept of Memory Management satisfies certain system requirements,
including:
a. Protection
b. Relocation
c. Physical organization
d. All of the above |
|
Definition
|
|
Term
The practice in which a program and data are organized in such a way that
various modules can be assigned the same region of memory is called:
a. Overlaying
b. Sharing
c. Relocation
d. None of the above |
|
Definition
|
|
Term
The concept of virtual memory is based on one or both of two basic techniques:
a. Overlaying and relocation
b. Segmentation and paging
c. Segmentation and
partitioning
d. None of the above |
|
Definition
|
|
Term
A problem with the largely obsolete Fixed Partitioning memory management
technique is that of:
a. Allowing only a fixed
number of Processes
b. Inefficient use of memory
c. Internal fragmentation
d. All of the above |
|
Definition
|
|
Term
The problem of internal fragmentation can be lessened in systems employing a
fixed-partition memory management scheme by using:
a. Random size partitions
b. Equal size partitions
c. Unequal size partitions
d. None of the above |
|
Definition
|
|
Term
In the Dynamic Partitioning technique of memory management, the phenomenon
that results in unused blocks of memory outside of existing partitions is called:
a. Internal fragmentation
b. External fragmentation
c. Compaction
d. None of the above |
|
Definition
|
|
Term
In the Dynamic Partitioning technique of memory management, the placement
algorithm that chooses the block that is closest in size to the request is called:
a. Best-fit
b. First-fit
c. Next-fit
d. All of the above |
|
Definition
|
|
Term
In the Dynamic Partitioning technique of memory management, the placement
algorithm that scans memory from the location of the last placement and chooses
the next available block that large enough to satisfy the request is called:
a. Best-fit
b. First-fit
c. Next-fit
d. All of the above |
|
Definition
|
|
Term
A reference to a memory location independent of the current assignment of data
to memory is called a(n):
a. Relative address
b. Logical address
c. Absolute address
d. None of the above |
|
Definition
|
|
Term
An actual location in main memory is called a(n):
a. Relative address
b. Logical address
c. Absolute address
d. None of the above |
|
Definition
|
|
Term
The page table for each process maintains:
a. The frame location for
each page of the process
b. The page location for each
frame of the process
c. The physical memory
location of the process
d. None of the above |
|
Definition
The frame location for
each page of the process |
|
|
Term
In a system employing a paging scheme for memory management, wasted space
is due to:
a. External fragmentation
b. Internal fragmentation
c. Pages and frames of
different specified sizes
d. None of the above |
|
Definition
|
|
Term
. In a system employing a segmentation scheme for memory management,
wasted space is due to:
a. External fragmentation
b. Internal fragmentation
c. Segments of different
sizes
d. None of the above |
|
Definition
|
|
Term
In a system employing a segmentation scheme for memory management, a
process is divided into:
a. One segment per thread
b. A number of segments
which must be of equal
size
c. A number of segments
which need not be of equal
size
d. None of the above |
|
Definition
A number of segments
which need not be of equal
size |
|
|
Term
The type of memory that allows for very effective multiprogramming and relieves
the user of memory size constraints is referred to as:
a. Real memory
b. Virtual memory
c. Main memory
d. All of the above |
|
Definition
|
|
Term
The situation where the processor spends most of its time swapping process
pieces rather than executing instructions is called:
a. Paging
b. The Principle of Locality
c. Thrashing
d. None of the above |
|
Definition
|
|
Term
The situation that occurs when the desired page table entry is not found in the
Translation Lookaside Buffer (TLB) is called a:
a. TLB miss
b. TLB hit
c. Page fault
d. None of the above |
|
Definition
|
|
Term
The real address of a word in memory is translated from the following portions of
a virtual address:
a. Page number and frame
number
b. Page number and offset
c. Frame number and offset
d. None of the above |
|
Definition
|
|
Term
. Segmentation has a number of advantages to the programmer over a nonsegmented address space, including:
a. Simplifying the handling of
growing data structures
b. Sharing among processes
c. Protection
d. All of the above |
|
Definition
|
|
Term
. In a combined paging/segmentation system, a user’s address space is broken up
into a number of:
a. Segments or pages, at the
discretion of the
programmer
b. Fixed-size pages, which
are in turn broken down
into variable-sized
segments
c. Variable-sized Segments,
which are in turn broken
down into fixed-size pages
d. All of the above |
|
Definition
Variable-sized Segments,
which are in turn broken
down into fixed-size pages |
|
|
Term
Sharing is achieved in a segmentation system by:
a. Referencing a segment in
the segment tables of
more than one process
b. Each process segment
table having a reference to
the dispatcher main
memory area
c. Having a common data
area that all processes can
share
d. All of the above |
|
Definition
Referencing a segment in
the segment tables of
more than one process |
|
|
Term
. A fundamental choice in the design of the memory-management portion of an
O/S is:
a. Whether or not to use
virtual memory techniques
b. Whether to use paging,
segmentation of a
combination of the two
c. The algorithms employed
for various aspects of
memory management
d. All of the above |
|
Definition
|
|
Term
The fetch policy that exploits the characteristics of most secondary memory
devices, such as disks, which have seek time and rotational latency is called:
a. Demand paging
b. Prepaging
c. Swapping
d. None of the above |
|
Definition
|
|
Term
The replacement policy that is impossible to implement because it would require
the O/S to have perfect knowledge of future events is called the:
a. Optimal policy
b. Least recently used (LRU)
policy
c. Clock policy
d. None of the above |
|
Definition
|
|
Term
The replacement policy that chooses only among the resident pages of the
process that generated the page fault in selecting a page to replace is referred to
as a:
a. Global replacement policy
b. Local replacement policy
c. Variable replacement
policy
d. None of the above |
|
Definition
|
|
Term
The concept associated with determining the number of processes that will be
resident in main memory is referred to as:
a. A cleaning policy
b. The page fault frequency
c. Load Control
d. None of the above |
|
Definition
|
|
Term
In SVR4 and Solaris systems, the memory management scheme that manages
user processes and disk I/O is called the:
a. Paging system
b. Virtual memory manager
c. Kernel memory allocator
d. None of the above |
|
Definition
|
|
Term
The multi-level memory management scheme implemented in Linux was
designed to minimize large page tables and directories in which of the following
line of processors:
a. 16-bit X86 architecture
b. 32-bit Pentium/X86
architecture
c. 64-bit Alpha architecture
d. None of the above |
|
Definition
| 64-bit Alpha architecture |
|
|
Term
| The Windows 2000 virtual memory manager can use page sizes ranging from: |
|
Definition
|
|
Term
The type of scheduling that involves the decision to add a process to those that
are at least partially in main memory and therefore available for execution is
referred to as:
a. Long-term scheduling
b. Medium-term scheduling
c. I/O scheduling
d. None of the above |
|
Definition
|
|
Term
The decision as to which job to admit to the system next can be based on which
of the following criteria:
a. Simple FIFO
b. Priority
c. I/O requirements
d. All of the above |
|
Definition
|
|
Term
Typically, the swapping-in function for processes is based on the need to
manage:
a. Process priorities
b. Virtual memory
c. The degree of
multiprogramming
d. None of the above |
|
Definition
The degree of
multiprogramming |
|
|
Term
. In terms of frequency of execution, the short-term scheduler is usually the one
that executes:
a. Most frequently
b. Least frequently
c. About the same as the
other schedulers
d. None of the above |
|
Definition
|
|
Term
Response time in an interactive system is an example of:
a. System-oriented criteria for short-term scheduling policies
b. User-oriented criteria for short-term scheduling policies
c. System-oriented criteria for long-term scheduling policies
d. None of the above |
|
Definition
| User-oriented criteria for short-term scheduling policies |
|
|
Term
A typical way to overcome starvation of lower-priority processes in a prioritybased scheduling system is to:
a. Change a process priority
randomly
b. Change a process priority
with its age
c. Round-robin cycling of
processes in a priority
queue
d. All of the above |
|
Definition
Change a process priority
with its age |
|
|
Term
Which of the following scheduling policies allow the O/S to interrupt the currently
running process and move it to the Ready state?
a. Preemptive
b. Non-Preemptive
c. First-come-first-served
d. None of the above |
|
Definition
|
|
Term
. In terms of the queuing model, the total time that a process spends in a system
(waiting time plus service time) is called:
a. Normalized turnaround
time (TAT)
b. Finish time (FT)
c. Turnaround or residence
time (TAT)
d. None of the above |
|
Definition
Turnaround or residence
time (TAT) |
|
|
Term
In the Round Robin scheduling technique, the principle design issue is:
a. Determining the fair distribution of time quanta to individual processes
b. Determining the method of cycling through a given set of processes
c. Determining the length of the time quantum
d. None of the above |
|
Definition
Determining the method of cycling through a given set of processes
Determining the length of the time quantum |
|
|
Term
One difficulty with the Shortest Process Next (SPN) scheduling technique is:
a. The need to know or estimate required processing times for each process
b. The starvation of longer processes
c. The lack of preemption
d. All of the above |
|
Definition
|
|
Term
One difficulty with the Shortest Remaining Time (SRT) scheduling technique is:
a. The need to know or estimate required processing times for each process
b. The starvation of shorter processes
c. The lack of preemption
d. All of the above |
|
Definition
| The need to know or estimate required processing times for each process |
|
|
Term
Which of the following scheduling policies require prior knowledge or estimation
of process length:
a. Shortest Remaining Time (SRT)
b. Shortest Process Next (SPN)
c. Highest Response Ratio Next (HRRN)
d. All of the above |
|
Definition
|
|
Term
It is impossible to make definitive comparisons of various scheduling policies due
to dependence on factors such as:
a. The probability distribution of service times of the various processes
b. The efficiency of the scheduling and context switching mechanisms
c. The nature of the I/O demand and performance of the I/O subsystem
d. All of the above |
|
Definition
|
|
Term
The strategy that schedules processes based on their group affiliation is
generally referred to as:
a. Queuing analysis
b. Simulation modeling
c. Fair share scheduling
d. All of the abov |
|
Definition
|
|
Term
The traditional UNIX scheduler divides processes into fixed bands of priority
levels, with the highest priority band being the:
a. Swapper band
b. File manipulation band
c. User process band
d. None of the above |
|
Definition
|
|
