Quiz #6

Question 1

Matching

(1 points)

Question:

Match up the forms of fragmentation that may occur with the process memory allocation techniques.

	Match	Question Items
		1. fixed partitioning
		2. dynamic partitioning
		3. simple paging
		4. simple segmentation
		5. virtual memory paging
		6. virtual memory segmentation

Answer Items

A. internal fragmentation

B. external fragmentation

Question 2 Multiple Choice (1 points)

Question: Shifting the regions of memory allocated to processes, so that all the free memory forms one contiguous region.

placement
compaction
external fragmentation
internal fragmentation
swapping
coalescing

Question 3 Multiple Choice (1 points)

Question: With this form of loading, a given load module must always be loaded into the same location in main memory.

Absolute loading
Relocatable loading
Dynamic run-time loading

Question 4 Multiple Choice (1 points)

Question: With a relocating loader, the time at which the absolute address of the entry point of a subprogram is bound is

Programming time
Compile or assembly time
Load time
Run time

Question 5 Multiple Choice (1 points)

Question: Combining of multiple object modules into a load module is done by a

Compiler or assembler
Absolute loader
Relocating loader
Linker

Question 6 Multiple Choice (1 points)

Question: With the Buddy System, the address of the buddy of the block of size 512 bytes with byte address 0111001010010000 would be

0111001010110100
0111000101001000
0111001000010000
0111000010010000
0111001110010000

Question 7 Multiple Answer (1 points)

Question: Which of the following is true of memory compaction, as applied to the allocation of memory to processes?

It combats external fragmentation
It combats internal fragmentation
It takes time proportional to the size of the memory
It requires hardware-supported dynamic relocation
It is performed by the linker
It is done every time a new process is brought into memory
It is done periodically, when memory has become too fragmented

Question 8 Multiple Answer (1 points)

Question: Which of the following are true of paging?

It eliminates the problem of external fragmentation
It eliminates the problem of internal fragmentation
It enables the possibility of virtual memory
It requires special hardware support
Pages are kept in a page table
A page table entry is requred for each page
It provides the ability to do dynamic relocation

Question 9 Multiple Answer (1 points)

Question: Which of the following is true of segmented memory, without paging?

It is subject to internal fragmentation
It is subject to external fragmentation
It is usually invisible to the programmer
Segments are required to be of different sizes
It provides a mechanism for dynamic linking
It provides a mechanism for dynamic relocation
Main memory is divided into frames of equal size

Question 10 Fill in the Blank (1 points)

Question: Given a paged memory system with page size 1024, the page number of logical address 4100 is

Question 11 Fill in the Blank (1 points)

Question: Given a paged memory system with page size 1024, the offset of logical address 4100 is

Question 12 Fill in the Blank (1 points)

Question: Given a paged memory system with page size 1024, if logical address 4100 maps to page frame 2, the physical address would be

Question 13 Multiple Choice (1 points)

Question: An algorithm that chooses which of the free regions of memory should be allocated to satisfy a given request is called a

relocation algorithm
loading algorithm
placement algorithm
replacement algorithm
garbage collection algorithm
dynamic partitioning algorithm

Question 14 Multiple Choice (1 points)

Question: In a multiprogramming system with dynamic partitioning, the algorithm that chooses which process to swap out of main memory to make room for a new process is called a

placement algorithm
replacement algorithm
garbage collection algorithm
fragmentation algorithm
relocation algorithm
memory configuration algorithm
partitioning algorithm

Question 15 Multiple Answer (1 points)

Question: Which of the following functions are served by a base register and a bounds register?

map logical to physical addresses
perform dynamic relocation
protect the memory of a process from other processes
map physical to logical addresses
perform dynamic linking
protect the kernel memory from processes

Question 16 Fill in the Blank (1 points)

Question: For a machine with 32-bit logical addresses and 1024-byte pages, the size in bits of the offset part of a logical address (expressed in decimal) is

Question 17 Fill in the Blank (1 points)

Question: In a paged memory system with 32-bit logical addresses, page size of 1 Kbytes (1 Kbyte = 1024 bytes), and page table enry size of two bytes, the page table for a process with 5280 Kbytes of memory would have how many entries?

Question 18 Fill in the Blank (1 points)

Question: In a paged memory system with 32-bit addresses and a page size of 1 Kbytes (1 Kbyte = 1024 bytes), assuming page table entries each occupy two bytes, a page table for a region of 2004 Kbytes would occupy how many Kbytes of memory?

Question 19 Multiple Answer (1 points)

Question: Which of the following is true of the Buddy System?

It is free from internal fragmentation
It is free from external fragmentation
It is a compromise between fixed and dynamic partitioning
Memory is divided up into blocks that are a power of two in size
It is used for process memory allocatio in virtual memory operating systems
Every block (free or allocated) has a unique buddy
It is used for kernel memory allocation in at least one modern operating system

Question 20 Multiple Answer (1 points)

Question: Which of the following is true of the first-fit algorithm, as applied to the allocation of memory to processes in a non-virtual memory OS with dynamic partitioning?

