Segmentation
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: 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
- Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a detailed lecture on Segmentation as a memory management scheme in operating systems. The instructor begins by contrasting segmentation with paging, emphasizing that segmentation supports the user's view of memory by organizing it into variable-length segments such as subroutines and stacks. The lecture defines the logical address space as a collection of segments, each identified by a name and length. The instructor explains that a logical address consists of a two-tuple: <segment-number, offset>. He illustrates the concept of variable-length segments using whiteboard diagrams, showing how they differ from fixed-size pages. The final section covers the hardware mechanism for address translation using a segment table, which contains segment base and limit registers. The process involves indexing the table with the segment number, checking if the offset is within the limit, and adding the base to the offset to generate the physical address. The lecture concludes by noting that segmentation suffers from external fragmentation.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the concept of Segmentation, contrasting it with paging. The slide text states, 'Paging is unable to separate the user's view of memory from the actual physical memory,' while segmentation supports this user view. He explains that a logical address space is a collection of segments, where each segment has a name and a length. The instructor highlights that addresses specify both the segment name and the offset within the segment. Consequently, the user specifies each address by two quantities: a segment name and an offset. The slide explicitly defines a logical address as a two-tuple: <segment-number, offset>. He notes that segments can be of variable lengths unlike pages and are stored in main memory.
2:00 – 5:00 02:00-05:00
The instructor moves to a whiteboard to visually demonstrate the concept of variable-length segments. He draws a large vertical rectangle to represent physical memory and divides it into smaller rectangles of varying heights to represent segments. He explains that unlike paging, where pages are fixed size, segments can be of different sizes depending on the program's needs. He points to the diagram on the slide which shows a logical address space containing distinct blocks labeled 'subroutine', 'stack', 'symbol table', 'Sqrt', and 'main program'. He draws a corresponding physical memory layout on the board, showing these segments placed in memory with gaps between them, illustrating how they are stored in main memory. He emphasizes that the user sees a logical address space composed of these named segments.
5:00 – 9:30 05:00-09:30
The lecture transitions to the hardware mechanism for segmentation using a 'Segment Table'. The slide text states: 'Each entry in the segment table has a segment base and a segment limit.' The segment base contains the starting physical address where the segment resides, and the segment limit specifies the length of the segment. The segment number is used as an index to the segment table. The offset d of the logical address must be between 0 and the segment limit. If it is not, the system traps to the operating system. When an offset is legal, it is added to the segment base to produce the address in physical memory. The instructor draws a flow diagram showing the CPU generating a logical address (s, d). The segment number s indexes the table to retrieve the base and limit. A comparison checks if d < limit. If valid, base + d yields the physical address. He writes numbers like '109' and '1105' to demonstrate the addition. Finally, he notes that segmentation suffers from External Fragmentation.
The video provides a comprehensive overview of segmentation as a memory management technique. It starts by defining the logical address space as a collection of variable-length segments, contrasting this with the fixed-size pages of paging. The instructor uses diagrams to visualize how segments like stacks and subroutines are organized logically and physically. The lesson culminates in explaining the hardware support required, specifically the segment table containing base and limit registers, which enables address translation and protection by checking offsets against segment limits.

