Advantage and Disadvantage of Paging
Duration: 9 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-2 | Programming & 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 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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 | 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 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- 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-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture provides a detailed analysis of the paging mechanism in operating systems, focusing on address translation, advantages, and significant disadvantages. The instructor uses diagrams to explain how logical addresses are mapped to physical addresses via a page table. Key topics include the removal of external fragmentation, the overhead of double memory access during translation, the space required for page tables, and the issue of internal fragmentation caused by fixed-size partitions.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by analyzing a detailed diagram illustrating the paging mechanism. The diagram displays a 'CPU' block connected to a 'logical address' split into 'p' (page number) and 'd' (offset). He explains that 'p' indexes into a 'page table' to retrieve a frame number 'f'. This 'f' is then combined with 'd' to form the 'physical address'. The diagram shows the flow from logical address to physical memory and secondary memory, with labels like 'f0000...0000' and 'f1111...1111' indicating address ranges. He highlights a slide titled 'Advantage' with the text 'Removal of External Fragmentation', indicating that paging solves the problem of external fragmentation found in contiguous memory allocation. He gestures towards the page table structure, emphasizing its role in mapping logical pages to physical frames, and explains how the offset 'd' remains unchanged during translation.
2:00 – 5:00 02:00-05:00
The lecture transitions to the 'Disadvantage' slide. The first point states, 'Translation process is slow as Main Memory is accessed two times'. The instructor writes 'MM + MM' on the screen to visualize these two accesses: one to fetch the page table entry and another to access the actual data. He then addresses the second disadvantage: space wasted in the page table. He performs a calculation on the board, writing 'P = 1GB' and 'PS = 1KB' (Page Size). He calculates the number of pages as 2^30 / 2^10 = 2^20. Assuming 4 bytes per entry, he derives a page table size of roughly 4MB. He mentions 'TLB' (Translation Lookaside Buffer) as a hardware solution to mitigate the speed issue caused by double memory access. He points to the slide text 'A considerable amount of space a waisted in storing page table(meta data)' to reinforce the overhead cost.
5:00 – 8:32 05:00-08:32
The instructor continues discussing the disadvantages, specifically focusing on internal fragmentation. He points to the slide text: 'System suffers from internal fragmentation(as paging is an example of fixed size partition).' He explains that since pages are fixed-size, the last page of a process might not be fully utilized, leading to wasted space within the allocated frame. He draws a diagram of physical memory blocks to illustrate this concept, showing how a process might occupy a frame but leave some bytes unused. He also touches upon the final point on the slide: 'Translation process is difficult and complex to understand and implement.' He emphasizes that while paging removes external fragmentation, it introduces internal fragmentation and overhead, making the memory management system more complex compared to simpler allocation schemes. He concludes by reiterating that the complexity lies in managing these page tables and handling the translation overhead efficiently.
The video effectively bridges theoretical concepts with practical implications of paging. By calculating page table sizes and illustrating memory access patterns, the instructor clarifies why paging, despite solving external fragmentation, introduces new challenges like internal fragmentation and performance overhead. The discussion on TLB and complexity provides a holistic view of memory management trade-offs.

