COIS 3620H - Chapter 3

1. 1The primary advantage of storing programs in noncontiguous page frames (in a paged memory allocation scheme) is that main memory is used more efficiently because an empty page frame can be used by any page of any job.

   1. ATrue
   2. BFalse
2. 2Paged memory allocation offers the advantage that it doesn’t require the entire job to be stored in memory during its execution.

   1. ATrue
   2. BFalse
3. 3The Job Table (JT) contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.

   1. ATrue
   2. BFalse
4. 4In a paged memory allocation scheme, to find the actual position of an instruction in memory, first the page number and displacement are determined. Then the operating system refers to the job’s PMT to correlate the page with its page frame.

   1. ATrue
   2. BFalse
5. 5Demand paging introduced the concept of loading only a part of the program into memory for processing

   1. ATrue
   2. BFalse
6. 6The key to the successful implementation of demand paging is the use of a high-speed CPU

   1. ATrue
   2. BFalse
7. 7With demand paging, three additional fields are introduced for each page in each PMT: one to determine if the page being requested is already in memory, a second to determine if the page contents have been modified while in memory, and a third to determine if the page has been referenced most recently.

   1. ATrue
   2. BFalse
8. 8With demand paging, if there are no empty page frames available, to move in a new page, one of the current resident pages must be placed into main memory

   1. ATrue
   2. BFalse
9. 9Thrashing is a problem that occurs when there are a large number of jobs and many free pages so that pages are being moved around too much.

   1. ATrue
   2. BFalse
10. 10In a demand paging scheme, the first-in first-out (FIFO) page replacement policy chooses the page least recently accessed to be swapped out

    1. ATrue
    2. BFalse

11. 11When using a FIFO scheme, adding more memory always results in better performance.

    1. ATrue
    2. BFalse
12. 12A variation of the LRU page replacement algorithm known as the clock page replacement policy is implemented using a pointer to step through the reference bits of the active pages, simulating a clockwise motion.

    1. ATrue
    2. BFalse
13. 13In the bit-shifting variation of the LRU page replacement policy, the process of shifting bits to the right and resetting the leftmost bit to 1 when a page is referenced gives a history of each page’s usage

    1. ATrue
    2. BFalse
14. 14A job’s working set is the collection of pages that must be loaded from secondary storage.

    1. ATrue
    2. BFalse
15. 15With segmented memory allocation, each job is divided into several segments of the same size, one for each module containing pieces that perform related functions

    1. ATrue
    2. BFalse
16. 16The segmented/demand paged memory allocation scheme is a combination of segmentation and demand paging, and it offers the logical benefits of segmentation, as well as the physical benefits of paging.
    

    1. ATrue
    2. BFalse
17. 17Associative memory is a name given to several hardware registers that are allocated to each active job whose task is to associate segment and page numbers belonging to the job being processed with their main memory addresses.

    1. ATrue
    2. BFalse
18. 18Virtual memory can be implemented with both paging and segmentation.

    1. ATrue
    2. BFalse
19. 19Cache memory is based on the concept of using a large, fast, and expensive memory to supplement the workings of main memory.

    1. ATrue
    2. BFalse
20. 20The optimal selection of cache size and replacement algorithm can result in 80 to 90 percent of all requests being in the cache.

    1. ATrue
    2. BFalse
21. 21The primary advantage of storing programs in noncontiguous locations is that ____.

    1. Amultiple programs can run at the same time
    2. Bevery program will be able to run
    3. Csecondary storage is accessed more quickly
    4. Dmain memory is used more efficiently
22. 22In 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.

    1. AMemory Management Table
    2. BJob Table
    3. CPage Access Table
    4. DMemory Map Table
23. 23In a paged memory allocation scheme, a simple ____ has one entry for each page frame that shows its location and its free/busy status.

    1. AMemory Management Table
    2. BJob Table
    3. CPage Access Table
    4. DMemory Map Table
24. 24In a paged memory allocation scheme, a page size that is too small will generate ____.

    1. Avery long Page Map Tables
    2. Bexcessive internal fragmentation
    3. Cexcessive page faults
    4. Dexcessive external fragmentation
25. 25One of the most important innovations of demand paging is that it makes ____ feasible.

    1. Aparallel memory
    2. Bautomatic allocation
    3. Cspontaneous allocation
    4. Dvirtual memory
26. 26In demand paging, pages are ____ between main memory and secondary storage

    1. Aswapped
    2. Btraded
    3. Callocated
    4. Dfaulted
27. 27In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ____.

    1. Aswapping
    2. Bfaulting
    3. Cpaging
    4. Dthrashing
28. 28The ____ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest.

    1. ATRU
    2. BLRU
    3. CLIFO
    4. DFIFO
29. 29The ____ demonstrates that when using a FIFO policy, in rare cases, adding more memory to a system can cause an increase in page interrupts.

    1. APaging Anomaly
    2. BBelady Anomaly
    3. CInterrupt Anomaly
    4. DLaszlo Anomaly
30. 30A variation of the LRU page replacement algorithm known as the ____ replacement policy is implemented with a circular queue.

    1. Aclock page
    2. Bround robin
    3. Cperformance page
    4. Dbit shifting
31. 31In demand paging schemes, the ____ in a Page Map Table indicates whether the page is currently in memory.

    1. Areferenced bit
    2. Bmodified bit
    3. Cmemory bit
    4. Dstatus bit
32. 32In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____.

    1. Apage set
    2. Bworking set
    3. Cjob set
    4. Ddenning set
33. 33The term “____” means that during any phase of its execution, a program references only a small fraction of its pages.

    1. Adynamic paging
    2. Bstructured programming
    3. Clocality of reference
    4. Dworking set
34. 34With segmented memory allocation, each job is divided into several ____ of different sizes, one for each module that contains pieces that perform related functions.

    1. Apages
    2. Bmodules
    3. Csegments
    4. Dpartitions
35. 35To access a location in memory when using segmented memory management, the address is composed of two entries: ____.

    1. Athe segment number and the line number
    2. Bthe segment number and the displacement
    3. Cthe line number and the displacement
    4. Dthe segment number, the line number, and the displacement
36. 36A disadvantage of segmented memory allocation is ____.

    1. Athe physical size requirements of main memory
    2. Bthe number of page faults
    3. Cinternal fragmentation
    4. Dexternal fragmentation
37. 37____ effectively removes restrictions on maximum program size.

    1. ASegmenting
    2. BVirtual memory
    3. CShared memory
    4. DMultithreading
38. 38____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.

    1. AVirtual memory
    2. BCache memory
    3. CPaging
    4. DSegmenting
39. 39The 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.

    1. Acache file
    2. Bbookmark file
    3. Cpage file
    4. Dblock file
40. 40Cache memory is divided into blocks of equal size called ____.

    1. Aslots
    2. Bpages
    3. Csegments
    4. Dpartitions

Description

Computer Science Quiz on COIS 3620H - Chapter 3, created by Jareed Brown on 20/10/2017.

Author

Jareed Brown

Language

English

Views

6

Tags

computer science

Rating

No ratings yet

Rate this quiz

Rate this quiz

More on Memory Management