Conclusion of External Fragmentation
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture focuses on methods to resolve external fragmentation in operating systems. The instructor presents two primary solutions: swapping processes to perform compaction and utilizing non-contiguous allocation. The first method involves swapping processes in and out of main memory at fixed intervals to consolidate free memory space, a process known as compaction or defragmentation. However, the instructor notes this is costly in terms of time, especially when the system is running. The second solution proposed is non-contiguous allocation, where a process is divided into parts and allocated to different areas of memory, eliminating the need for contiguous blocks. The instructor uses a whiteboard diagram to illustrate how processes can be split and placed in various memory locations, effectively utilizing fragmented space.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces solutions to external fragmentation using a slide titled 'How can we solve external fragmentation?'. He discusses swapping processes to create empty memory parts, explicitly mentioning 'Compaction, defragmentation' on the slide. He highlights that this solution is 'very costly in respect to time'. He then transitions to the second solution, 'non-contiguous allocation', explaining that a process can be 'divided into parts and different parts can be allocated in different areas'. He begins drawing a diagram on the whiteboard to visualize memory allocation, drawing a rectangle to represent memory and smaller shapes to represent processes.
2:00 – 2:25 02:00-02:25
The instructor continues his explanation of non-contiguous allocation while pointing to the diagram he drew on the whiteboard. He circles a specific section of the memory diagram to emphasize how a process can be split. He reinforces the concept that processes do not need to be in one contiguous block. He gestures towards the diagram, showing how different parts of a process can reside in different areas of memory. This visual aid supports his verbal explanation that non-contiguous allocation solves the fragmentation issue by allowing flexible placement of process parts.
The lecture effectively contrasts two approaches to managing external fragmentation. While compaction is a viable method, its high time cost makes it less ideal for running systems. Non-contiguous allocation emerges as a more efficient alternative, allowing processes to be fragmented and placed in available memory holes. The instructor's use of the whiteboard diagram clarifies the abstract concept of non-contiguous allocation, showing students how memory can be utilized more effectively without requiring large, contiguous blocks.

