Best Fit Policy
Duration: 5 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 provides a detailed explanation of the "Best fit policy" used in operating system memory management. The instructor defines the policy as a strategy where the system searches the entire available memory to locate and allocate the smallest partition that is large enough to hold the incoming process. He contrasts this with other policies by highlighting its specific advantages and disadvantages. The core takeaway is that while Best Fit minimizes wasted space in fixed-size partitioning, it is computationally expensive and leads to severe external fragmentation in variable-size partitioning schemes due to the creation of many tiny, unusable memory holes.
Chapters
0:00 – 2:00 00:00-02:00
The session begins with the instructor standing next to a slide titled "Best fit policy." The slide text explicitly defines the method: "Here, we search the entire memory and will allocate the smallest partition which is capable enough." The instructor elaborates on the bullet points. He points to the "Advantage" section, stating the policy "perform[s] best in fix size partitioning scheme." He then moves to the "Disadvantage" section, noting it is "difficult to implement" and "perform[s] worst in variable size partitioning as the remaining spaces which are of very small size." Towards the end, he prepares to draw a diagram on the whiteboard area below the text.
2:00 – 5:00 02:00-05:00
The instructor demonstrates the Best Fit algorithm using a visual memory map. He draws a long rectangle representing memory and writes numbers above it: 8, 5, 20, 25, and 40, representing available partition sizes. He introduces a process request of size 23, which he circles. He explains that the algorithm scans the list and selects the partition of size 25 because it is the smallest one that can accommodate the 23-unit process. He shades the 25-block with diagonal lines to indicate it is now allocated. He points out that 2 units of space remain (25 - 23 = 2), creating a small fragment. He then draws a second, more complex diagram above the first one to show a scenario with partitions 20, 2, 5, and 30, illustrating how fragmentation accumulates over time.
5:00 – 5:17 05:00-05:17
In the final moments, the instructor focuses on the second diagram he drew. He points specifically to the partition of size 30 and the small gap of size 2 next to it. He has written a circled "28" indicating a process size. He uses this visual to reinforce the concept of external fragmentation. He explains that even though there is free space available in the memory (the 20, 2, and 5 blocks), it might not be contiguous enough to satisfy a large request, demonstrating why the policy performs poorly in variable-size partitioning. He concludes the segment by gesturing towards the fragmented blocks to emphasize the inefficiency.
The video successfully bridges the gap between theoretical definitions and practical memory management issues. By starting with the slide text and moving to a hand-drawn diagram, the instructor makes the abstract concept of "Best Fit" concrete. The progression from defining the policy to showing the specific calculation (25 - 23 = 2) and then illustrating the long-term consequence (fragmentation) provides a comprehensive understanding. The visual cues of shading allocated blocks and circling process sizes are crucial for students to follow the logic of the algorithm.

