Operating Systems, Chapter 1

Chapter 1 – Computer Systems Overview

True / False Questions:

1. T / F – One of the processor’s main functions is to exchange data with memory. T

2. T / F – The Program Status Word contains status information in the form of

condition codes, which are bits typically set by the programmer as a result of
program operation. F

3. T / F – The processing required for a single instruction on a typical computer

system is called the Execute Cycle.
F
4. T / F – A fetched instruction is normally loaded into the Instruction Register (IR). T

5. T / F – An interrupt is a mechanism used by system modules to signal the T

processor that normal processing should be temporarily suspended.

6. T / F – To accommodate interrupts, an extra fetch cycle is added to the F

instruction cycle.

7. T / F – The minimum information that must be saved before the processor F

transfers control to the interrupt handler routine is the program status word
(PSW) and the location of the current instruction.

8. T / F – One approach to dealing with multiple interrupts is to disable all interrupts

while an interrupt is being processed. T

9. T / F – Multiprogramming allows the processor to make use of idle time caused

by long-wait interrupt handling. T

10. T / F – In a two-level memory hierarchy, the Hit Ratio is defined as the fraction of
all memory accesses found in the slower memory. F

11. T / F – Cache memory exploits the principle of locality by providing a small, fast
memory between the processor and main memory. T

12. T / F – In cache memory design, block size refers to the unit of data exchanged
between cache and main memory T

13. T / F – The primary problem with programmed I/O is that the processor must
wait for the I/O module to become ready and must repeatedly interrogate the
status of the I/O module while waiting. T
Operating Systems, Chapter 1
Multiple Choice Questions:

1. The four main structural elements of a computer system are:

a. Processor, Registers, I/O Modules & Main Memory
b. Processor, Registers, Main Memory & System Bus
c. Processor, Main Memory, I/O Modules & System Bus
d. None of the above

2. Address registers may contain:

a. Memory addresses of data

b. Memory addresses of instructions
c. Partial memory addresses
d. All of the above

3. A Control/Status register that contains the address of the next instruction to be

fetched is called the:

a. Instruction Register (IR)

b. Program Counter (PC)
c. Program Status Word (PSW)
d. All of the above

4. The two basic steps used by the processor in instruction processing are:

a. Fetch and Instruction cycles

b. Instruction and Execute cycles
c. Fetch and Execute cycles
d. None of the above

5. A fetched instruction is normally loaded into the:

a. Instruction Register (IR)

b. Program Counter (PC)
c. Accumulator (AC)
d. None of the above

6. A common class of interrupts is:

a. Program
b. Timer
c. I/O
d. All of the above

7. When an external device becomes ready to be serviced by the processor, the

device sends this type of signal to the processor:

a. Interrupt signal
b. Halt signal
Operating Systems, Chapter 1
c. Handler signal
d. None of the above

8. Information that must be saved prior to the processor transferring control to the
interrupt handler routine includes:

a. Processor Status Word (PSW)

b. Processor Status Word (PSW) & Location of next instruction
c. Processor Status Word (PSW) & Contents of processor registers
d. None of the above

9. One accepted method of dealing with multiple interrupts is to:

a. Define priorities for the interrupts

b. Disable all interrupts except those of highest priority
c. Service them in round-robin fashion
d. None of the above

10. In a uniprocessor system, multiprogramming increases processor efficiency by:

a. Increasing processor speed

b. Taking advantage of time wasted by long wait interrupt handling
c. Eliminating all idle processor cycles
d. All of the above

11. As one proceeds down the memory hierarchy (i.e., from inboard memory to
offline storage), the following condition(s) apply:

a. Increasing cost per bit

b. Decreasing capacity
c. Increasing access time
d. All of the above

12. Small, fast memory located between the processor and main memory is called:

a. WORM memory
b. Cache memory
c. CD-RW memory
d. None of the above

13. Direct Memory Access (DMA) operations require the following information from
the processor:

a. Address of I/O device

b. Starting memory location to read from or write to
c. Number of words to be read or written
d. All of the above
 Chapter 2 – Operating System Overview
True / False Questions:
1. T / F – An operating system controls the execution of applications and acts as an interface
between applications and the computer hardware. T

2. T / F – The operating system typically runs in parallel with application programs, on it’s own special
O/S processor. F

3. T / F – In a batch-processing system, the phrase “control is passed to a job” means that the
processor is now fetching and executing instructions in a user program. T

