Union in C

1. Capable of grouping different types data items in a single unit.
2. The union variable is allocated a common memory equal to the memory size required by the maximum sized data member.
3. All members share the same common memory but one at a time .
4. Union are used to efficiently use the memory.

if int = 2 byte , char = 1 bytes , float =4 bytes for the 16 bits architecture

#include<stdio.h>
union emp
{
    char name[20];
    int id;
    float sal;
}e1;

int main()
{
    printf("Enter id of employee\n");
    scanf("%d",&e1.id);
    printf("ID - %d\n",e1.id);
    printf("Enter name of employee\n");
    scanf("%s",e1.name);
    printf("Name - %s\n",e1.name);
    printf("Enter salary of employee\n");
    scanf("%f",&e1.sal);
    printf("Salary - %f\n",e1.sal);
    return 0;
}

 

Enter id of employee
12568
ID - 12568
Enter name of employee
Rajnish
Name - Rajnish
Enter salary of employee
85568.23
Salary - 85568.226562

Union in C

Recommended Post:

Key points:-

Cracking the coding interview:-

Array and string:-

• Is Unique
  
• Check Permutation
  
• Urlify
  
• One away
  
• String Compression
  
• Zero matrix
  

Tree and graph:-

Hackerearth Problems:-

•  Playing With Characters | Hackerrank practice problem solution
• Sum and Difference of Two Numbers | hackerrank practice problem solution
  
• Functions in C | hackerrank practice problem solution
  
• Pointers in C | hackerrank practice problem solution
  
• Conditional Statements in C | Hackerrank practice problem solution
  
• For Loop in C | hackerrank practice problem solution
  
• Sum of Digits of a Five Digit Number | hackerrank practice problem solution
  
• 1D Arrays in C | hackerrank practice problem solution
  
• Array Reversal | hackerrank practice problem solution
  
• Printing Tokens | hackerrank practice problem solution
  
• Digit Frequency | hackerrank practice problem solution
  
• Calculate the Nth term | hackerrank practice problem solution

Data structure:-

•   Program to find cycle in the graph
• Implementation of singly link list
• Implementation of queue by using link list
• Algorithm of quick sort
• stack by using link list
• program to find preorder post order and inorder of the binary search tree
• Minimum weight of spanning tree
• Preorder, inorder and post order traversal of the tree

 MCQs:-