Multilevel Paging
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture addresses the memory management challenge posed by modern systems supporting large logical address spaces ranging from 2^32 to 2^64 bits. The instructor begins by illustrating the problem: a single page table for such a system could contain millions of entries, making it impossible to fit into a single memory frame. He introduces the solution known as Multilevel Paging or Hierarchical Paging. This method involves dividing the page table into smaller pieces, effectively paging the page table itself. The specific implementation discussed is a two-level paging algorithm. A 32-bit logical address is segmented into three distinct parts: the first 10 bits serve as an index for the outer page table, the next 10 bits index the inner page table, and the final 12 bits act as the offset within the physical page frame. This hierarchical approach ensures that only the necessary portions of the page table reside in memory at any given time.
Chapters
0:00 – 2:00 00:00-02:00
The instructor starts the session by drawing a tall vertical rectangle on the whiteboard and labeling it 5m to represent a page table with 5 million entries. He explains that in modern systems, the logical address space is so large that the page table becomes excessively big. He draws a second, smaller rectangle next to the first one to visually contrast the sizes. He then begins sketching a system diagram on the left side of the board, drawing a box labeled CPU and connecting it to memory structures. This visual setup prepares the ground for explaining why a single large page table is problematic for memory allocation. He emphasizes that the page table itself takes up a lot of space in memory.
2:00 – 5:00 02:00-05:00
He continues the whiteboard diagram by adding a PTBR Page Table Base Register box that points to a structure labeled Outer Page Table. He draws a second structure below it labeled Inner Page Table and uses arrows to show the data flow from the CPU through these tables to the main memory. He writes V3 < 4 P > I on the board, likely referring to virtual page number logic or a specific addressing scheme. He explains that the page table itself is paged, meaning it is divided into smaller pieces that can be loaded into memory frames as needed. This avoids the requirement for a contiguous block of memory for the entire page table, solving the space issue. He draws squiggly lines to represent the memory frames being filled.
5:00 – 7:36 05:00-07:36
The video transitions to a slide titled Multilevel Paging Hierarchical Paging. The text on the slide explicitly states that page tables can contain millions of entries and cannot be accommodated into a single frame. The diagram on the slide shows a 32-bit logical address divided into 10 bits, 10 bits, and 12 bits. The instructor points to the Outer Page Table and Inner Page Table columns, explaining how the first 10 bits index the outer table, the next 10 bits index the inner table, and the final 12 bits provide the offset within the physical page. He traces the path from the CPU through the page tables to the physical memory, reinforcing the concept of hierarchical lookup. The slide also shows the physical address being split into 32 bits for the frame number and 12 bits for the offset.
The lesson progresses from identifying the memory inefficiency of large page tables to implementing a hierarchical solution. By breaking the page table into multiple levels, the system only needs to load the necessary parts of the page table into memory, saving significant space. The 32-bit address example concretely demonstrates how bits are allocated to navigate this hierarchy. This approach allows operating systems to manage very large address spaces efficiently without wasting memory on unused page table entries. The instructor effectively uses both hand-drawn diagrams and a structured slide to clarify the complex mapping process involved in multilevel paging.

