Best Fit Policy

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/operating-system/memory-management/contiguous-allocation/asset-best-fit-policy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  13. General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
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

  1. 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. 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.

  3. 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.

Loading lesson…