Next Fit Policy

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/operating-system/memory-management/contiguous-allocation/asset-next-fit-policy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…