Deck 16: Memory Management in Operating Systems

Question 1

The address of a page table in memory is pointed by___________

A)stack pointer
B)page table base register
C)page register
D)program counter

Answer 1

page table base register

Question 2

Program always deals with___________

A)logical address
B)absolute address
C)physical address
D)relative address

Answer 2

logical address

Question 3

The page table contains___________

A)base address of each page in physical memory
B)page offset
C)page size
D)none of the mentioned

Answer 3

base address of each page in physical memory

Question 4

What is compaction?

A)a technique for overcoming internal fragmentation
B)a paging technique
C)a technique for overcoming external fragmentation
D)a technique for overcoming fatal error

Question 5

Operating System maintains the page table for___________

A)each process
B)each thread
C)each instruction
D)each address

Question 6

The main memory accommodates

A)operating system
B)cpu
C)user processes
D)all of the mentioned

Question 7

What is the operating system?

A)in the low memory
B)in the high memory
C)either low or high memory (depending on the location of interrupt vector)
D)none of the mentioned

Question 8

In contiguous memory allocation

A)each process is contained in a single contiguous section of memory
B)all processes are contained in a single contiguous section of memory
C)the memory space is contiguous
D)none of the mentioned

Question 9

The relocation register helps in

A)providing more address space to processes
B)a different address space to processes
C)to protect the address spaces of processes
D)none of the mentioned

Question 10

The operating system and the other processes are protected from being modified by an already running process because

A)they are in different memory spaces
B)they are in different logical addresses
C)they have a protection algorithm
D)every address generated by the cpu is being checked against the relocation and limit registers

Question 11

Transient operating system code is code that___________

A)is not easily accessible
B)comes and goes as needed
C)stays in the memory always
D)never enters the memory space

Question 12

Using transient code,___________the size of the operating system during program execution.

A)increases
B)decreases
C)changes
D)maintains

Question 13

In fixed size partition, the degree of multiprogramming is bounded by

A)the number of partitions
B)the cpu utilization
C)the memory size
D)all of the mentioned

Question 14

The first fit, best fit and worst fit are strategies to select a___________  

A)process from a queue to put in memory
B)processor to run the next process
C)free hole from a set of available holes
D)all of the mentioned

Question 15

In internal fragmentation, memory is internal to a partition and___________

A)is being used
B)is not being used
C)is always used
D)none of the mentioned

Question 16

A solution to the problem of external fragmentation is___________

A)compaction
B)larger memory space
C)smaller memory space
D)none of the mentioned

Question 17

Another solution to the problem of external fragmentation problem is to___________

A)permit the logical address space of a process to be noncontiguous
B)permit smaller processes to be allocated memory at last
C)permit larger processes to be allocated memory at last
D)all of the mentioned

Question 18

If relocation is static and is done at assembly or load time, compaction

A)cannot be done
B)must be done
C)must not be done
D)can be done

Question 19

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is___________

A)the cost incurred
B)the memory used
C)the cpu used
D)all of the mentioned

Question 20

External fragmentation will not occur when?

A)first fit is used
B)best fit is used
C)worst fit is used
D)no matter which algorithm is used, it will always occur

Question 21

Sometimes the overhead of keeping track of a hole might be___________

A)larger than the memory
B)larger than the hole itself
C)very small
D)all of the mentioned

Question 22

When the memory allocated to a process is slightly larger than the process, then

A)internal fragmentation occurs
B)external fragmentation occurs
C)both internal and external fragmentation occurs
D)neither internal nor external fragmentation occurs

Question 23

Physical memory is broken into fixed-sized blocks called___________  

A)frames
B)pages
C)backing store
D)none of the mentioned

Question 24

Logical memory is broken into blocks of the same size called___________    

A)frames
B)pages
C)backing store
D)none of the mentioned

Question 25

Every address generated by the CPU is divided into two parts. They are

A)frame bit & page number
B)page number & page offset
C)page offset & frame bit
D)frame offset & page offset