Conclusion of External Fragmentation

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/memory-management/contiguous-allocation/asset-conclusion-of-external-fragmentation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…