Worst Fit Policy
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a detailed lecture on memory allocation policies in operating systems, specifically analyzing the Worst Fit and Best Fit strategies. The instructor uses a digital whiteboard to display definitions, advantages, and disadvantages while simultaneously drawing memory diagrams to demonstrate how each policy handles process requests and memory fragmentation. The lesson is structured to compare how different algorithms impact the efficiency of memory usage.
Chapters
0:00 – 2:00 00:00-02:00
The session begins with the Worst fit policy, defined on the slide as a method that searches the entire memory to allocate the largest partition possible. The instructor draws a horizontal memory block divided into partitions labeled with sizes 8, 5, 30, 20, and 40. He explains that for a process request of size 5, the policy selects the largest available partition, which is 40. He marks this partition with hatching to indicate allocation and calculates the remaining free space as 35 (40 minus 5). The slide text highlights that this policy performs best in variable size partitioning but has a significant disadvantage: it performs worst in fixed size partitioning, resulting in large internal fragmentation because large chunks of memory are used for small processes. He emphasizes that while this leaves a large hole, it might not be useful if the next request is small, but generally, it keeps larger contiguous blocks available.
2:00 – 4:14 02:00-04:14
The lecture shifts to the Best fit policy, described on the slide as searching the entire memory to allocate the smallest partition capable of holding the process. The instructor draws a new memory diagram with partitions of sizes 20, 5, 30, and 28. For a request of size 2, he identifies the partition of size 5 as the best fit because it is the smallest partition that can accommodate the request. He allocates the process there, leaving a small remainder of 3. The slide notes that while this performs best in fixed size partitioning, it is difficult to implement and performs worst in variable size partitioning because the remaining spaces are often very small and unusable, leading to external fragmentation. The video concludes with a brief mention of Next fit policy as a modification of best fit where searching starts from the current position rather than the beginning, aiming to reduce search time.
The video effectively contrasts Worst Fit and Best Fit policies by defining their search strategies and illustrating their impact on memory fragmentation through concrete numerical examples. It highlights the trade-off between leaving large holes (Worst Fit) and minimizing wasted space at the cost of creating unusable fragments (Best Fit).

