what is Array of structure in C

1.  The most common use of structure in C programming is an array of structures.
2. To declare an array of structure, first the structure must be defined and then an array variable of that type should be defined.    

Example: –  struct std s[5].

For Example:-

#include<stdio.h>

// declaring the structure 
struct std
{
    int id;
    char name[20];
    float marks;
};

// drive function
int main()
{
    // record for 5 students
    struct std s[5];
    int i;

    // Input student details
    for(i=0;i<5;i++)
    {
        printf("Enter the id of %d student\n",i+1);
        scanf("%d",&s[i].id);
        printf("Enter the name of %d student\n",i+1);
        scanf("%s",&s[i].name);
        printf("Enter the Marks of %d student\n",i+1);
        scanf("%f",&s[i].marks);

    }

    //Displaying the details of the student
    printf("The details of the students are:\n");
    for(i=0;i<5;i++)
    {
        printf("Id - %d\n",s[i].id);
        printf("Name - %s\n",s[i].name);
        printf("Marks - %f\n\n",s[i].marks);
    }
    return 0;
}

 

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:-