Union

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/structures/structures-declaration-initialization-union-comparison/asset-union after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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)
  13. 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, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the Union data structure in C programming as a user-defined datatype that groups variables of different types while sharing the same memory location. The instructor explains that unlike structures, only one member can hold a valid value at any given time because all members occupy the same memory space. The total size of a union is determined by its largest member, illustrated with an example where the character array str[20] dictates a total size of 20 bytes. The lesson demonstrates this behavior through code examples showing how assigning an integer value to one member and then a float to another overwrites the previous data due to shared memory allocation.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor defines a Union in C as a user-defined datatype that groups variables of different data types but shares the same memory location. On-screen text explicitly states 'Groups variables of different datatypes, but shares the same memory location' and 'Only one member can hold a value at a time.' The code snippet `union Data {int i; float f; char str[20];};` is displayed, followed by the declaration `union Data d1; //Total size = 20 bytes.` The instructor annotates member sizes (4B for int, 8B for float) and underlines key phrases to emphasize the shared memory concept. The example `d1.i = 10;` is shown to initialize the union.

  2. 2:00 – 3:14 02:00-03:14

    The lesson continues by demonstrating the overwrite behavior inherent to unions. The instructor shows how assigning a float value, such as `d1.f = 22.5;`, overwrites the previously stored integer value in the same memory space. Visual annotations highlight that the total size remains 20 bytes, determined by the largest member `char str[20]`. The instructor draws arrows to show overlapping memory usage for int, float, and char members. The final code snippet `printf("%d", d1.i);` is presented to illustrate how reading the integer member after a float assignment yields undefined or garbage values due to the shared memory location.

The video provides a foundational understanding of C unions by contrasting them with structures through memory allocation principles. The core concept is that union members share the same physical address, meaning writing to one member invalidates previous values in other members. The size calculation is strictly based on the largest member, ensuring sufficient space for any single type within the union. This behavior is critical for memory-efficient programming where only one data type needs to be stored at a time. The examples clearly show the practical implications of this design, such as data overwriting when switching between int and float assignments within the same union variable.

Loading lesson…