Least Recently Used Page Replacement Algorithm

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/operating-system/virtual-memory/lru-page-replacement/asset-least-recently-used-page-replacement-algorithm after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a detailed lecture on the Least Recently Used (LRU) Page Replacement Algorithm, a key concept in operating systems memory management. The instructor begins by defining LRU as a strategy that replaces the page that has not been used for the longest period of time. He contrasts this with the optimal algorithm, suggesting LRU can be viewed as the optimal algorithm looking backward in time rather than forward. The lecture highlights that LRU results in 12 page faults for a specific reference string, which is better than First-In-First-Out (FIFO) replacement. Furthermore, the instructor notes that LRU is a widely used policy that does not suffer from Belady's Anomaly. The second half of the lecture transitions to a whiteboard session where the instructor introduces the concept of "stack algorithms." He explains that LRU and the Optimal (OPT) algorithm belong to this class. He defines a stack algorithm as one where the set of pages in memory for n frames is always a subset of the set of pages in memory for n+1 frames. To illustrate this, he draws a reference string and constructs vertical columns representing memory frames, demonstrating the subset property visually. This comprehensive approach ensures students grasp both the practical application and theoretical underpinnings of LRU.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor starts with a slide titled "Least Recently Used (LRU) Page Replacement Algorithm." He explains the core definition: "Replace the page that has not been used for the longest period of time." He elaborates that this strategy can be thought of as the optimal page-replacement algorithm looking backward in time. The slide displays a reference string and a table showing page frames, indicating that "LRU gives us 12-page faults." The instructor emphasizes that "LRU is much better than FIFO replacement" and states that the LRU policy is often used because it is considered good. He also points out a key advantage: "LRU also does not suffer from Belady's Anomaly." This section sets the theoretical foundation for why LRU is preferred over simpler algorithms like FIFO.

  2. 2:00 – 5:00 02:00-05:00

    The scene shifts to a whiteboard where the instructor addresses the implementation challenges. He writes, "The major problem is how to implement LRU replacement. An LRU page-replacement algorithm may require substantial hardware assistance." He then introduces a specific class of algorithms called "stack algorithms." He writes, "LRU and OPT belong to a class of page-replacement algorithms, called stack algorithms and can never exhibit Belady's anomaly." He provides a formal definition on the board: "A stack algorithm is an algorithm for which it can be shown that the set of pages in memory for n frames is always a subset of the set of pages that would be in memory with n + 1 frames." To make this abstract definition concrete, he writes a long reference string: "7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1" and begins drawing vertical columns to represent memory frames, starting with a single frame containing the number 7. This step-by-step visual breakdown is crucial for understanding the subset property.

  3. 5:00 – 6:22 05:00-06:22

    Continuing the whiteboard demonstration, the instructor builds upon the stack algorithm concept. He draws multiple columns representing different numbers of frames (n, n+1, etc.). For the first column (1 frame), he writes "7". For the second column (2 frames), he writes "7" and "0". For the third column (3 frames), he writes "7", "0", and "1". He continues this process, filling the columns with numbers from the reference string to visually prove the subset property. He draws a column with "2", "0", "3" and another with "4", "0", "3", "3" (or similar variations depending on the specific step). He points to these columns, explaining that the set of pages in the smaller frame count is contained within the larger frame count. This visual proof reinforces the definition of stack algorithms.

The lecture effectively bridges the gap between the theoretical definition of LRU and its practical classification as a stack algorithm. By first establishing LRU's superiority over FIFO and its immunity to Belady's Anomaly, the instructor sets the stage for the more complex concept of stack algorithms. The whiteboard demonstration serves as a crucial visual aid, transforming the abstract mathematical definition of a stack algorithm into a tangible example. This progression helps students understand not just *what* LRU is, but *why* it behaves the way it does, specifically regarding memory frame subsets.

Loading lesson…