External Fragmentation
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
- Paper-1 & 2 | Data Interpretation: Data Interpretation
- Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
- Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
- Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
- Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
- Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
- Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
- Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
- Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
- Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
- Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
- Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
- Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
- Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Ethical Hacking
- Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
- Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
- Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
- Live Sessions: RSSB Live Sessions
- RSSB Paper 1 - Full Mock Tests:
- RSSB Paper 2 - Full Mock Tests:
- SCI Previous Year Papers:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a comprehensive explanation of external fragmentation within the context of operating system memory management. The instructor defines external fragmentation as a condition arising from contiguous allocation policies where the total available memory space is sufficient to satisfy a process request, but the space is not contiguous, making allocation impossible. This results in significant memory wastage. The lesson progresses from the theoretical definition displayed on the screen to a practical visual demonstration using a memory block diagram. The instructor draws a memory region with a central allocated section and free blocks on either side, labeling them to show the distribution of free space. He uses specific numerical examples to illustrate why a process cannot be loaded even when the aggregate free memory exceeds the process size, highlighting the critical limitation of contiguous allocation.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by displaying the definition of external fragmentation on the screen, stating it is a function of contiguous allocation policy. The text explicitly notes that space requested by a process might be available in memory but cannot be allocated if it is not contiguous. To visualize this, he draws a long horizontal rectangle representing a memory block. He shades a central portion of this rectangle with diagonal lines to represent an allocated region. He then writes the number '5' above the free blocks on the left and right sides of the allocated region, indicating the size of the available free space in those specific segments. This setup establishes the scenario where free memory exists but is fragmented, preventing a single large allocation.
2:00 – 4:55 02:00-04:55
The instructor continues the explanation by introducing specific process sizes to test against the memory diagram. He writes the number '7' and '12' below the diagram to represent the size of incoming processes. He explains that a process requiring 7 units of memory cannot be allocated because the available free blocks are only 5 units each, even though their sum is 10. He briefly displays a photograph of a large family with the caption 'on Family Are Expecting Their 17th Child' as a humorous interlude or analogy. He returns to the diagram, writing '9' as another example, reinforcing that the lack of a single contiguous block of sufficient size prevents allocation. He concludes that this inability to utilize available free space due to non-contiguity is the essence of external fragmentation, emphasizing the wastage involved.
The lecture effectively bridges the gap between the abstract definition of external fragmentation and its practical implications in memory management. By using a simple visual model of memory blocks and specific numerical examples, the instructor clarifies why total free memory is not the only factor in allocation decisions. The key takeaway is that contiguous allocation policies suffer from this wastage when free space is scattered, preventing the loading of processes that could theoretically fit in the total available memory. This distinction is crucial for understanding memory management strategies.