the largest block of free memory is quickly broken up into small fragments
it will search the entire list of free blocks
it is simplest, fastest, and usually the best
it may litter the front end of memory with small free partitions

Question 2		Multiple Choice	(1 points)
	Question:	Shifting the regions of memory allocated to processes, so that all the free memory forms one contiguous region.
		placement compaction external fragmentation internal fragmentation swapping coalescing

Question 3		Multiple Choice	(1 points)
	Question:	With this form of loading, a given load module must always be loaded into the same location in main memory.
		Absolute loading Relocatable loading Dynamic run-time loading

Question 4		Multiple Choice	(1 points)
	Question:	With a relocating loader, the time at which the absolute address of the entry point of a subprogram is bound is
		Programming time Compile or assembly time Load time Run time

Question 5		Multiple Choice	(1 points)
	Question:	Combining of multiple object modules into a load module is done by a
		Compiler or assembler Absolute loader Relocating loader Linker

Question 6		Multiple Choice	(1 points)
	Question:	With the Buddy System, the address of the buddy of the block of size 512 bytes with byte address 0111001010010000 would be
		0111001010110100 0111000101001000 0111001000010000 0111000010010000 0111001110010000

Question 7		Multiple Answer	(1 points)
	Question:	Which of the following is true of memory compaction, as applied to the allocation of memory to processes?
		It combats external fragmentation It combats internal fragmentation It takes time proportional to the size of the memory It requires hardware-supported dynamic relocation It is performed by the linker It is done every time a new process is brought into memory It is done periodically, when memory has become too fragmented

Question 8		Multiple Answer	(1 points)
	Question:	Which of the following are true of paging?
		It eliminates the problem of external fragmentation It eliminates the problem of internal fragmentation It enables the possibility of virtual memory It requires special hardware support Pages are kept in a page table A page table entry is requred for each page It provides the ability to do dynamic relocation

Question 9		Multiple Answer	(1 points)
	Question:	Which of the following is true of segmented memory, without paging?
		It is subject to internal fragmentation It is subject to external fragmentation It is usually invisible to the programmer Segments are required to be of different sizes It provides a mechanism for dynamic linking It provides a mechanism for dynamic relocation Main memory is divided into frames of equal size

Question 10		Fill in the Blank	(1 points)
	Question:	Given a paged memory system with page size 1024, the page number of logical address 4100 is

Question 11		Fill in the Blank	(1 points)
	Question:	Given a paged memory system with page size 1024, the offset of logical address 4100 is

Question 12		Fill in the Blank	(1 points)
	Question:	Given a paged memory system with page size 1024, if logical address 4100 maps to page frame 2, the physical address would be

Question 13		Multiple Choice	(1 points)
	Question:	An algorithm that chooses which of the free regions of memory should be allocated to satisfy a given request is called a
		relocation algorithm loading algorithm placement algorithm replacement algorithm garbage collection algorithm dynamic partitioning algorithm

Question 14		Multiple Choice	(1 points)
	Question:	In a multiprogramming system with dynamic partitioning, the algorithm that chooses which process to swap out of main memory to make room for a new process is called a
		placement algorithm replacement algorithm garbage collection algorithm fragmentation algorithm relocation algorithm memory configuration algorithm partitioning algorithm

Question 15		Multiple Answer	(1 points)
	Question:	Which of the following functions are served by a base register and a bounds register?
		map logical to physical addresses perform dynamic relocation protect the memory of a process from other processes map physical to logical addresses perform dynamic linking protect the kernel memory from processes

Question 16		Fill in the Blank	(1 points)
	Question:	For a machine with 32-bit logical addresses and 1024-byte pages, the size in bits of the offset part of a logical address (expressed in decimal) is

Question 17		Fill in the Blank	(1 points)
	Question:	In a paged memory system with 32-bit logical addresses, page size of 1 Kbytes (1 Kbyte = 1024 bytes), and page table enry size of two bytes, the page table for a process with 5280 Kbytes of memory would have how many entries?

Question 18		Fill in the Blank	(1 points)
	Question:	In a paged memory system with 32-bit addresses and a page size of 1 Kbytes (1 Kbyte = 1024 bytes), assuming page table entries each occupy two bytes, a page table for a region of 2004 Kbytes would occupy how many Kbytes of memory?

Question 19		Multiple Answer	(1 points)
	Question:	Which of the following is true of the Buddy System?
		It is free from internal fragmentation It is free from external fragmentation It is a compromise between fixed and dynamic partitioning Memory is divided up into blocks that are a power of two in size It is used for process memory allocatio in virtual memory operating systems Every block (free or allocated) has a unique buddy It is used for kernel memory allocation in at least one modern operating system

Question 20		Multiple Answer	(1 points)
	Question:	Which of the following is true of the first-fit algorithm, as applied to the allocation of memory to processes in a non-virtual memory OS with dynamic partitioning?
		the largest block of free memory is quickly broken up into small fragments it will search the entire list of free blocks it is simplest, fastest, and usually the best it may litter the front end of memory with small free partitions