4. T / F – Uniprogramming typically provides better utilization of system resources than

multiprogramming. T

5. T / F – In a time sharing system, a user’s program is preempted at regular intervals, but due to
relatively slow human reaction time this occurrence is usually transparent to the user. T

6. T / F – Complex operating systems today typically consist of a few thousand lines of instructions. F
7. T / F – A monolithic kernel architecture assigns only a few essential functions to the kernel,
including address spaces, interprocess communication and basic scheduling. F
================================================================================
Multiple Choice Questions:
1. A primary objective of an operating system is:
a. Convenience
b. Efficiency
c. Ability to evolve
d. All of the above
2. The operating system provides many types of services to end-users, programmers and system
designers, including:
a. Built-in user applications
b. Error detection and response
c. Relational database capabilities with the internal file system
d. All of the above
3. Operating systems must evolve over time because:
a. Hardware must be replaced when it fails
b. Users will only purchase software that has a current copyright date
c. New hardware is designed and implemented in the computer system
d. All of the above
4. A computer hardware feature that is vital to the effective operation of a multiprogramming operating
system is:
a. Very large memory
b. Multiple processors
c. I/O interrupts and DMA
d. All of the above
5. The principle objective of a time sharing, multiprogramming system is to:
a. Maximize response time
b. Maximize processor use
c. Provide exclusive access to hardware
d. None of the above
Operating Systems, sheet-3 Chapter 3 – Process Description and Control

True / False Questions:

1. The principal function of the processor is to execute machine instructions residing in main memory. T
2. A process trace is a listing of the sequence of instructions that execute for that process.T
3. The principal responsibility of the operating system is to control the execution of processes. T
4. When one process spawns another, the spawning process is referred to as the child process and the
spawned process is referred to as the parent process. F
5. Round-Robin processing refers to a method of thread prioritization for scheduling. F
6. The primary difference between the Two-State Process Model and the Five-State Process Model is
that the latter splits the Running state into two new states: Ready and Blocked.F
7. One solution to the problem of limited main memory space is swapping, which involves moving all
or part of a process from main memory to secondary memory. T
8. In order to define the control structures (e.g., tables) that the O/S needs to manage processes and
resources, it must have access to configuration data during initialization.T
9. The Process Image refers to the binary form of the program code. F
10. The portion of the Process Control Block that consists of the contents of the processor registers is
called the Process Control Information. F
11. The less-privileged processor execution mode is often referred to as kernel mode. F
12. The primary process table contains one entry per process, unless the process spawns a new process, in
which case the table contains multiple entries for the parent process. F
13. One kind of system interrupt, the trap, relates to an error or exception condition in the currently
running process. T
14. In the Nonprocess Kernel approach to defining the relationship between the O/S and the User
Process, the O/S code is executed as a separate entity that operates in privileged mode.T
15. A typical UNIX system employs two Running states, to indicate whether the process is executing in
user mode or kernel mode. T
MCQs:
1. The behavior of a processor can be characterized by examining:
a- A single process trace b- Multiple process traces
c- The interleaving of the process traces d- All of the above
2. The behavior of an individual process can be characterized by examining:
a- A single process trace b- Multiple process traces
c- The interleaving of the process traces d-All of the above
3. The basic Two-State Process Model defines two possible states for a process in relationship to the
processor: a- Running and Executing b-Running and Not Running
c- Executing and Waiting d-None of the above
4. There are a number of conditions that can lead to process termination, including:
a- Normal completion b- Bounds violation c- Parent termination d- All of the above
5. In the Five-State Process Model, the following represents a valid state transition:
a- Running -> Blocked b- New -> Running c-New -> Blocked d- All of the above
6. In a Process Model that implements two suspend states, a valid state transition is represented by:
a- Ready/Suspend -> Ready b- Running -> Ready/Suspend
c-Ready -> Ready/Suspend d-All of the above
7. The scheduling strategy where each process in the queue is given a certain amount of time, in turn, to
execute and then returned to the queue, unless blocked is referred to as:
a- Prioritization b- Round-Robin c- LIFO d- All of the above
8. A Memory Table is an O/S control structure that is used by the O/S to:

Page 1 of 4
Operating Systems, sheet-3 Chapter 3 – Process Description and Control

a- Manage I/O devices b-Manage processes

