Counting Based Page Replacement
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture covers Counting-Based Page Replacement algorithms, specifically focusing on the Least Frequently Used (LFU) and Most Frequently Used (MFU) strategies. The instructor explains the mechanics of maintaining reference counters for pages and how these counters dictate replacement decisions. He highlights the theoretical basis for LFU, where pages with the lowest access counts are evicted, but also points out a significant flaw regarding pages with high initial usage that become obsolete. The lecture then transitions to MFU, which operates on the counter-intuitive logic that pages with the lowest counts are likely newly loaded and thus should be kept, while discussing why these counting-based methods are rarely used in practice due to implementation costs and poor approximation of the optimal algorithm.
Chapters
0:00 – 2:00 00:00-02:00
The lecture begins by introducing Counting-Based Page Replacement, where a counter tracks references for each page. The instructor details the Least Frequently Used (LFU) algorithm, visible on the slide as requiring the replacement of the page with the "smallest count." The rationale provided is that an actively used page should naturally accumulate a large reference count. However, the instructor identifies a critical flaw in this logic: a page might be used heavily during the initial phase of a process but never again. Because it has a large count, it "remains in memory even though it is no longer needed," leading to inefficient memory usage. This specific scenario highlights the inability of simple counting to distinguish between persistent and transient usage patterns.
2:00 – 3:35 02:00-03:35
The presentation shifts to address the limitations of LFU by proposing a solution: "shift the counts right by 1 bit at regular intervals, forming an exponentially decaying average usage count." The instructor then introduces the Most Frequently Used (MFU) algorithm. Unlike LFU, MFU argues that the page with the "smallest count was probably just brought in and has yet to be used," suggesting it should be kept. The lecture concludes by noting that neither MFU nor LFU is common in practice. The slide text states their implementation is "expensive, and they do not approximate OPT replacement well," explaining their lack of adoption in real-world systems.
The video provides a comparative analysis of counting-based page replacement strategies. It moves from the intuitive LFU approach, which fails to account for transient high usage, to the counter-intuitive MFU approach, which assumes low-count pages are new. Ultimately, the lecture concludes that despite their theoretical distinctiveness, both algorithms are impractical due to high implementation costs and poor performance relative to the optimal replacement strategy.

