0% found this document useful (0 votes)
25 views9 pages

OS PreTest3

Uploaded by

bopiranha2011
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views9 pages

OS PreTest3

Uploaded by

bopiranha2011
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

For larger page tables, they are kept in main memory and a __________

points to the page table.


Select one:
page table base register
page table base pointer
page table register pointer
page table base
.With paging there is no ________ fragmentation.
Select one:
internal
external
either type of
none of the mentioned
.If there are 32 segments, each of size 1Kb, then the logical address should
have ____________
Select one:
14 bits
16 bits
15 bits
13 bits
.If the offset is legal ____________
Select one:
none of the mentioned
it is used as a physical memory address itself
it is subtracted from the segment base to produce the physical memory address
it is added to the segment base to produce the physical memory address
.What location is the operating system?
Select one:
in the high memory
in the low memory
either low or high memory (depending on the location of interrupt vector)
none of the mentioned
.Binding of instructions and data to memory addresses can be done at
____________
Select one:
Compile time
Execution time
Load time
All of the mentioned
.Using transient code, _______ the size of the operating system during
program execution.
Select one:
decreases
increases
changes
maintains
.The size of a page is typically ____________
Select one:
none of the mentioned
varied
power of 4
power of 2
.What is Dynamic loading?
Select one:
none of the mentioned
loading multiple routines dynamically
loading a routine only when it is called
loading multiple routines randomly
.What is Address Binding?
Select one:
going to an address in memory
binding two addresses together to form a new address in a different memory space
a mapping from one address space to another
locating an address with the help of another address
.The segment limit contains the ____________
Select one:
starting physical address of the segment in memory
starting logical address of the process
segment length
none of the mentioned
.If the process can be moved during its execution from one memory
segment to another, then binding must be ____________
Select one:
preponed to load time
none of the mentioned
preponed to compile time
delayed until run time
.The idea of overlays is to ____________
Select one:
enable a process to be larger than the amount of memory allocated to it
keep in memory only those instructions
data that are needed at any given time
all of the mentioned
.If binding is done at assembly or load time, then the process _____ be
moved to different locations after being swapped out and in again.
Select one:
can never
can
must
may
.The _____ table contains the base address of each page in physical
memory.
Select one:
memory
page
frame
process
.The ___________ swaps processes in and out of the memory.
Select one:
Memory manager
CPU
User
CPU manager
.The relocation register helps in ____________
Select one:
to protect the address spaces of processes
none of the mentioned
a different address space to processes
providing more address space to processes
.Each entry in a segment table has a ____________
Select one:
none of the mentioned
segment value
segment peak
segment base
.When the entries in the segment tables of two different processes point to
the same physical location ____________
Select one:
the segments are invalid
the processes get blocked
segments are shared
all of the mentioned
.The operating system maintains a ______ table that keeps track of how
many frames have been allocated, how many are there, and how many are
available.
Select one:
mapping
page
frame
memory
.The offset ‘d’ of the logical address must be ____________
Select one:
between 0 and segment limit
greater than the segment number
between 0 and the segment number
greater than segment limit
.In paging the user provides only ________ which is partitioned by the
hardware into ________ and ______
Select one:
none of the mentioned
one address, page number, offset
one offset, page number, address
page number, offset, address
.In segmentation, each address is specified by ____________
Select one:
an offset & value
a key & value
a segment number & offset
a value & segment number
.Logical memory is broken into blocks of the same size called _________
Select one:
backing store
pages
frames
none of the mentioned
.When memory is divided into several fixed sized partitions, each partition
may contain ________
Select one:
exactly one process
multiple processes at once
at least one process
none of the mentioned
.Smaller page tables are implemented as a set of _______
Select one:
counters
registers
stacks
queues
.The __________ is used as an index into the page table.
Select one:
frame bit
page number
frame offset
page offset
.Which of the following is TRUE?
Select one:
Overlays are used to increase the size of physical memory
When overlays are used, the size of a process is not limited to the size of the
physical memory
Overlays are used to increase the logical address space
Overlays are used whenever the physical address space is smaller than the logical
address space
.A multilevel page table is preferred in comparison to a single level page
table for translating virtual address to physical address because ____________
Select one:
it helps to reduce the size of page table needed to implement the virtual address
space of a process
it is required by the translation lookaside buffer
it reduces the memory access time to read or write a memory location
it helps to reduce the number of page faults in page replacement algorithms
The page table registers should be built with _______
Select one:
a large memory space
very low speed logic
none of the mentioned
very high speed logic
.The operating system and the other processes are protected from being
modified by an already running process because ____________
Select one:
every address generated by the CPU is being checked against the relocation and
limit registers
they are in different logical addresses
they are in different memory spaces
they have a protection algorithm

.In a system that does not support swapping ____________


Select one:
binding of symbolic addresses to physical addresses normally takes place during
execution
the loader binds relocatable addresses to physical addresses
the compiler normally binds symbolic addresses (variables) to relocatable addresses
the compiler normally binds symbolic addresses to physical addresses
.The segment base contains the ____________
Select one:
starting logical address of the process
starting physical address of the segment in memory
segment length
none of the mentioned
.What is the advantage of dynamic loading?
Select one:
A used routine is used multiple times
An unused routine is never loaded
CPU utilization increases
All of the mentioned
.The protection bit is 0/1 based on ____________
Select one:
read – write
write only
none of the mentioned
read only
.The first fit, best fit and worst fit are strategies to select a ______
Select one:
processor to run the next process
all of the mentioned
process from a queue to put in memory
free hole from a set of available holes
.The primary memory can hold ____________
Select one:
operating system
cpu
user processes
all of the mentioned
.In contiguous memory allocation ____________
Select one:
the memory space is contiguous
all processes are contained in a single contiguous section of memory
none of the mentioned
each process is contained in a single contiguous section of memory
For every process there is a __________
Select one:
page table
all of the mentioned
pointer to page table
copy of page table
.Transient operating system code is code that ____________
Select one:
comes and goes as needed
is not easily accessible
never enters the memory space
stays in the memory always
.Consider a computer with 8 Mbytes of main memory and a 128K cache.
The cache block size is 4 K. It uses a direct mapping scheme for cache
management. How many different main memory blocks can map onto a
given physical cache block?
Select one:
64
8
2048
256
.In fixed size partition, the degree of multiprogramming is bounded by
___________
Select one:
the number of partitions
all of the mentioned
the CPU utilization
the memory size
.The ___________ must design and program the overlay structure.
Select one:
system designer
none of the mentioned
programmer
system architect
.If a higher priority process arrives and wants service, the memory
manager can swap out the lower priority process to execute the higher
priority process. When the higher priority process finishes, the lower
priority process is swapped back in and continues execution. This variant
of swapping is sometimes called?
Select one:
roll out, roll in
pull out, push in
priority swapping
none of the mentioned
.Physical memory is broken into fixed-sized blocks called ________
Select one:
none of the mentioned
backing store
pages
frames
.Paging increases the ______ time.
Select one:
execution
all of the mentioned
context – switch
waiting
.With relocation and limit registers, each logical address must be _______ the limit
register.
Select one:
less than
none of the mentioned
equal to
greater than
.Time taken in memory access through PTBR is ____________
Select one:
extended by a factor of 3
extended by a factor of 2
slowed by a factor of 2
slowed by a factor of 3
.If the size of logical address space is 2 to the power of m, and a page size
is 2 to the power of n addressing units, then the high order _____ bits of a
logical address designate the page number, and the ____ low order bits
designate the page offset.
Select one:
m, n
m – n, n
n, m
m – n, m

You might also like