51. |
Which type of memory is fastest?
|
||||||||
Answer:
Option (d) |
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.
|
||||||||
Answer:
Option (a) |
53. |
______________ memory allocation method avoids memory allocation always from the beginning of the memory space.
|
||||||||
Answer:
Option (c) |
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.
|
||||||||
Answer:
Option (b) |
55. |
Memory loss is less in ___________ memory allocation method
|
||||||||
Answer:
Option (b) |
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.
|
||||||||
Answer:
Option (d) |
57. |
The set of pages that a process is currently using is known as _________
|
||||||||
Answer:
Option (a) |
58. |
Full form of TLB is _________
|
||||||||
Answer:
Option (c) |
59. |
In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?
|
||||||||
Answer:
Option (d) |
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.
|
||||||||
Answer:
Option (b) |