MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 34 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Working set model for page replacement is based on the assumption of ____________ |
| A. | modularity |
| B. | locality |
| C. | globalization |
| D. | random access |
| Answer» C. globalization | |
| 2. |
A process is thrashing if ____________ |
| A. | it is spending more time paging than executing |
| B. | it is spending less time paging than executing |
| C. | page fault occurs |
| D. | swapping can not take place |
| Answer» B. it is spending less time paging than executing | |
| 3. |
Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced? |
| A. | first in first out algorithm |
| B. | additional reference bit algorithm |
| C. | least recently used algorithm |
| D. | counting based page replacement algorithm |
| Answer» D. counting based page replacement algorithm | |
| 4. |
In FIFO page replacement algorithm, when a page must be replaced ____________ |
| A. | oldest page is chosen |
| B. | newest page is chosen |
| C. | random page is chosen |
| D. | none of the mentioned |
| Answer» B. newest page is chosen | |
| 5. |
Effective access time is directly proportional to ____________ |
| A. | page-fault rate |
| B. | hit ratio |
| C. | memory access time |
| D. | none of the mentioned |
| Answer» B. hit ratio | |
| 6. |
When a program tries to access a page that is mapped in address space but not loaded in physical memory, then ____________ |
| A. | segmentation fault occurs |
| B. | fatal error occurs |
| C. | page fault occurs |
| D. | no error occurs |
| Answer» D. no error occurs | |
| 7. |
Swap space exists in ____________ |
| A. | primary memory |
| B. | secondary memory |
| C. | cpu |
| D. | none of the mentioned |
| Answer» C. cpu | |
| 8. |
The pager concerns with the ____________ |
| A. | individual page of a process |
| B. | entire process |
| C. | entire thread |
| D. | first page of a process |
| Answer» B. entire process | |
| 9. |
_____ is the concept in which a process is copied into the main memory from the secondary memory according to the requirement. |
| A. | Paging |
| B. | Demand paging |
| C. | Segmentation |
| D. | Swapping |
| Answer» C. Segmentation | |
| 10. |
Because of virtual memory, the memory can be shared among ____________ |
| A. | processes |
| B. | threads |
| C. | instructions |
| D. | none of the mentioned |
| Answer» B. threads | |
| 11. |
____________ is one or more physically contiguous pages. |
| A. | Slab |
| B. | Cache |
| C. | Object |
| D. | Allocator |
| Answer» B. Cache | |
| 12. |
A process is busy swapping pages in and out. |
| A. | Thrashing |
| B. | Compaction |
| C. | External Fragmentation |
| D. | Division |
| Answer» B. Compaction | |
| 13. |
Any program, no matter how small, occupies an entire partition. This is called _____________ |
| A. | fragmentation |
| B. | prior fragmentation |
| C. | internal fragmentation |
| D. | external fragmentation |
| Answer» D. external fragmentation | |
| 14. |
LRU stands for? |
| A. | Least Recently used |
| B. | Less Recently used |
| C. | Least Recurrently used |
| D. | Least Randomly used |
| Answer» B. Less Recently used | |
| 15. |
Separation of user logical memory and physical memory is ___________ |
| A. | Memory control |
| B. | Memory management |
| C. | Memory sharing |
| D. | Virtual memory |
| Answer» E. | |
| 16. |
_____________IS_ONE_OR_MORE_PHYSICALLY_CONTIGUOUS_PAGES.?$ |
| A. | Slab |
| B. | Cache |
| C. | Object |
| D. | Allocator |
| Answer» B. Cache | |
| 17. |
WORKING_SET_MODEL_FOR_PAGE_REPLACEMENT_IS_BASED_ON_THE_ASSUMPTION_OF?$ |
| A. | modularity |
| B. | locality |
| C. | globalization |
| D. | random access |
| Answer» C. globalization | |
| 18. |
THE_VIRTUAL_MEMORY_BASICALLY_STORES_THE_NEXT_SEGMENT_OF_DATA_TO_BE_EXECUTED_ON_THE__________?$ |
| A. | Secondary storage |
| B. | Disks |
| C. | RAM |
| D. | ROM |
| Answer» B. Disks | |
| 19. |
A_PROCESS_IS_BUSY_SWAPPING_PAGES_IN_AND_OUT.?$ |
| A. | Thrashing |
| B. | Compaction |
| C. | External Fragmentation |
| D. | Division |
| Answer» B. Compaction | |
| 20. |
The_associatively_mapped_virtual_memory_makes_use_of________$ |
| A. | TLB |
| B. | Page table |
| C. | Frame table |
| D. | None of the mentioned |
| Answer» B. Page table | |
| 21. |
A process is thrashing i? |
| A. | it is spending more time paging than executing |
| B. | it is spending less time paging than executing |
| C. | page fault occurs |
| D. | swapping can not take place |
| Answer» B. it is spending less time paging than executing | |
| 22. |
The DMA doesn’t make use of the MMU for bulk data transfers?# |
| A. | True |
| B. | False |
| Answer» C. | |
| 23. |
Any program, no matter how small, occupies an entire partition. This is called ____________? |
| A. | fragmentation |
| B. | prior fragmentation |
| C. | internal fragmentation |
| D. | external fragmentation |
| Answer» D. external fragmentation | |
| 24. |
The main aim of virtual memory organisation is ________ |
| A. | To provide effective memory access |
| B. | To provide better memory transfer |
| C. | To improve the execution of the program |
| D. | All of the mentioned |
| Answer» E. | |
| 25. |
A process selects a replacement frame from the set of all frames. |
| A. | Local replacement |
| B. | Global replacement |
| C. | Block replacement |
| D. | Module replacement |
| Answer» C. Block replacement | |
| 26. |
______ translates the logical address into a physical address. |
| A. | MMU |
| B. | Translator |
| C. | Compiler |
| D. | Linker |
| Answer» B. Translator | |
| 27. |
An allocation that uses a proportional allocation scheme using priorities rather than size. |
| A. | Priority allocation |
| B. | File allocation |
| C. | Preference allocation |
| D. | Simple allocation |
| Answer» B. File allocation | |
| 28. |
__________is used to implement virtual memory organisation. |
| A. | Page table |
| B. | Frame table |
| C. | MMU |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 29. |
The binary address issued to data or instructions are called as ______ |
| A. | Physical address |
| B. | Location |
| C. | Relocatable address |
| D. | Logical address |
| Answer» E. | |
| 30. |
COW stands for? |
| A. | Copy over write |
| B. | Convert over write |
| C. | Count over write |
| D. | Copy over write |
| Answer» E. | |
| 31. |
The techniques which move the program blocks to or from the physical memory is called as ______ |
| A. | Paging |
| B. | Virtual memory organisation |
| C. | Overlays |
| D. | Framing |
| Answer» C. Overlays | |
| 32. |
Virtual Memory can be implemented via __________ |
| A. | Demand Paging |
| B. | Logical paging |
| C. | Structural way |
| D. | Simple division |
| Answer» B. Logical paging | |
| 33. |
The program is divided into operable parts called as _________ |
| A. | Frames |
| B. | Segments |
| C. | Pages |
| D. | Sheets |
| Answer» C. Pages | |
| 34. |
Logical Address space can be larger than physical address space. |
| A. | True |
| B. | False |
| Answer» B. False | |