Introduction
  • About the course
  • Important Tips
Basics of Memory Management (Cover it only if you have not watched part 1)
  • Important point
  • Basics of Binary numbers
  • Basics of Memory Management
  • Address Space and Types of allocation
  • Fixed Partitioning
  • Variable Partitioning
  • Memory Allocation Algorithms
  • Problem
  • Problem continued
  • Important point to note
  • Problem
  • Binary addressing revisited
  • Example to explain binary addressing concepts
Paging
  • Need for paging
  • How CPU executes a process in contiguous allocation
  • Basics of paging (Just an intro)
  • Paging explained with example 1
  • Paging explained with example 1 continued
  • Paging explained with example 2
  • Internal Fragmentation Revisited
  • Relation between LA,LAS and PA,PAS
  • Problem on number of frames
  • Important points to observe
  • Problem on number of pages
Problems on Paging
  • Problem 1 on Paging
  • Problem 2 on Paging
  • Problem 3 on Paging
  • Problem 4 on Paging
  • Problem 5 on Paging
  • Problem 6 on Paging
Multilevel Paging
  • Summary of Paging
  • Need for Multilevel Paging
  • Contiguous vs Single level paging vs Multilevel paging
  • Contiguous vs Single level paging vs Multilevel paging continued
  • Multilevel Paging Intro
  • Multilevel Paging Intro continued
Multilevel Paging Problems
  • Problem 1 on Multilevel Paging
  • Problem 2 on Multilevel Paging
  • Problem 2 on Multilevel Paging continued
  • Problem 3 on Multilevel Paging
  • Problem 4 on Multilevel Paging
  • Problem 5 on Multilevel Paging
  • Problem 6 on Multilevel Paging
  • Problem 7 on Multilevel Paging
  • Problem 8 on Multilevel Paging
Page Table Entry
  • Important point to note
  • Frame number field and Referenced bit
  • Present/Absent bit and Dirty bit
  • Protection bits
  • Summary of Page Table Entry
  • Advantage of Dirty bit field in Page Table entry
Page Table Entry Problems
  • Problem 1 on Page Table Entry
  • Problem 2 on Page Table Entry
  • Problem 3 on Page Table Entry
  • Problem 4 on Page Table Entry
  • Problem 5 on Page Table Entry
Virtual Memory
  • Locality of Reference and Virtual Memory explained
  • Advantages of Virtual Memory
Average Memory Access Time (AMAT)
  • Page Hit and Page Fault Explained
  • Average Memory Access Time Explained
  • Another way of looking at AMAT
  • AMAT explained with example
  • Relation between Number of levels of Paging and Number of RAM Accesses
Translation Lookaside Buffer (TLB)
  • Need for TLB
  • TLB Explained with example 1
  • TLB Explained with example 2
  • Computing TLB hit ratio
  • Computing TLB Access Time
  • Computing RAM Access Time
Problems on TLB
  • Problem 1 on TLB
  • Problem 2 on TLB
  • Problem 3 on TLB
  • Problem 4 on TLB
Frame Allocation
  • Need for Frame Allocation for a process
  • Need for Frame Allocation for a process continued
  • Frame Allocation Types
  • Important point to note
  • Difference between static and dynamic
  • Dynamic Frame Allocation
  • Starvation Problem Revisited
Page Replacement Algorithms
  • Local vs Global Page Replacement policies
  • Why Local Page Replacement is preferred
  • Demand Paging Explained
  • Example 1 on LRU Page Replacement Algorithm