Memory Management | Operating System

CoderIndeed
personCoderIndeed
May 05, 202223 minute read
0

  1. 1. CPU fetches the instruction from memory according to the value of ____________

    1. program counter
    2. status register
    3. instruction register
    4. program status word
    Show Answer
    Answer :     Option ( a )

  2. 2. A memory buffer used to accommodate a speed differential is called ____________

    1. stack pointer
    2. cache
    3. accumulator
    4. disk buffer
    Show Answer
    Answer :     Option ( b )

  3. 3. Which one of the following is the address generated by CPU?

    1. Physical address
    2. Absolute address
    3. Logical address
    4. Trial address
    Show Answer
    Answer :     Option ( c )

  4. 4. Run time mapping from virtual to physical address is done by ____________

    1. Memory management unit
    2. CPU
    3. Address translator
    4. ALU
    Show Answer
    Answer :     Option ( a )

  5. 5. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?

    1. Fragmentation
    2. Paging
    3. Mapping
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  6. 6. Program always deals with ___________

    1. logical address
    2. absolute address
    3. physical address
    4. relative address
    Show Answer
    Answer :     Option ( a )

  7. 7. The page table contains ____________

    1. base address of each page in physical memory
    2. page offset
    3. page size
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  8. 8. What is compaction?

    1. A technique for overcoming internal fragmentation
    2. A paging technique
    3. A technique for overcoming external fragmentation
    4. A technique for overcoming fatal error
    Show Answer
    Answer :     Option ( c )

  9. 9. Operating System maintains the page table for ____________

    1. each process
    2. each thread
    3. each instruction
    4. each address
    Show Answer
    Answer :     Option ( a )

  10. 10. The ___________ swaps processes in and out of the memory.

    1. Memory manager
    2. CPU
    3. HDD
    4. User
    Show Answer
    Answer :     Option ( a )

  11. 11. The address loaded into the memory address register of the memory is referred to as ____________

    1. physical address
    2. logical address
    3. neither physical nor logical
    4. Both A and B
    Show Answer
    Answer :     Option ( a )

  12. 12. The base register is also known as the ____________

    1. basic register
    2. regular register
    3. relocation register
    4. delocation register
    Show Answer
    Answer :     Option ( c )

  13. 13. Generally the size of a process is limited to the size of ____________

    1. physical memory
    2. external storage
    3. secondary storage
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  14. 14. The main memory accommodates ____________

    1. operating system
    2. CPU
    3. keyboard
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  15. 15. In contiguous memory allocation ____________

    1. each process is contained in a single contiguous section of memory
    2. all processes are contained in a single contiguous section of memory
    3. the memory space is contiguous
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  16. 16. With relocation and limit registers, each logical address must be _______ the limit register.

    1. less than
    2. equal to
    3. greater than
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  17. 17. When memory is divided into several fixed sized partitions, each partition may contain ________

    1. exactly one process
    2. at least one process
    3. multiple processes at once
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  18. 18. In fixed size partition, the degree of multiprogramming is bounded by ___________

    1. the CPU utilization
    2. the memory size
    3. the number of partitions
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )

  19. 19. The first fit, best fit and worst fit are strategies to select a ______

    1. process from a queue to put in memory
    2. free hole from a set of available holes
    3. processor to run the next process
    4. All of the mentioned
    Show Answer
    Answer :     Option ( b )

  20. 20. A solution to the problem of external fragmentation is ____________

    1. larger memory space
    2. smaller memory space
    3. compaction
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )

  21. 21. __________ is generally faster than _________ and _________

    1. First fit, best fit, worst fit
    2. Best fit, first fit, worst fit
    3. Worst fit, best fit, first fit
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  22. 22. External fragmentation exists when?

    1. The total memory is insufficient to satisfy a request
    2. Enough total memory exists to satisfy a request but it is not contiguous
    3. A request cannot be satisfied even when the total memory is free
    4. None of the mentionedd
    Show Answer
    Answer :     Option ( b )

  23. 23. External fragmentation will not occur when?

    1. First fit is used
    2. Best fit is used
    3. Worst fit is used
    4. No matter which algorithm is used, it will always occur
    Show Answer
    Answer :     Option ( d )

  24. 24. Physical memory is broken into fixed-sized blocks called ________

    1. frames
    2. pages
    3. sectors
    4. files
    Show Answer
    Answer :     Option ( a )

  25. 25. Logical memory is broken into blocks of the same size called _________

    1. frames
    2. pages
    3. sectors
    4. files
    Show Answer
    Answer :     Option ( b )

  26. 26. Every address generated by the CPU is divided into two parts. They are ____________

    1. frame bit & page number
    2. page number & page offset
    3. page offset & frame bit
    4. frame offset & page offset
    Show Answer
    Answer :     Option ( b )

  27. 27. The __________ is used as an index into the page table.

    1. frame bit
    2. page number
    3. page offset
    4. frame offset
    Show Answer
    Answer :     Option ( b )

  28. 28. The _____ table contains the base address of each page in physical memory.

    1. process
    2. memory
    3. page
    4. frame
    Show Answer
    Answer :     Option ( c )

  29. 29. With paging there is no ________ fragmentation.

    1. internal
    2. external
    3. either type of
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  30. 30. 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.

    1. page
    2. mapping
    3. frame
    4. memory
    Show Answer
    Answer :     Option ( c )

  31. 31. Paging increases the ______ time.

    1. waiting
    2. execution
    3. context – switch
    4. All of the mentioned
    Show Answer
    Answer :     Option ( c )

  32. 32. For every process there is a __________

    1. page table
    2. copy of page table
    3. pointer to page table
    4. All of the mentioned
    Show Answer
    Answer :     Option ( a )

  33. 33. If a page number is not found in the TLB, then it is known as a ____________

    1. TLB miss
    2. Buffer miss
    3. TLB hit
    4. All of the mentioned
    Show Answer
    Answer :     Option ( a )

  34. 34. Each entry in a translation lookaside buffer (TLB) consists of ____________

    1. key
    2. value
    3. bit value
    4. constant
    Show Answer
    Answer :     Option ( a )

  35. 35. The percentage of times a page number is found in the TLB is known as ____________

    1. miss ratio
    2. hit ratio
    3. miss percent
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  36. 36. When there is a large logical address space, the best way of paging would be ____________

    1. not to page
    2. a two level paging algorithm
    3. the page table itself
    4. All of the mentioned
    Show Answer
    Answer :     Option ( b )

  37. 37. In segmentation, each address is specified by ____________

    1. a segment number & offset
    2. an offset & value
    3. a value & segment number
    4. a key & value
    Show Answer
    Answer :     Option ( a )

  38. 38. In paging the user provides only ________ which is partitioned by the hardware into ________ and ______

    1. one address, page number, offset
    2. one offset, page number, address
    3. page number, offset, address
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  39. 39. The segment base contains the ____________

    1. starting logical address of the process
    2. starting physical address of the segment in memory
    3. segment length
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  40. 40. The segment limit contains the ____________

    1. starting logical address of the process
    2. starting physical address of the segment in memory
    3. segment length
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )

  41. 41. The offset ‘d’ of the logical address must be ____________

    1. greater than segment limit
    2. between 0 and segment limit
    3. between 0 and the segment number
    4. greater than the segment number
    Show Answer
    Answer :     Option ( b )

  42. 42. The protection bit is 0/1 based on ____________

    1. write only
    2. read only
    3. read – write
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )

  43. 43. RAM stands for _________

    1. random always memory
    2. rarely access memory
    3. read access memory
    4. random access memory
    Show Answer
    Answer :     Option ( d )

  44. 44. ROM stands for ____________

    1. Random Only Memory
    2. Read Only Memory
    3. Read Own Memory
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  45. 45. RAM is ______________ memory

    1. volatile
    2. non volatile
    3. Both A and B
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  46. 46. ROM is ______________ memory

    1. volatile
    2. non volatile
    3. Both A and B
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  47. 47. Full form of BIOS is ___________

    1. Best Input Output System
    2. Best Input Output Star
    3. Basic Input Output Star
    4. Basic Input Output System
    Show Answer
    Answer :     Option ( d )

  48. 48. Erasable Programmable Read-Only Memory (EPROM), is a special type of PROM that can be erased by exposing it to __________

    1. ultraviolet light
    2. sun light
    3. electrical charge
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  49. 49. Electrically Erasable Programmable Read-Only Memory (EEPROM), is a special type of PROM that can be erased by exposing it to an ______________

    1. ultraviolet light
    2. sun light
    3. electrical charge
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )

  50. 50. Which type of memory is fastest?

    1. RAM
    2. Cache memory
    3. ROM
    4. HDD
    Show Answer
    Answer :     Option ( b )

  51. 51. Which type of memory is fastest?

    1. RAM
    2. Cache memory
    3. ROM
    4. Register
    Show Answer
    Answer :     Option ( d )

  52. 52. __________starts from the starting location of the memory and first available hole that is large enough to hold the process is selected for allocation.

    1. First fit
    2. Best fit
    3. Next fit
    4. Worst fit
    Show Answer
    Answer :     Option ( a )

  53. 53. ______________ memory allocation method avoids memory allocation always from the beginning of the memory space.

    1. First fit
    2. Best fit
    3. Next fit
    4. Worst fit
    Show Answer
    Answer :     Option ( c )

  54. 54. In which memory allocation method entire memory is searched and the smallest hole, which is large enough to hold the process, is selected for allocation.

    1. First fit
    2. Best fit
    3. Next fit
    4. Worst fit
    Show Answer
    Answer :     Option ( b )

  55. 55. Memory loss is less in ___________ memory allocation method

    1. first fit
    2. best fit
    3. next fit
    4. worst fit
    Show Answer
    Answer :     Option ( b )

  56. 56. In which memory allocation method entire memory is searched and the largest hole, which is largest enough to hold the process, is selected for allocation.

    1. First fit
    2. Best fit
    3. Next fit
    4. Worst fit
    Show Answer
    Answer :     Option ( d )

  57. 57. The set of pages that a process is currently using is known as _________

    1. working set
    2. current set
    3. using set
    4. None of the mentioned
    Show Answer
    Answer :     Option ( a )

  58. 58. Full form of TLB is _________

    1. Transfer Lookaside Buffer
    2. Translation Lookinside Buffer
    3. Translation Lookaside Buffer
    4. None of the mentioned
    Show Answer
    Answer :     Option ( c )

  59. 59. In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?

    1. Oldest page
    2. Newest page
    3. Frequently occurred page in the future
    4. Not frequently occurred page in the future
    Show Answer
    Answer :     Option ( d )

  60. 60. Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 3. Calculate the number of page faults using optimal page replacement algorithm.

    1. 10
    2. 9
    3. 8
    4. 7
    Show Answer
    Answer :     Option ( b )

  61. 61. Consider a reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 4. Calculate the number of page faults using optimal page replacement algorithm.

    1. 7
    2. 9
    3. 8
    4. 6
    Show Answer
    Answer :     Option ( c )

  62. 62. Consider a reference string 1,2,3,2,1,5,2,1,6,2,5,6,3,1,3,6,1,2,4,3 of frame size 3. Calculate the number of page faults using optimal page replacement algorithm.

    1. 12
    2. 16
    3. 14
    4. 15
    Show Answer
    Answer :     Option ( c )

  63. 63. In a FIFO algorithm, when a page is to be replaced, which of the following page is chosen?

    1. Oldest page
    2. Newest page
    3. Frequently occurred page in the future
    4. Not frequently occurred page in the future
    Show Answer
    Answer :     Option ( a )

  64. 64. Consider a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 3. Using FIFO algorithm, determine the number of page faults.

    1. 12
    2. 16
    3. 14
    4. 15
    Show Answer
    Answer :     Option ( d )

  65. 65. Consider a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 of frame size 4. Using FIFO algorithm, determine the number of page faults.

    1. 12
    2. 16
    3. 10
    4. 14
    Show Answer
    Answer :     Option ( c )

  66. 66. A page fault occurs

    1. when the page is not in the memory
    2. when the page is in the memory
    3. when the process enters the blocked state
    4. when the process is in the ready state
    Show Answer
    Answer :     Option ( a )

  67. 67. Reference bit is used for

    1. implementing LRU page replacement algorithm
    2. implementing NRU algorithm
    3. implementing optimal algorithm
    4. All of the mentioned
    Show Answer
    Answer :     Option ( b )

  68. 68. The LRU algorithm ______

    1. pages out pages that have been used recently
    2. pages out pages that have not been used recently
    3. pages out pages that have been least used recently
    4. pages out the first page in a given area
    Show Answer
    Answer :     Option ( c )

  69. 69. Operating system supports different page replacement policy. From the given below option which is not a valid page replacement policy?

    1. Least Recently Used
    2. First in first out
    3. Round robin
    4. Optimal page replacement policy
    Show Answer
    Answer :     Option ( c )

  70. 70. In which of the following page replacement policies Belady’s anomaly occurs?

    1. Most recently used
    2. LRU
    3. FIFO
    4. Optimal page replacement policy
    Show Answer
    Answer :     Option ( c )

  71. 71. The optimal page replacement algorithm will select the page that

    1. has been used least number of times
    2. has been used most number of times
    3. has been used for the longest time in the past
    4. will not be used for the longest time in future
    Show Answer
    Answer :     Option ( d )

  72. 72. We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1 How many page faults will occur for the above reference string with the Least Recently Used(LRU) Page Replacement Policy in comparison to an Optimal Page Replacement policy?

    1. 3
    2. 2
    3. 1
    4. 0
    Show Answer
    Answer :     Option ( b )

  73. 73. We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1. If Optimal Page Replacement policy is used, _______ page faults will occur for the above reference string.

    1. 7
    2. 8
    3. 9
    4. 6
    Show Answer
    Answer :     Option ( a )

  74. 74. ‘LRU’ page replacement policy is

    1. Last Replaced Unit
    2. Last Restored Unit
    3. Least Recently Used
    4. Least Required Unit
    Show Answer
    Answer :     Option ( c )

  75. 75. Which amongst the following is not a valid page replacement policy ?

    1. LRU policy (Least Recently Used)
    2. FIFO policy (First in first out)
    3. RU policy (Recurrently used)
    4. Optimal page replacement policy
    Show Answer
    Answer :     Option ( c )

  76. 76. Virtual memory uses disk space as an extension of _________

    1. secondary storage
    2. main memory
    3. tertiary storage
    4. None of the mentioned
    Show Answer
    Answer :     Option ( b )

  77. 77. 1byte=____ bits

    1. 2
    2. 4
    3. 8
    4. 10
    Show Answer
    Answer :     Option ( c )

  78. 78. GB stans for

    1. Gigabyte
    2. Gigabit
    3. Greaterbyte
    4. Gbyte
    Show Answer
    Answer :     Option ( a )

  79. 79. 1 KB = __________ Bytes

    1. 8
    2. 1000
    3. 1024
    4. 256
    Show Answer
    Answer :     Option ( c )

  80. 80. What is bigger GigaByte (GB), TeraByte (TB), Kilobyte (KB), Megabyte (MB)?

    1. Kilobyte (KB)
    2. GigaByte (GB)
    3. Megabyte (MB)
    4. TeraByte (TB)
    Show Answer
    Answer :     Option ( d )

  81. 81. The computer is beeping constantly after you’ve booted it. What’s a likely problem?

    1. CPU
    2. HDD
    3. RAM
    4. Power Supply
    Show Answer
    Answer :     Option ( c )

  82. 82. Which of the following components is read-only?

    1. RAM
    2. ROM
    3. HDD
    4. File
    Show Answer
    Answer :     Option ( b )

  83. 83. What are programs stored on ROM chips called?

    1. Applications
    2. Drivers
    3. Firmware
    4. Software
    Show Answer
    Answer :     Option ( c )

  84. 84. When the user loads a program, where is it copied before it is run?

    1. BIOS
    2. Hard Drive
    3. RAM
    4. ROM
    Show Answer
    Answer :     Option ( c )

  85. 85. What unit is used to measure the capacity of RAM?

    1. Hertz
    2. Meg
    3. Byte
    4. Cycle
    Show Answer
    Answer :     Option ( c )
Tags

You May Like

Show more

Post a Comment

0Comments

Post a Comment (0)

#buttons=(Accept !) #days=(20)

Our website uses cookies to enhance your experience. Check Now
Accept !
Share to other apps
Copy Post Link