Worst Fit Policy

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/memory-management/contiguous-allocation/asset-worst-fit-policy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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

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

Loading lesson…