c- Provide information about system files d-None of the above
9. The Process Image element that contains the collection of attributes needed by the O/S to control a
particular process is called the:
a- User Data b- System Stack c- Process Control Block d- None of the above
10. The Process Image element that contains the modifiable part of the user space is called the:
a- User Program b- System Stack c-Process Control Block d-None of the above
11. The processor execution mode that user programs typically execute in is referred to as:
a- User mode b- System mode c-Kernel mode d- None of the above
12. One step in the procedure for creating a new process involves:
a- Initializing the process control block b- Allocating space for the process
c- Assigning a unique identifier d- All of the above
13. A process switch may occur when the system encounters an interrupt condition, such as that
generated by a:
a- Memory fault b- Supervisor call c- Trap d- All of the above
14. In the Process Based O/S:
a- Major kernel functions are organized as separate functions
b- The User Process Image includes a kernel stack
c- O/S code and data are contained in the shared address space d- None of the above
15. In a typical UNIX system, the element of the process image that contains the processor status
information is the:
a- System-level context b- Register context c- User-level context d- All of the above

Page 2 of 4
 Operating Systems sheet-4 Chapter 4 – Threads

True / False Questions:

1. The basic unit of dispatching in an operating system is usually referred to as a

thread or lightweight process. T
2. An example of a system that implements a single process with multiple threads is
MS-DOS. F
3. In a multithreaded environment, a process is defined as the unit of resource
allocation and a unit of protection. T
4. T / F – The concept of thread synchronization is required in multithreaded
systems because threads of a single process share the process’s process control
block (PCB). F
5. T / F – In a pure User-Level Thread (ULT) facility, all of the work of thread
management is done by the application, but the kernel is aware of the existence
of threads. F
6. T / F – In the field of distributed operating system design, the One-to-Many
(Thread-to-Process) relationship is particularly interesting because it involves the
concept of thread migration. T
7. T / F – One disadvantage to the master/slave shared-memory multiprocessor
architecture is that the failure of the master brings down the whole system. T
8. T / F – In a symmetric multiprocessing (SMP) system, each processor has
access only to a private main memory area. F
9. T / F – An SMP O/S manages processor and other resources so that the user
may view the system in the same fashion as a multiprogramming uniprocessor
system T
10. T / F – The primary advantage of the basic microkernel design over layered
kernel designs involves increased performance. F

Page 1 of 1
 Operating Systems sheet-4
Chapter 4 – Threads

Multiple Choice Questions:

1. The concept of a process in an operating system embodies two primary characteristics, one of which is:
a. Multithreading b- Resource ownership c- Symmetric multiprocessing d- None of the above
2. An example of a system that implements a single process with multiple threads is:
a. WIN 2000 b-Solaris c-Java d-All of the above
3. Which of the following is true regarding the relationship between processes and threads:
a. It takes far less time to create a new thread in an existing process than to create a new process
b. It takes less time to terminate a process than a thread
c. It takes less time to switch between two different processes than to switch between two threads
within the same process d-All of the above
4. The basic thread operation related to the change in thread state that occurs when a thread needs to wait for
an event is referred to as the:
a. Unblock operation b-Spawn operation c-Block operation d-None of the above
5. One of the disadvantages of User-Level Threads (ULTs) compared to Kernel-Level Threads (KLTs) is:
a. Scheduling is application specific
b. When a ULT executes a system call, all threads in the process are blocked
c. Thread switching does not require kernel mode privileges d-All of the above
6. In the Linux O/S, multiple threads may be created and executed within a single process. This is an example
of the following Thread-to-Process relationship:
a. 1:1 b-1:M c-M:N d-None of the above
7. The computer system category where a single processor executes a single instruction stream to operate on
data stored in a single memory is called:
a. Single Instruction Single Data (SISD) stream b-Single Instruction Multiple Data (SIMD) stream
c. Multiple Instruction Single Data (MISD) stream d-None of the above
8. In a SMP system, each processor maintains a local cache and must alert all other processors that a change
to cache update has taken place. This is referred to as the:
a. Interconnection mechanism problem b-Synchronization mechanism problem
c. Cache coherency problem d-None of the above
9. Key issues involved in the design of multiprocessor operating systems include:
a. Scheduling b-Synchronization c-Reliability and fault tolerance d-All of the above
10. Early operating systems that were designed with little concern about structure are typically referred to as:
a- Monolithic operating systems b- Layered operating systems
c- Kernel operating systems d-All of the above
11. A benefit of the microkernel organization is:
a. Extensibility b-Portability c-Flexibility d-All of the above

