Union

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/c-programming/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 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.

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…