Paging & Page Tables
This technique divides memory into fixed-size blocks called pages.
What is Paging?
This allows execution of processes without loading them entirely into memory.
What is Virtual Memory?
This algorithm replaces the oldest page in memory.
What is FIFO?
This is a named collection of related information stored on disk.
What is a File?
This allocation method stores files in contiguous blocks on disk.
What is Contiguous Allocation?
This table stores mappings from logical addresses to physical addresses.
What is a Page Table?
This technique loads pages only when they are needed.
What is Demand Paging?
This algorithm replaces the page that has not been used for the longest time.
What is LRU?
This structure organizes files in a hierarchical manner.
What is a Directory Structure?
This allocation method uses pointers to link file blocks.
What is Linked Allocation?
This hardware register holds the starting address of the page table.
What is Page Table Base Register (PTBR)?
This occurs when a required page is not found in main memory.
What is a Page Fault?
This optimal algorithm replaces the page that will not be used for the longest future
What is Optimal Page Replacement?
This type of directory structure allows subdirectories within directories.
What is a Tree-Structured Directory?
This allocation method uses an index block to store addresses of file blocks.
What is Indexed Allocation?
This type of page table reduces memory usage by using multiple levels.
What is a Multilevel Page Table?
This bit indicates whether a page is currently in memory or not.
What is a Valid/Invalid Bit?
This anomaly occurs when increasing frames increases page faults.
What is Belady’s Anomaly?
This operation makes a file system accessible at a certain point in the directory tree.
What is Mounting?
This method tracks free disk space using a list of free blocks.
What is Free Space List?
This memory component speeds up paging by caching recent address translations.
What is a TLB (Translation Lookaside Buffer)?
This metric measures how often page faults occur.
What is Page Fault Rate?
This algorithm gives a second chance to pages using a reference bit.
What is Second Chance (Clock) Algorithm?
This mechanism allows multiple users to access the same file safely.
What is File Sharing and Protection?
This technique uses a bitmap to manage free disk space efficiently.
What is Bitmap (Bit Vector)?