Skip to main content

Structure C programming - Used to Store More Then One Type Of Data.

Structure is used to store more then one values in different data types. struct keyword is used to declare the structure.
Syntax
struct structure_name{
int id;
char name[50];
float salary;
};
main()
{
struct structure_name object_of_structure;
}
How To Access Structure Member Variable ?
Create the object of that structure. And access  the values of structure variable using "."(dot operator).
Example
struct emp{
int id;
char name[50];
float salary;
};
main()
{
struct emp e;
printf("Enter the employee details\n");
printf("Id :");
scanf(%d,&e.id);
printf("Name :");
scanf(%d,e.name);
printf("Salary :");
scanf(%f,&e.salary);
printf("\nEmployee details");
printf("\n%d",e.id);
printf("\n%s",e.name);
printf("\n%f",e.salary);
}
Output
Enter the employee details
Id : 25
Name : mrc
Salary : 25000
Employee details
25
mrc
25000
From the above programme we declare the id,name and salary variables inside the structure emp.
Then access member variables of the structures through  "."(Dot operator) .

Comments

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...