Worst Fit Policy

Duration: 4 min

This video lesson is available to enrolled students.

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

Inside: a video lesson and guided study material.

Module outline

  1. English Comprehension/Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Vocabulary, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Conjunction, Pronoun, Noun, Adjectives, Adverb, Modals, Cloze Test (Cloze Passage), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  2. Logical Ability: Coding Decoding, Directions (Direction Test), Analogy, Inequality, Data Sufficiency, Series (Number and Letter Series) (Numerical Relations and Reasoning), Syllogisms, Seating Arrangements, Puzzle Solving (Puzzles), Blood Relations, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Data Arrangement, Venn Diagram, Calendar, Clock
  3. Quantitative Ability: Logarithm, Permutation and Combination, Probability, Profit and Loss, Speed Time and Distance, Mixture and Alligation, Partnership, Simple Interest and Compound Interest, Percentage, Ratio and Proportion (Ratios), Average, Time and Work, Pipe and Cistern, Number System, Divisibility Rules, HCF LCM, Algebra, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Age Problems, Data Interpretation, Sequence and Series (Series)
  4. Basic Analytical Ability: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Selection Decision Table (Decision Making)
  5. Computer Programming: Pseudo Codes, Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. DBMS (Computer Science): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Concurrency Control, Database Security & Authorization
  7. SQL (Computer Science): SQL
  8. OS (Computer Science): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Process Synchronization, Threads & Process Creation, Memory Management, Virtual Memory, File Management
  9. Computer Networks (Computer Science): 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
  10. Data Structures (Computer Science): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. OOPs (Computer Science): Object Oriented Programming (OOPS)
  12. Software Engineering (Computer Science): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. SVAR Conversational - Spoken English: Communication Assessment
  14. HR Interview: MR & HR Interview Preparation
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…