click below
click below
Normal Size Small Size show me how
S2 - App OS
S2
| Question | Answer |
|---|---|
| It occurs when a partition is available but is too small for any waiting job. | External fragmentation |
| An address generated by the CPU. | Logical address |
| The size of a memory frame is NOT EQUAL to the size of a process page. | FALSE |
| In paging, the system also breaks a process into blocks called pages. | TRUE |
| The portion of the hard disk that acts as physical memory is called a page file | TRUE |
| The address used to identify a memory location | Physical Address |
| It refers to a collection of processes that are residing in main memory and are ready and waiting to execute | Ready Queue |
| It refers to a collection of processes on the disk that are waiting to be brought into memory for execution. | Job queue |
| In paging, the OS divides main memory into fixed-sized blocks called frames | TRUE |
| It occurs when a process requiring m memory locations reside in a partition with n memory locations where m < n. | Internal fragmentation |
| In dynamic partitions, which memory allocation scheme allots the largest free available block to the new job? | Worst-fit |
| A hardware device that performs the run-time mapping from logical to physical addresses | Memory management unit |
| In this process, if a new hole is adjacent to other holes, the system merges these adjacent holes to form one larger hole. | coalescing |
| Memory paging is a memory management technique for controlling how a computer or virtual machine's (VM's) memory resources are shared. | TRUE |
| F4 | F4 |
| Virtual memory is the separation of user logical memory from physical memory | TRUE |
| It is a swapping technique where instead of swapping the entire process into memory, the OS swaps only the necessary pages into memory. | Lazy swapping |
| In demand paging system, there is an additional bit in the page table which is the valid-invalid bit | TRUE |
| If a process tries to use a page that is not in physical memory, then a ________ will occur. | Page-fault |
| It is important to keep the page-fault rate _____ in a demand-paging system. | Low |
| The last step for page fault service routine is ______ | Restart the user process |
| This bit is set to invalid to indicate that a corresponding page is in memory. | FALSE |
| Demand paging system is similar to paging system with swapping. | TRUE |
| This occurs if there is a need to transfer a page from disk to memory but there is no memory space available | Memory is overloading |
| In__________ demanding paging, the system never bring a page into memory until it is required. | Pure |
| This bit is set to ____ to indicate that a corresponding page is in memory. | Valid |
| One of the major advantages of Virtual memory is that programs can be larger than _________. | Physical memory |
| If a process tries to use a page that is not in physical memory, then a page bug will occur. | FALSE |
| The effectiveness of the demand paging is based on a property of computer programs called the publicity of reference. | FALSE |
| A page replacement algorithm is necessary to select which among the pages currently residing in _______ will be replaced. | Main memory |
| It is important to keep the page-fault rate low in a demand-paging system. | TRUE |
| It is important to keep the page-fault rate high in a demand-paging system. | FALSE |
| A portion of the ___________ is acting as a virtual memory | Hard disk |