1. CPU fetches the instruction from memory according to the value of a) program counter b) status register c) instruction register d) program status word 2. A memory buffer used to accommodate a speed differential is called__ _ a) stack pointer b) cache c) accumulator d) disk buffer 3. Which one of the following is the address generated by CPU? a) physical address b) absolute address c) logical address d) none of the mentioned4. Run time mapping from virtual to physical address is done by a) Memory management unit b) CPU c) PCI d) None of the mentioned 5. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called? a) fragmentation b) paging c) mapping d) none of the mentioned 6. 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7. Program always deals with b) absolute address c) physical address d) relative address 8. The page table’ contains a) base address of each page in physical memory b) page offset c) page size d) none of the mentioned 9. 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 10. Operating System maintains the page table for 2a a) each process b) each thread c) each instruction d) each address1. What is Address Binding? a) going to an address in memory b) locating an address with the help of another address c) binding two addresses together to form a new address in a different memory space d) a mapping from one address space to another 2. Binding of instructions and data to memory addresses can be done at a) Compile time b) Load time c) Execution time d) All of the mentioned 1. The main memory accommodates a) operating system b) cpu c) user processes d) all of the mentioned2. 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 3. 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 4. 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5. With relocation and limit registers, each logical address must be the limit register. a) less than b) equal to c) greater than d) none of the mentioned 9. When memory is divided into several fixed sized partitions, each partition may contain_____ a) exactly one process b) at least one process c) multiple processes at once d) none of the mentioned 10. 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1. 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 2. A solution to the problem of external fragmentation is a) compaction b) larger memory space c) smaller memory space d) none of the mentioned 3. 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7. External fragmentation exists when? a) enough total memory exists to satisfy a request but it is not contiguous b) the total memory is insufficient to satisfy a request c) a request cannot be satisfied even when the total memory is free d) none of the mentioned 8. 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 10. 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1. Physical memory is broken into fixed-sized blocks called a) frames b) pages c) backing store d) none of the mentioned 2. Logical memory is broken into blocks of the same size called a) frames b) pages c) backing store d) none of the mentioned 3. 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 4. The _____ is used as an index into the page table. a) frame bit b) page number c) page offset d) frame offset5. The _____ table contains the base address of each page in physical memory. a) process b) memory c) page d) frame 6. The size of a page is typically a) varied b) power of 2 c) power of 4 d) none of the mentioned 8. With paging there is no _______ fragmentation. a) internal b) external c) either type of d) none of the mentioned9. The operating system maintains a ___ table that keeps track of how many frames have been allocated, how many are there, and how many are available. a) page b) mapping c) frame d) memory 14. For every process there is a a) page tat table b) copy of page table c) pointer to page table d) all of the mentioned 13. For larger page tables, they are kept in main memory and a __ points to the page table. a) page table base register b) page table base pointer c) page table register pointer d) page table base15. Time taken in memory access through PTBRis______ a) extended by a factor of 3 b) extended by a factor of 2 c) slowed by a factor of 3 d) slowed by a factor of 2 1. In segmentation, each address is specified by__- _ a) a segment number & offset b) an offset & value c) a value & segment number d) a key & value 2. In paging the user provides only ——--—-- which is partitioned by the hardware into _______ and a) one address, page number, offset b) one offset, page number, address c) page number, offset, address d) none of the mentioned 3. Each entry in a segment table has a a) segment base b) segment peak c) segment value d) none of the mentioned4. The segment base contains the a) starting logical address of the process b) starting physical address of the segment in memory c) segment length d) none of the mentioned 5. The segment limit contains the a) starting logical address of the process b) starting physical address of the segment in memory c) segment length d) none of the mentioned 6. The offset ‘d’ of the logical address a) greater than segment limit b) between 0 and segment limit c) between O and the segment number d) greater than the segment number8. When the entries in the segment tables of two different processes point to the same physical location a) the segments are invalid b) the processes get blocked c) segments are shared d) all of the mentioned