Worst Fit Policy
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.
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).

