Memory Management Pre-Quiz Flashcards
Systems in which memory access times vary significantly are known as __________.
Select one:
a. memory-mapped I/O
b. demand-paged memory
c. non-uniform memory access
d. copy-on-write memory
C- NON UNIFORM MEMORY ACCESS
An address generated by a CPU is referred to as a ____.
Select one:
a. physical address
b. logical address
c. post relocation register address
d. memory management unit (MMU) generated address
B- LOGICAL ADDRESS
_____ is the dynamic storage allocation algorithm that results in the smallest leftover hole in memory.
Select one:
a. First-fit
b. Best-fit
c. Worst-fit
d. None of the above
B- BEST FIT
_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems.
Select one:
a. Interrupt binding
b. Compile time binding
c. Execution time binding
d. Load time binding
C- EXECUTION TIME BINDING
_____ is the dynamic storage allocation algorithm that results in the largest leftover hole in memory.
Select one:
a. First-fit
b. Best-fit
c. Worst-fit
d. None of the above
C- WORST FIT
Optimal page replacement ____.
Select one:
a. is the page replacement algorithm most often implemented
b. is used mostly for comparison with other page replacement schemes
c. can suffer from Belady’s anomaly
d. requires that the system keep track of previously used pages
B- IS USED MOSTLY FOR COMPARISON WITH OTHER PAGE REPLACEMENT SCHEMES
What size segment will be allocated for a 39 KB request on a system using the buddy system for kernel memory allocation?
Select one:
a. 39 KB
b. 42 KB
c. 64 KB
d. none of the above
C- 64 Kb
Which of the following data structures is appropriate for placing into its own segment?
Select one:
a. heap
b. kernel code and data
c. user code and data
d. all of the above
D- ALL OF THE ABOVE
Which of the following statements is true with respect to hashed page tables?
Select one:
a. They only work for sparse address spaces.
b. The virtual address is used to hash into the hash table.
c. They are a common approach for handling address spaces larger than 32 bits.
d. Hash table collisions do not occur because of the importance of paging.
C- THEY ARE A COMMON APPROACH FOR HANDLING ADDRESS SPACES LARGER THAN 32 BITS
The ____ is the number of entries in the TLB multiplied by the page size.
Select one:
a. TLB cache
b. page resolution
c. TLB reach
d. hit ratio
C- TLB REACH
A(n) ____ page table has one page entry for each real page (or frame) of memory.
Select one:
a. inverted
b. clustered
c. forward-mapped
d. virtual
A- INVERTED
Belady’s anomaly states that ____.
Select one:
a. giving more memory to a process will improve its performance
b. as the number of allocated frames increases, the page fault rate may decrease for all page replacement algorithms
c. for some page replacement algorithms, the page fault rate may decrease as the number of allocated frames increases
d. for some page replacement algorithms, the page fault rate may increase as the number of allocated frames increases
D- FOR SOME PAGE REPLACEMENT ALGORITHMS, THE PAGE FAULT RATE MAY INCREASE AS THE NUMBER OF ALLOCATED FRAMES INCREASES
With segmentation, a logical address consists of _____.
Select one:
a. segment number and offset
b. segment name and offset
c. segment number and page number
d. segment table and segment number
A- SEGMENT NUMBER AND OFFSET
In systems that support virtual memory, ____.
Select one:
a. virtual memory is separated from logical memory
b. virtual memory is separated from physical memory
c. physical memory is separated from secondary storage
d. physical memory is separated from logical memory
D- PHYSICAL MEMORY IS SEPARATED FROM LOGICAL MEMORY
_____ occurs when a process spends more time paging than executing.
Select one:
a. Thrashing
b. Memory mapping
c. Demand paging
d. Swapping
A- THRASHING
