Implementing LRU
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Reasoning Ability: Inequality, Syllogisms, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Sufficiency, Data Arrangement, Machine Input-Output
- Computer Aptitude: Logic Gates & Hardware, Number System, Number Representation, Basics of COA, Introduction to OS, Windows OS, Linux OS, Security, Virtual Memory, Introduction to CN, Hardware basics, Network Security, Basics of DBMS, Website, Browser & Services, Internet Fundamentals, Server Side & Security, Emerging Technologies, MS Office Applications
- Data Analysis & Interpretation: Data Interpretation
- General Awareness / Banking Awareness: Evolution of Indian Banking (Banking & Financial Awareness)
- English Language: Noun, Pronoun, Adjectives, Articles, Verb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Adverb, Preposition, Conjunction, Modals, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Verbal Analogy (Word Based Analogy), English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture details two specific algorithms for implementing the Least Recently Used (LRU) page replacement strategy in operating systems. The first method discussed involves using counters, where a logical clock is associated with page-table entries to track usage time. The second method utilizes a stack data structure to maintain the order of page references. The instructor uses a whiteboard to visually demonstrate how these mechanisms function in practice, drawing tables and stack diagrams to clarify the replacement logic. He emphasizes that the goal is to identify the page that has not been used for the longest period to free up memory space efficiently.
Chapters
0:00 – 2:00 00:00-02:00
The segment begins with the instructor explaining the Counters implementation. The slide text states, In the simplest case, we associate with each page-table entry a time-of-use field and add to the CPU a logical clock or counter. He elaborates that the clock increments for every memory reference, and the current clock value is copied to the page-table entry. To illustrate this, he draws a table on the whiteboard with a column labeled P for pages and a column for time values. He writes numbers like 8, 7, 6, and 5 in the boxes, explaining that the page with the smallest time value, such as 5, is the candidate for replacement because it was the least recently used. He points to the text We replace the page with the smallest time value to reinforce the concept.
2:00 – 3:57 02:00-03:57
The lecture transitions to a second approach titled Stack on the slide. The text reads, Another approach to implementing LRU replacement is to keep a stack of page numbers. The instructor explains that whenever a page is referenced, it is removed from its current position in the stack and placed on the top. He draws a U-shaped diagram on the whiteboard to represent the stack structure. He points out that the most recently used page is always at the top, while the least recently used page remains at the bottom, making it the ideal candidate for replacement when a new page needs to be loaded into memory. He underlines the phrase removed from the stack and put on the top to highlight the dynamic nature of this data structure.
The lesson effectively contrasts two hardware-assisted methods for LRU replacement. While counters provide a direct timestamp for each page, the stack method offers a structural approach where the order of elements inherently defines their recency. Both methods aim to minimize page faults by ensuring that the oldest, least utilized pages are evicted first, maintaining system performance.

