Next Fit Policy

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/operating-systems/memory-management/contiguous-allocation/asset-next-fit-policy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, 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
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): 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
  10. Computer Networks (Domain Test): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture covers memory allocation strategies, specifically focusing on the "Next fit policy" and "External fragmentation". The instructor begins by defining Next fit as a modification of the Best fit algorithm. He illustrates on a whiteboard how the search for memory blocks continues from the last allocated position rather than restarting from the beginning. Later, the lecture transitions to the concept of External fragmentation, explaining it as a consequence of contiguous allocation policies where free memory exists but is non-contiguous, preventing the allocation of larger processes. This progression highlights the relationship between allocation efficiency and memory wastage.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the "Next fit policy" using a slide that defines it as a modification of the best fit algorithm. He explains that after satisfying a request, the search for the next request starts from the "current position" rather than the beginning of memory. Visually, he draws a long horizontal rectangle on the whiteboard to represent memory blocks. He marks specific sections with diagonal lines to denote allocated space and draws a red arrow pointing to the right to demonstrate the search pointer moving forward from the last allocation point. He emphasizes that this approach avoids scanning the entire memory list repeatedly, unlike the standard Best fit method, which restarts the search from the start every time.

  2. 2:00 – 3:04 02:00-03:04

    The lecture transitions to a new topic, "External fragmentation," displayed on the slide. The text defines it as a function of contiguous allocation policy where requested space is available but not contiguous. The instructor explains that this wastage occurs because the scattered free blocks cannot be combined to satisfy a single large request. He uses hand gestures to indicate separate, non-adjacent blocks of memory. The slide text explicitly states, "The space requested by the process is available in memory but, as it is not being contiguous, cannot be allocated this wastage is called external fragmentation." He clarifies that even if total free space is sufficient, the lack of contiguity prevents allocation.

The lesson progresses from a specific allocation algorithm to a fundamental memory management problem. By first detailing how Next fit optimizes search efficiency compared to Best fit, the instructor sets the stage for understanding the limitations of contiguous allocation. The introduction of External fragmentation highlights the trade-off: while algorithms like Next fit manage allocation efficiently, the requirement for contiguous blocks inherently leads to wasted space when free memory is fragmented. This connects the mechanical process of allocation to the resulting state of the memory system, showing how efficient searching does not solve the underlying issue of scattered free blocks.

Loading lesson…