MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Organization knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
IN_LRU,_THE_REFERENCED_BLOCKS_COUNTER_IS_SET_TO‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•0‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÄÖ√¢¬ß_AND_THAT_OF_THE_PREVIOUS_BLOCKS_ARE_INCREMENTED_BY_ONE_AND_OTHERS_REMAIN_SAME,_IN_THE_CASE_OF_______?$# |
| A. | Hit |
| B. | Miss |
| C. | Delay |
| D. | None of the mentioned |
| Answer» B. Miss | |
| 2. |
The counter that keeps track of how many times a block is most likely used is _______$ |
| A. | Count |
| B. | Reference counter |
| C. | Use counter |
| D. | Probable counter |
| Answer» C. Use counter | |
| 3. |
The LRU can be improved by providing a little randomness in the access? |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
The algorithm which removes the recently used page first is ________ |
| A. | LRU |
| B. | MRU |
| C. | OFM |
| D. | None of the mentioned |
| Answer» C. OFM | |
| 5. |
The LRU provides very bad performance when it comes to _________ |
| A. | Blocks being accessed is sequential |
| B. | When the blocks are randomised |
| C. | When the consecutive blocks accessed are in the extremes |
| D. | None of the mentioned |
| Answer» B. When the blocks are randomised | |
| 6. |
In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented by one when _____ occurs.$ |
| A. | Delay |
| B. | Miss |
| C. | Hit |
| D. | Delayed hit |
| Answer» C. Hit | |
| 7. |
The algorithm which replaces the block which has not been referenced for a while is called _____ |
| A. | LRU |
| B. | ORF |
| C. | Direct |
| D. | Both LRU and ORF |
| Answer» B. ORF | |
| 8. |
In set associative and associative mapping there exists less flexibility. |
| A. | True |
| B. | False |
| Answer» C. | |
| 9. |
The surroundings of the recently accessed block is called as ______ |
| A. | Neighborhood |
| B. | Neighbour |
| C. | Locality of reference |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 10. |
The directly mapped cache no replacement algorithm is required. |
| A. | True |
| B. | False |
| Answer» B. False | |