WorksheetsOperatingSystemPart3
Total questions: 75
Worksheet time: 25mins
The addresses generated by a user program during execution are known as which type of addresses?
Physical addresses
MMU addresses
Logical addresses
BIOS addresses
Which component is primarily responsible for translating logical addresses generated by the CPU into physical addresses in main memory?
The Hard Disk Drive (HDD)
The Memory Management Unit (MMU)
The CPU's Control Unit
The Operating System Kernel
In Fixed Memory Partitioning (FMP), what type of fragmentation is the primary problem?
Total Fragmentation
Virtual Fragmentation
Internal Fragmentation
External Fragmentation
Which memory management technique requires the program to be manually split into sections (overlays) to run programs larger than the available physical memory?
Paging and Segmentation
Single Tasking with Overlay
Variable Memory Partitioning (VMP)
Fixed Memory Partitioning (FMP)
What is the primary method used to eliminate External Fragmentation in Variable Memory Partitioning?
Swapping
Segmentation
Paging
Compaction
The operating system's Memory Management function ensures which fundamental principle between concurrently running processes?
Resource Compaction
Simultaneous Access
Protection and Isolation
Mutual Exclusion
What occurs when the total available free memory is sufficient to load a new process, but that free memory is scattered in non-contiguous chunks?
Overlay Conflict
External Fragmentation
Partition Overflow
Internal Fragmentation
In the context of memory management, what does the term RAM stand for?
Random Access Memory
Random Access Mainframe
Resource Allocation Module
Read-Access Memory
Which memory management technique involves partitioning memory into contiguous blocks where the size of each block is determined by the size of the process being loaded?
Fixed Memory Partitioning (FMP)
Overlay
Paging
Variable Memory Partitioning (VMP)
The address space viewed by the hardware and organized into physical addresses is referred to as:
Physical Memory
Logical Memory
Virtual Memory
MMU Cache
If a system uses Fixed Memory Partitioning with 1MB partitions, and a 100KB process is loaded, and then a 900KB process is loaded into two separate partitions, what is the total Internal Fragmentation in KB?
800 KB
0 KB
1048 KB
1000 KB
The primary disadvantage of the Single Tasking with Overlay technique is that:
The entire program must be able to fit in memory before it can run.
It requires significant programmer effort to manually manage overlay sections and dependencies.
It suffers heavily from external fragmentation.
It requires dynamic compaction to manage memory holes.
Why does Fixed Memory Partitioning typically result in lower CPU utilization compared to Variable Memory Partitioning in a multi-tasking environment?
FMP uses logical addressing, which is slower to translate.
FMP often wastes large blocks of memory (internal fragmentation) that could otherwise hold more processes.
FMP allows only one process to run at a time.
FMP requires continuous compaction, wasting CPU cycles.
A system implements Variable Memory Partitioning. After several hours, memory is highly fragmented externally. A new process of 500KB arrives. Which scenario prevents the process from loading?
Total free memory is 500KB in three separate blocks of 100KB, 100KB, and 300KB.
A process of 600KB is currently running in a fixed partition.
Total free memory is 600KB in a single, contiguous block.
Total free memory is 490KB in a single block.
In the scenario provided in the notes, calculate the Internal Fragmentation if the partition size was changed from 400KB to 500KB (and the 450KB process could now be loaded). The processes loaded are 350KB, 200KB, 150KB, 450KB , 300KB , and 100KB.
900KB
1450KB
1550KB
1150KB
Which statement best describes the primary job of the Memory Management Unit (MMU) in the context of memory protection?
The MMU checks if the logical address attempts to access a physical address space outside the process's allocated limits during translation.
The MMU allocates memory dynamically based on the process's needs.
The MMU ensures that the logical addresses generated by the CPU exceed the physical address space.
The MMU ensures that the physical memory is always larger than the logical memory.
Why is Variable Memory Partitioning generally more efficient in terms of memory utilization compared to Fixed Memory Partitioning?
VMP restricts programs to the size of the smallest partition.
VMP eliminates the need for any memory translation.
VMP eliminates internal fragmentation by allocating exactly the size a process needs.
VMP uses compaction to reduce internal fragmentation.
Which memory management approach is characterized by the need for memory to be treated as a single, contiguous block for the entire program, even if using the overlay technique?
Fixed Partitioning
Single Tasking with Overlay
Variable Partitioning
Segmentation
If an OS needs to maintain accurate information about which areas of memory are free and which are occupied, this is fulfilling the MM role of:
Ensuring program size limitations.
Keeping track of memory usage.
Preventing external fragmentation.
Translating logical addresses.
Compaction is computationally expensive because it requires the operating system to:
Shine off memory contents to disk storage.
Reset the physical addresses to zero.
Dynamically re-create all the logical addresses used by the processes.
Physically relocate occupied memory blocks and update the base addresses of processes.
An OS supporting multiprogramming aims to maximize the number of processes in memory. Which memory management technique is inherently limited in this goal due to its design?
Fixed Memory Partitioning
Variable Memory Partitioning
Paging
Segmentation
What would be the total KB of Internal Fragmentation in a FMP system with two 100KB partitions if one partition holds a 90KB process and the other partition is empty?
100KB
110KB
10KB
20KB
If a logical address is 1024 and the base address of the process is 2048, what is the corresponding physical address?
3072
Cannot be determined without the limit register.
1024
2048
Which scenario is not a direct responsibility of the operating system's Memory Management component?
Allocating and de-allocating memory space to processes.
Keeping track of which portions of memory are free and which are occupied.
Determining the priority of a process for CPU scheduling.
Deciding where processes should reside in main memory.
The primary requirement for the Compaction technique to be effective in eliminating External Fragmentation is the ability to:
Translate physical addresses into logical addresses.
Relocate running programs without interrupting their execution.
Convert all non-contiguous free spaces into internal fragmentation.
Dynamically re-run the program's initialization phase.
Which memory management technique allows the execution of processes that are not completely in physical memory?
Overlay
Fixed Memory Partitioning
Virtual Memory
External Fragmentation
In Demand Paging, what does an 'i' (Invalid) setting in the Valid-Invalid bit of the Page Table indicate?
The page is read-only and cannot be modified.
The page is not in physical memory
The page is currently in physical memory.
The page is corrupt or damaged.
What is the primary goal of the Optimal (OPT) Page Replacement Algorithm?
To guarantee the lowest page fault rate for a fixed number of frames.
To use only pages that belong to the operating system kernel.
To replace the page that was used the longest time ago.
To replace the page that has been in memory the longest (FIFO).
A Page Fault is an interrupt that signals which event during the process's execution?
The process has finished its execution successfully.
The requested page is not currently resident in physical memory (RAM).
A request for a page located on a remote network drive.
The requested page is not found in the Translation Lookaside Buffer (TLB).
Which of the following is a key characteristic of the Demand Segmentation approach compared to Demand Paging?
The logical blocks (segments) are visible and meaningful to the user/programmer.
It uses fixed-size blocks for memory allocation.
It eliminates the problem of external fragmentation.
It uses the entire program as the minimum swap unit.
The primary benefit of Virtual Memory that relates to the separation of logical and physical address spaces is the ability to:
Increase the speed of the CPU's clock cycle.
Execute a process whose total logical address space is larger than the total physical memory.
Eliminate all forms of fragmentation.
Force all pages to be resident in memory at all times.
Which page replacement algorithm is used as a benchmark for comparison but is impossible to implement in a general OS due to its reliance on future knowledge?
First-In, First-Out (FIFO)
Optimal (OPT)
Least Recently Used (LRU)
Least Frequently Used (LFU)
In the process of handling a Page Fault, what action must the OS take if no free physical memory frame is available?
Perform a Page Replacement Algorithm to select a victim frame.
Re-run the previous instruction repeatedly until a frame becomes free.
Convert the invalid bit to 'v' without loading the page.
Terminate the entire process.
A key advantage of Virtual Memory is that it improves CPU utilization by supporting a higher degree of:
Multiprogramming
External Fragmentation
Mutual Exclusion
Resource Compaction
The page replacement algorithm that is an effective practical approximation of the Optimal algorithm is:
First-In, First-Out (FIFO)
Belady's Anomaly (BA)
Least Recently Used (LRU)
Optimal (OPT)
A system implements Demand Paging. An address generated by the CPU is checked in the Page Table, and the Valid-Invalid bit is 'v'. The resulting physical memory access is classified as:
A Page Fault, requiring disk I/O.
A Disk Swapping Operation, requiring a victim page.
A Segmentation Fault, requiring the OS to update the Segment Table.
A Page Hit, resulting in fast, direct memory access.
If a memory management scheme swaps entire segments (variable size) to and from the disk, which fragmentation issue is a key concern for this scheme?
Internal Fragmentation
External Fragmentation
Page Fault Fragmentation
No fragmentation (perfect fit)
Belady's Anomaly demonstrates a flaw in the FIFO algorithm. This anomaly is characterized by:
The page fault rate increasing as the number of available frames increases.
Pages remaining in memory indefinitely.
The page fault rate decreasing as the number of available frames increases.
The LRU algorithm outperforming the Optimal algorithm.
When handling a Page Fault, the OS must restart the instruction that caused the fault. This necessity implies that the MMU must have recorded:
The entire program's logical address space.
The average page access time.
The disk location of the victim page.
The state of the instruction's execution before the trap occurred.
In the comparison between Demand Paging and Demand Segmentation, which factor contributes to the simpler address translation in Demand Paging?
Paging uses variable-size blocks (pages).
Paging allows the user to see the logical program units.
Paging uses fixed-size blocks (pages).
Paging requires a longer page table lookup time.
Which of the following is a direct consequence of using Virtual Memory to support a high degree of multiprogramming?
Higher risk of thrashing.
Elimination of all page faults.
Increased overall physical memory size.
Reduced need for a Page Table.
The fact that Demand Paging eliminates the need for the user program to concern itself with the physical memory limits is a demonstration of which core Virtual Memory concept?
Internal fragmentation reduction.
The separation of logical and physical address spaces.
Program relocation complexity.
Program relocation complexity.
If a page replacement algorithm consistently chooses a victim page that will be accessed again almost immediately, the system will experience a high rate of:
CPU Hitting
Page Faults
External Fragmentation
Context Switching
Why is the Least Recently Used (LRU) algorithm often implemented using approximations (like the clock algorithm) rather than precise time-stamping?
Because precise time-stamping is only possible in Optimal replacement.
Because LRU must use variable-size pages.
Because the overhead of continuously updating and maintaining a perfect usage order is too high.
Because LRU suffers from Belady's Anomaly.
What happens to the Valid-Invalid bit of the required page entry in the Page Table immediately after the page is read from the disk into the free frame during a Page Fault handler routine?
It is used to select the next victim page.
It is reset to 'i' to signal the disk transfer is complete.
It is set to 'v' to indicate the page is now resident and accessible.
It remains 'i' until the entire process completes.
Which fragmentation problem is the main drawback of Demand Paging, potentially leading to wasted space in memory?
Demand Fragmentation
External Fragmentation (between pages)
Thrashing
Internal Fragmentation (within the last page)
A system is using Demand Paging with a 4KB page size. A process needs 10KB of logical memory. How many pages will this process occupy, and what is the internal fragmentation?
2 pages; 0 KB fragmentation.
3 pages; 6 KB fragmentation.
2 pages; 6 KB fragmentation.
3 pages; 2 KB fragmentation.
The primary disadvantage of the Demand Segmentation approach is its susceptibility to external fragmentation, which requires the OS to implement the complex procedure of:
Paging
Compaction
Swapping
Belady's Anomaly
If a single process has pages scattered across multiple non-contiguous frames in physical memory, which technique makes this possible?
Demand Paging
Contiguous memory allocation
Fixed Memory Partitioning
Overlay
In the LRU (Least Recently Used) algorithm, what data must the operating system maintain or approximate for every page currently in memory?
The exact physical location of all pages belonging to the process.
The next instruction that will access the page.
The time or sequence of the page's last reference.
The total number of times the page has been swapped out.
Which hardware component generates the interrupt (trap) when a process attempts to access a page marked with an 'i' (Invalid) bit?
Central Processing Unit (CPU)
Operating System (OS)
Memory Management Unit (MMU)
Disk Controller
In the Page Table, what does the Valid-Invalid bit of 'v' (Valid) indicate?
The page is currently resident in a physical memory frame.
The page is on disk and ready to be loaded.
The page has been modified (is 'dirty').
The page belongs to the operating system kernel.
The primary cause of the high cost associated with handling a Page Fault is the required process of:
Reading the required page from the slow secondary storage (disk I/O).
Restarting the instruction that caused the fault.
Executing the Page Replacement Algorithm.
Saving the state of the user process.
Which page replacement algorithm is impractical to implement because it requires knowledge of the page reference string's future accesses?
Second Chance
Optimal (OPT)
Least Recently Used (LRU)
First-In, First-Out (FIFO)
The general formula for calculating the Effective Access Time (EAT) is
EAT = (1 - p) x (A) + p x (F), where p is the page fault rate. What does A represent?
Total process execution time.
Disk I/O latency.
Memory Access Time (Page Hit Time).
Average time to find a free frame.
After the required page is loaded from disk during a Page Fault, what is the final action the OS performs before returning control to the user process?
Restoring the CPU state and restarting the faulted instruction.
Saving the new victim page to the disk.
Terminating the process that caused the fault.
Running the Page Replacement Algorithm again.
The Dirty Bit (or Modified Bit) associated with a page indicates that:
The page is currently being accessed by the CPU.
The page has been written to since it was loaded into memory.
The page is a high-priority victim candidate.
The page is corrupt and must be replaced.
The LRU (Least Recently Used) page replacement algorithm chooses a victim page based on what criterion?
The page that will be used furthest in the future.
The page with the largest size in memory.
The page that has been loaded into memory the longest.
The page that has not been referenced for the longest period of time.
What is the consequence of a victim page being 'dirty' during the Page Replacement process?
It can be removed immediately without disk I/O.
It must be written back to the disk before the new page can be loaded.
The process is immediately terminated.
The Page Table entry remains unchanged.
What is the final step in the OS handler routine concerning the Page Table before the instruction is restarted?
Deleting the entire page table entry for the process.
Marking the victim page's entry as 'dirty'.
Resetting all frame numbers to zero.
Setting the Valid-Invalid bit of the required page's entry to 'v'.
In a Demand Paging system, the memory access time is 200 nanoseconds, and the Page Fault handling time is 10 milliseconds. If the page fault rate is 0.0001 (0.01%), what is the Effective Access Time (EAT)?
200 nanoseconds
10.0001 milliseconds
1000 nanoseconds
10000 nanoseconds
If the Page Fault rate p increases from 0.0001 to 0.0002 (a 0.01% increase), why does the Effective Access Time (EAT) more than double, despite the change in p being small?
The OS must restart the instruction twice for every fault.
The Memory Access Time component triples.
The Page Replacement Algorithm becomes infinitely complex.
The Page Fault Time component remains the same, but its contribution is doubled by the rate p.
Which crucial step, required by the OS to handle a Page Fault, is completely avoided if the system uses Demand Segmentation instead of Paging?
Finding the disk location of the data.
Trapping to the operating system.
Restarting the instruction.
Translating the logical address using fixed block sizes.
The Belady's Anomaly, demonstrated by the FIFO algorithm, is used to illustrate which principle regarding replacement algorithms?
That the Page Fault handling time is negligible.
That LRU is the best practical algorithm.
That the Optimal algorithm is impossible to implement.
That increasing the number of physical memory frames can increase the page fault rate.
The operating system chooses to save the state of the user process (CPU registers, Program Counter) immediately upon trapping a Page Fault. This is necessary primarily to ensure:
The Page Fault is not mistaken for a segmentation fault.
A clean restart of the instruction from the exact point of failure.
The Disk I/O operation is protected from interruption.
The required page is not modified by another process.
If the OS uses the Least Recently Used (LRU) algorithm, what implementation overhead is typically incurred for every successful memory access (Page Hit)?
Updating a timer or stack position to mark the accessed page as most recently used.
A full disk I/O operation.
Calculating the effective access time.
Executing the Page Replacement routine.
The instruction that caused the Page Fault is restarted rather than continued. This implies the instruction must be one that:
Is part of the operating system kernel.
Does not use the CPU.
Cannot be completed partially and then resumed.
Only accesses the system's hard drive.
What is the consequence of selecting a page replacement algorithm (like FIFO) that has a high potential for Belady's Anomaly?
The Valid-Invalid bit is automatically set to 'v'.
The OS wastes resources by potentially allocating more frames that worsen performance.
The memory access time decreases sharply.
It guarantees the lowest possible page fault rate.
The Page-Fault Handler routine is designed to confirm whether the access was valid before proceeding. If the access is deemed invalid, the OS action is to:
Update the Page Table with a new frame number.
Immediately search for a victim page.
Load the page from disk and continue.
Terminate the process.
A system has a memory access time of 50 ns and a Page Fault time of 8 ms. To keep the EAT below 100 ns, the maximum tolerable page fault rate p must be less than approximately:
0.00000625
0.00005
0.0000125
0.00625
When handling a Page Fault, why must the OS ensure that the victim page is written back to the disk only if its Dirty Bit is set?
The victim page might be needed by another running process.
Writing a clean page back to disk causes a system crash.
To save I/O time, as a clean page already exists on the disk and does not need to be saved.
Only dirty pages are eligible for replacement by the LRU algorithm.
In the process of handling a page fault, the required page is read from the disk into the newly acquired frame. Which key step must occur immediately before the transfer can begin?
The Page Table must be reset to the initial state.
The OS must convert all logical addresses to physical addresses.
The CPU must switch to user mode.
The OS must acquire a free frame, possibly by running the Page Replacement Algorithm.
The First-In, First-Out (FIFO) page replacement algorithm's primary advantage is negated by its vulnerability to Belady's Anomaly and its poor performance because:
It often replaces pages that are frequently used (hot pages) simply because they were loaded first.
It only works if the page fault rate is zero.
It requires expensive hardware to track page load times.
It requires the user to manually set the victim page.
Which scenario best justifies the use of the Least Recently Used (LRU) algorithm despite its high implementation overhead?
In systems where the high cost of a page fault outweighs the high cost of maintenance.
In systems where the exact load time of pages is unknown.
In systems that must suffer from Belady's Anomaly.
In systems where the entire logical address space is always resident in memory.
The fact that a Page Fault requires the OS to intervene and perform I/O operations from secondary storage means that the entire handling routine must execute in which privileged CPU mode?
System call mode
User mode
Kernel (Supervisor) mode
Instruction restart mode