Page 1 of 3
Operating Systems, Scheduling Chapter 5
True / False Questions:
1. – Scheduling affects the performance of a system because it determines which processes will wait and
which will progress. T
2. – The short-term scheduler may limit the degree of multiprogramming to provide satisfactory service to the
current set of processes. F
3. – Medium-term scheduling is part of the system swapping function. T
4. – The long-term scheduler is invoked whenever an event occurs that may lead to the suspension or
preemption of the currently running process. F
5. – The main objective of short-term scheduling is to allocate processor time in such a way as to optimize one
or more aspects of system behavior. T
6. – One problem with a pure priority scheduling scheme is that lower-priority processes may suffer deadlock. F
7. – The selection function determines which process, among ready processes, is selected next for execution. T
8. – First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O-bound processes over
processor bound processes. F
9. – Round Robin is a scheduling technique is also known as time slicing, because each process is given a
slice of time before being preempted. T
10. – The Shortest Process Next (SPN) scheduling policy is often used for time-sharing and transaction
processing environments because of the lack of preemption. F
11. – The Shortest Remaining Time (SRT) scheduling policy is a preemptive version of the Shortest Process
Next (SPN) scheduling policy. T
12. – In the Highest Response Ratio Next (HRRN) scheduling policy, longer jobs are favored, because they
yield a larger ratio from the smaller denominator in the equation. F
13. – A disadvantage of simulation is that results for a given “run” only apply to that particular collection of
processes under that particular set of assumptions. T
14. – In “fair share” scheduling, each user is assigned a weighting of some sort that defines that user’s share of
system resources as a fraction of the total usage of those resources. T

Multiple Choice Questions:

1. 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
2. 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
3. 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
4. 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
5. 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
6. A typical way to overcome starvation of lower-priority processes in a priority-based 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
7. 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
8. 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)
b. Turnaround or residence time (TAT) d- None of the above
9. 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
10. 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

Page 1 of 4
 Operating Systems, Scheduling Chapter 5
c. The lack of preemption d-All of the above
11. 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
12. 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
13. 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
14. 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 above

Fill-In-The-Blank Questions:
1. The task of assigning processes to the processor or processors over time, in a way that meets system
scheduling
objectives is called _______________.
2. The decision as to when to create a new process is generally driven by the desired degree of
multiprogramming
_______________.
medium
3. _______________-term scheduling is part of the system swapping function.
4. The _______________-term
short scheduler is invoked whenever an event occurs that may lead to the
suspension or preemption of the currently running process.
performance
5. Response time and throughput are examples of _______________-related criteria for short-term scheduling
6. In a system employing priority scheduling, the scheduler always selects the process with the
highest
_______________ priority level for processing.
decision mode which has two general categories, specifies the instants in time at which the
7. The _______________,
selection function is exercised.
8. In terms of the queuing model, the total time that a process spends in a system (waiting time plus service
time) is called the turnaround
_______________.time (TAT)
time slicing
9. The Round Robin scheduling technique is also known as _______________, because each process is given
a set amount of processor time before being preempted.
shortest process next (SPN)
10. _______________ is a scheduling policy in which the process with the shortest expected processing time is
selected next, but there is no preemption.
shortest remaining time (SRT) is a scheduling policy in which the process with the shortest expected processing time is
11. _______________
selected next, and if a shorter process becomes ready in the system, the currently running process is
preempted.
12. A scheduling mechanism that requires no prior knowledge of process length, yet can nevertheless favor
feedback
shorter jobs, is known as the _______________ scheduling mechanism.
13. In _______________ scheduling, each user is assigned a weighting of some sort that defines that user’s
share of system resources as a fraction of the total usage of those resources.
discrete-event simulation

Page 2 of 4
 Operating Systems, Memory Management sheet-6

True / False Questions:

