Conclusion of External Fragmentation

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/operating-system/memory-management/contiguous-allocation/asset-conclusion-of-external-fragmentation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  14. 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, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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

  1. 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. 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.

Loading lesson…