MCQs
Memory Management & Virtual Memory
Memory Management & Virtual Memory | MCQs & Past Papers
7
Total MCQs
0
Topics
1
Past Papers
Memory Management & Virtual Memory
Q1
Paging is implemented in:
Explanation
Paging is a memory-management scheme used by the operating system to divide logical memory into fixed-size pages and physical memory into fixed-size frames. The operating system manages the mapping between pages and frames using page tables.
Q2
Page-Table Length Register (PTLR) indicates the size of:
Explanation
The Page-Table Length Register (PTLR) indicates the size or length of the page table. It helps determine the number of entries present in the page table for a process.
Q3
Bringing a page into memory only when it is needed is called:
Explanation
Demand Paging is a virtual memory technique in which pages are loaded into physical memory only when they are needed. If a required page is not currently in memory, a page fault occurs and the operating system loads the page from secondary storage.
Q4
Divided logical memory into blocks with the same size as frames are called:
Explanation
In paging, logical memory is divided into fixed-size blocks called pages, while physical memory is divided into fixed-size blocks called frames. Pages and frames have the same size, allowing pages to be mapped to available frames.
Q5
Which memory allocation policy allocates the largest hole to the process?
Explanation
Worst-Fit is a memory allocation strategy that searches for and allocates the largest available free memory block, or hole, to a process. It is intended to leave relatively large remaining holes for future allocations.
Q6
When there is enough memory to fit a process in memory, but the space is not contiguous, we need:
Explanation
External Fragmentation occurs when enough total free memory is available to satisfy a process request, but the free space is scattered across separate non-contiguous blocks. Therefore, the process cannot be allocated despite sufficient total free memory.
Q7
A time-sharing system implies:
Explanation
A time-sharing system allows multiple users or programs to share CPU time. Multiple programs are kept in memory, and the CPU rapidly switches among them to provide interactive execution. It does not require multiple processors.