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
Answer: d
Explanation: None.
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
Answer: d
Explanation: None.
3. If the process can be moved during its execution from one memory segment to another, then binding must be ____________
a) delayed until run time
b) preponed to compile time
c) preponed to load time
d) none of the mentioned
Answer: a
Explanation: None.
4. What is Dynamic loading?
a) loading multiple routines dynamically
b) loading a routine only when it is called
c) loading multiple routines randomly
d) none of the mentioned
Answer: b
Explanation: None.
5. What is the advantage of dynamic loading?
a) A used routine is used multiple times
b) An unused routine is never loaded
c) CPU utilization increases
d) All of the mentioned
Answer: b
Explanation: None.
6. The idea of overlays is to ____________
a) data that are needed at any given time
b) enable a process to be larger than the amount of memory allocated to it
c) keep in memory only those instructions
d) all of the mentioned
Answer: d
Explanation: None.
7. The ___________ must design and program the overlay structure.
a) programmer
b) system architect
c) system designer
d) none of the mentioned
Answer: a
Explanation: None.
8. The ___________ swaps processes in and out of the memory.
a) Memory manager
b) CPU
c) CPU manager
d) User
Answer: a
Explanation: None.
9. If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
a) priority swapping
b) pull out, push in
c) roll out, roll in
d) none of the mentioned
Answer: c
Explanation: None.
10. If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again.
a) can
b) must
c) can never
d) may
Answer: c
Explanation: None.
11. In a system that does not support swapping ____________
a) the compiler normally binds symbolic addresses (variables) to relocatable addresses
b) the compiler normally binds symbolic addresses to physical addresses
c) the loader binds relocatable addresses to physical addresses
d) binding of symbolic addresses to physical addresses normally takes place during execution
Answer: a
Explanation: None.
12. Which of the following is TRUE?
a) Overlays are used to increase the size of physical memory
b) Overlays are used to increase the logical address space
c) When overlays are used, the size of a process is not limited to the size of the physical memory
d) Overlays are used whenever the physical address space is smaller than the logical address space
Answer: c
Explanation: None.
13. The address generated by the CPU is referred to as ____________
a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
Answer: b
Explanation: None.
14. The address loaded into the memory address register of the memory is referred to as ____________
a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
Answer: a
Explanation: None.
15. The run time mapping from virtual to physical addresses is done by a hardware device called the ____________
a) Virtual to physical mapper
b) Memory management unit
c) Memory mapping unit
d) None of the mentioned
Answer: b
Explanation: None.
16. The base register is also known as the ____________
a) basic register
b) regular register
c) relocation register
d) delocation register
Answer: c
Explanation: None.
17. The size of a process is limited to the size of ____________
a) physical memory
b) external storage
c) secondary storage
d) none of the mentioned
Answer: a
Explanation: None.
18. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word
Answer: a
Explanation: None.
19. A memory buffer used to accommodate a speed differential is called ____________
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Answer: b
Explanation: None.
20. 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
Answer: c
Explanation: None.
21. Run time mapping from virtual to physical address is done by ____________
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
Answer: a
Explanation: None.
22. 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
Answer: b
Explanation: None.
23. The main memory accommodates ____________
a) operating system
b) cpu
c) user processes
d) all of the mentioned
Answer: a
Explanation: None.
24. 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
Answer: c
Explanation: None.
25. 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
Answer: a
Explanation: None.
26. 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
Answer: c
Explanation: None.
27. 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
Answer: a
Explanation: None.
28. 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
Answer: b
Explanation: None.
29. A solution to the problem of external fragmentation is ____________
a) compaction
b) larger memory space
c) smaller memory space
d) none of the mentioned
Answer: a
Explanation: None.
30. 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
Answer: a
Explanation: None.
31. If relocation is static and is done at assembly or load time, compaction _________
a) cannot be done
b) must be done
c) must not be done
d) can be done
Answer: a
Explanation: None.
32. The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is ____________
a) the cost incurred
b) the memory used
c) the CPU used
d) all of the mentioned
Answer: a
Explanation: None.
33. Which of the following page replacement algorithms suffers from Belady’s Anomaly?
a) Optimal replacement
b) LRU
c) FIFO
d) Both optimal replacement and FIFO
Answer: c
Explanation: None.
34. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is?
a) 8
b) 10
c) 9
d) 7
Answer: c
Explanation: None.
35. In question 2, if the number of page frames is increased to 4, then the number of page transfers ____________
a) decreases
b) increases
c) remains the same
d) none of the mentioned
Answer: b
Explanation: None.
36. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________
a) LRU
b) LFU
c) FIFO
d) None of the mentioned
View Answer
Answer: c
Explanation: None.
37. A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements.
P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate
Q : Some programs do not exhibit locality of reference
Which of the following is TRUE?
a) Both P and Q are true, and Q is the reason for P
b) Both P and Q are true, but Q is not the reason for P
c) P is false but Q is true
d) Both P and Q are false
Answer: c
Explanation: None.
38. When using counters to implement LRU, we replace the page with the ____________
a) smallest time value
b) largest time value
c) greatest size
d) none of the mentioned
Answer: a
Explanation: Whenever a reference to a page is made, the contents of the clock register are copied into the time-of-use field in the page-table entry for that page. In this way, we always have the time of the last reference to each page.
39. In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________
a) whenever a page is used, it is removed from the stack and put on bottom
b) the bottom of the stack is the LRU page
c) the top of the stack contains the LRU page and all new pages are added to the top
d) none of the mentioned
Answer: b
Explanation: None.
40. There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________
a) queue algorithms
b) stack algorithms
c) string algorithms
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
41. Applying the LRU page replacement to the following reference string.
1 2 4 5 2 1 2 4
The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2.
How many page faults will occur?
a) 2
b) 3
c) 4
d) 5
Answer: c
Explanation: None.
42. Increasing the RAM of a computer typically improves performance because ____________
a) Virtual memory increases
b) Larger RAMs are faster
c) Fewer page faults occur
d) None of the mentioned
Answer: c
Explanation: None.
43. Physical memory is broken into fixed-sized blocks called ________
a) frames
b) pages
c) backing store
d) none of the mentioned
Answer: a
Explanation: None.
44. Logical memory is broken into blocks of the same size called _________
a) frames
b) pages
c) backing store
d) none of the mentioned
Answer: b
Explanation: None.
45. 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
Answer: b
Explanation: None.
46. The __________ is used as an index into the page table.
a) frame bit
b) page number
c) page offset
d) frame offset
Answer: b
Explanation: None.
47. The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
Answer: c
Explanation: None.
48. 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
Answer: a
Explanation: None.
49. 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
Answer: a
Explanation: None.
50. Each entry in a segment table has a ____________
a) segment base
b) segment peak
c) segment value
d) none of the mentioned
Answer: a
Explanation: None.
51. 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
Answer: b
Explanation: None.
52. 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
Answer: c
Explanation: None.
0 Comments