Union

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-1-programming-language/structures/structures-declaration-initialization-union-comparison/asset-union after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: 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, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: 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
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. 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
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. 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…