1. – In a multiprogramming system, main memory is divided into multiple sections: one for the
operating system (resident monitor, kernel) and one for the set of processes currently being
executed. T
2. – The task of subdividing memory between the O/S and processes is performed
automatically by the O/S and is called relocation. F
3. – 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 overlaying. T
4. – The concept of virtual memory is based on one or both of two basic techniques:
segmentation and paging. T
5. – A major problem with the largely obsolete Fixed Partitioning memory management
technique is that of external fragmentation. F
6. – The problem of internal fragmentation can be lessened in a system employing a fixed-
partition memory management scheme by using unequal size partitions. T
7. – In the Dynamic Partitioning technique of memory management, the best-fit placement
algorithm is usually the best performer of the available algorithms. F
8. – In the Dynamic Partitioning technique of memory management, compaction refers to
shifting the processes into a contiguous block, resulting in all the free memory aggregated
into in a single block. T
9. – In the Dynamic Partitioning technique of memory management, the first-fit placement
algorithm scans memory from the location of the last placement and chooses the first
available block it finds that satisfies the request. F
10. The Buddy System is a reasonable compromise to overcome the disadvantages of both the fixed and variable partition
schemes. T
11. – A physical memory address is a reference to a memory location independent of the
current assignment of data to memory. F

Page 1 of 4
 Operating Systems, Memory Management sheet-6

12. – A memory system employing paging may suffer slightly from internal fragmentation and
experiences no external fragmentation. T
13. – In a memory system employing paging, the chunks of a process (called frames) can be
assigned to available chunks of memory (called pages). F
14. – A memory system employing segmentation may suffer slightly from external
fragmentation and experience no internal fragmentation. T
15. – A memory system employing segmentation consists of a number of user program
segments that must be of the same length and have a maximum segment length. F

Multiple Choice Questions:

1. 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
2. The concept of Memory Management satisfies certain system requirements, including:
a. Protection b-Relocation c-Physical organization d-All of the above
3. 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
4. The concept of virtual memory is based on one or both of two basic techniques:
a. Overlaying and relocation b-Segmentation and paging
b. Segmentation and partitioning d-None of the above
5. 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
6. The problem of internal fragmentation can be lessened in systems employing a fixed-partition
memory management scheme by using:
Page 2 of 4
 Operating Systems, Memory Management sheet-6

a. Random size partitions b-Equal size partitions

c.Unequal size partitions d-None of the above
7. 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
8. 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
9. 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
10. 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
11. An actual location in main memory is called a(n):
a-Relative address b-Logical address c-Absolute address d-None of the above
12. 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
13. 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
14. In a system employing a segmentation scheme for memory management, wasted space is
due to:
Page 3 of 4
 Operating Systems, Memory Management sheet-6

a-External fragmentation b-Internal fragmentation

c-Segments of different sizes d-None of the above
15. 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

Page 4 of 4
 Operating Systems, Virtual Memory sheet-7

True / False Questions:

1. – In a system employing a memory management strategy that doesn’t require an entire
process to be in main memory at one time, the portion of a process that is actually in main
memory at any given time is defined to be the resident set of the process. T
2. – The condition known as thrashing occurs when the majority of the processes in main
memory require repetitive blocking on a single shared I/O device in the system. F
3. – The modify (M) bit is a control bit in a page table entry that indicates whether the contents
of the corresponding page have been altered since the page was last loaded into memory. T
4. – A Page Fault occurs when the desired page table entry is not found in the Translation
Lookaside Buffer (TLB). F
5. – One of the advantages to the programmer of virtual memory using segmentation is that it
simplifies the handling of growing data structures by allowing the segment to grow or shrink
as necessary. T
6. – In a combined paging/segmentation system, a user’s address space is broken up into a
number of fixed-size pages, which in turn are broken up into a number of segments. F
7. – To achieve sharing in a segmentation system, it is possible for a segment to be referenced
in the segment tables of more than one process. T

9. – The fetch policy determines when a page should be brought into main memory. T
10. – The Least Recently Used (LRU) replacement policy replaces the page in memory that
has been referenced most recently. F
11. - A global replacement policy considers all unlocked pages in main memory as candidates
for replacement, regardless of which process owns a particular page. T
12. – In a precleaning policy, modified pages are written to secondary memory once they have
been selected for replacement. F

Page 1 of 3
 Operating Systems, Virtual Memory sheet-7

Multiple Choice Questions:

1. 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
2. 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
3. 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
4. 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
5. Segmentation has a number of advantages to the programmer over a non-segmented
address space, including:
a. Simplifying the handling of growing data structures b-Sharing among processes
c-Protection d-All of the above
6. 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
7. 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
Page 2 of 3
 Operating Systems, Virtual Memory sheet-7

c. Having a common data area that all processes can share d-All of the above
8. 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
9. 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
10. 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
11. 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
12. 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

Page 3 of 3