Karteikarten
SCIA 360 Chapter 3
Karten in diesem Stapel (20)
- 1The optimal selection of cache size and replacement algorithm can result in 80 to 90 percent of all requests being in the cache. a. True b. Falsea. True
- 2The primary advantage of storing programs in noncontiguous locations is that ____. a. multiple programs can run at the same time b. every program will be able to run c. secondary storage is accessed more quickly d. main memory is used more efficientlyd. main memory is used more efficiently
- 3In a paged memory allocation scheme, the ____ contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored. a.Memory Management Table b. Job Table c. Page Access Table d. Memory Map Tableb. Job Table
- 4In a paged memory allocation scheme, a simple ____ has one entry for each page frame that shows its location and its free/busy status. a. Memory Management Table b. Job Table c. Page Access Table d. Memory Map Tabled. Memory Map Table
- 5In a paged memory allocation scheme, a page size that is too small will generate ____. a. very long Page Map Tables b. excessive internal fragmentation c. excessive page faults d. excessive external fragmentationa. very long Page Map Tables
- 6In demand paging, pages are ____ between main memory and secondary storage. a. swapped b. traded c. allocated d. faulteda. swapped
- 7In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ____. a. swapping b. faulting c. paging d. thrashingd. thrashing
- 8The ____ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest. a. TRU b. LRU c. LIFO d. FIFOd. FIFO
- 9The ____ demonstrates that when using a FIFO policy, in rare cases, adding more memory to a system can cause an increase in page interrupts. a. Paging Anomaly b. Belady Anomaly c. Interrupt Anomaly d. Laszlo Anomalyb. Belady Anomaly
- 10A variation of the LRU page replacement algorithm known as the ____ replacement policy is implemented with a circular queue. a. clock page b. round robin c. performance page d. bit shiftinga. clock page
- 11In demand paging schemes, the ____ in a Page Map Table indicates whether the page is currently in memory. a. referenced bit b. modified bit c. memory bit d. status bitd. status bit
- 12In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____. a. page set b. working set c. job set d. denning setb. working set
- 13The term “____” means that during any phase of its execution, a program references only a small fraction of its pages. a. dynamic paging b. structured programming c. locality of reference d. working setc. locality of reference
- 14With segmented memory allocation, each job is divided into several ____ of different sizes, one for each module that contains pieces that perform related functions. a. pages b. modules c. segments d. partitionsc. segments
- 15To access a location in memory when using segmented memory management, the address is composed of two entries: ____. a. the segment number and the line number b. the segment number and the displacement c. the line number and the displacement d. the segment number, the line number, and the displacementb. the segment number and the displacement
- 16A disadvantage of segmented memory allocation is ____. a. the physical size requirements of main memory b. the number of page faults c. internal fragmentation d. external fragmentationd. external fragmentation
- 17____ effectively removes restrictions on maximum program size. a. Segmenting b. Virtual memory c. Shared memory d. Multithreadingb. Virtual memory
- 18____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU. a. Virtual memory b. Cache memory c. Paging d. Segmentingb. Cache memory
- 19The purpose of cache memory is to keep handy the most recently accessed data and instructions so that the CPU can access them repeatedly without wasting time. This purpose is similar to that of the ____ of a Web browser. a. cache file b. bookmark file c. page file d. block fileb. bookmark file
- 20Cache memory is divided into blocks of equal size called ____. a. slots b. pages c. segments d. partitionsa. slots