Memory Concepts and Abstraction
Understand memory types, hierarchy, and why OS abstraction is required.
Memory Management
Move from basic memory concepts to virtual memory, paging, replacement strategies, and segmentation.
Learning objectives
- - Understand memory abstraction
- - Perform logical to physical address mapping
- - Explain paging and demand paging
- - Compare replacement algorithms
Topics in this chapter
20 min
Memory Allocation and Free-Space Management
Compare fixed/dynamic partitions and first-fit, next-fit, best-fit, worst-fit strategies.
Logical vs Physical Address and Relocation
Learn base/limit based relocation and why logical addressing enables flexible loading.
Paging, Demand Paging, and TLB
Master page/frame mapping, page fault handling, and translation acceleration via TLB.
Page Replacement and Segmentation
Compare FIFO, Optimal, LRU, Second-Chance/Clock, NRU and contrast paging with segmentation.
Question bank for this chapter
Summer 2023Q4(A)
Explain how free space can be managed by OS.
Summer 2023Q4(B)
Explain paging with the help of diagram.
Summer 2023Q4(B) OR
Explain page table with the help of diagram.
Summer 2023Q4(C)
Calculate page fault rates for FIFO and Optimal with 4 frames for reference string 0,2,1,6,4,0,1,0,3,1,2,1.
Summer 2023Q4(C) OR
Demonstrate first-fit, best-fit, worst-fit placement for given process sizes and partitions, and identify efficient algorithm.
Winter 2023Q4(A)
Discuss paging with example.
Winter 2023Q4(B)
Explain virtual memory with the help of diagram.
Winter 2023Q4(B) OR
Describe fixed and variable memory allocation in short.
Winter 2023Q4(C)
Calculate page fault rates for FIFO and Optimal with 3 frames for reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,0,2,0,1,7,0,1.
Winter 2023Q4(C) OR
Calculate page fault rates for LRU and Optimal with 3 frames for reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,0,2,0,1,7,0,1.
Summer 2024Q4(A)
Explain paging technique with the help of diagram.
Summer 2024Q4(B)
Given six partitions and process sizes, solve first-fit, best-fit and worst-fit placement.