Skip to main content

Structure

STRUCTURE:

A structure is a collection of variables of different types under a single name or in other words structure is a user defined data type. Structures can be used like any other variable. We can make a struct array or used as pointers.

SYNTAX:

struct structure_name{
type1 id_list1 ;
type2 id_list2 ;
.
.
.
typen id_listn ;
} struct_type ;
EXAMPLE:
struct number{
int num;
char name[10];
};

STRUCTURES WITH FUNCTIONS:

• Stucture variables are passed by value by default.
• To pass a structure by reference, pass its address. Arrays of structures—like all other arrays—are automatically passed by reference.
• To pass an array by value, create a structure with the array as a member. Structures are passed by value, so the array is passed by value.

Implementation of Structure in C:

#include<stdio.h> 
#include<string.h> 

//structure declaration 
struct employee { 
   char name[25]; 
   int id_number; 
   int age; float salary; 
} emp1 = {"Dummy1",1,24,20000}; 

int main() 
{ 
   struct employee emp2; 
/* Structure variable declaration. There is now an emp2 variable that has modifiable variables inside it.*/ 
/* Structure members can be accessed using direct component selection operator or dot operator as shown in the following statements */ 

   strcpy(emp2.name,"Dummy2"); 
   emp2.age = 22; 
   emp2.id_number = 2; 
   emp2.salary = 12000.21; 
   struct employee emp3; 

/* Initialize the structure variable emp3 from input data as follows */ 
   
   printf("Enter the name of employee: " ); 
   gets(emp3.name); 
   printf("Enter the id number of employee: " ); 
   scanf("%d",&emp3.id_number); 
   printf("Enter the age of employee: " ); 
   scanf("%d",&emp3.age); 
   printf("Enter the salary of employee: " ); 
   scanf("%f",&emp3.salary); 

/*A new copy of a structure’s value can be made by simply assigning one structure to another as in the following statement */ 
  
   struct employee emp4 = emp1;

//Displaying the content for each employee 

   printf("\n%s is %d years old and has %d id number and %.2f salary.\n",emp1.name, emp1.age, emp1.id_number,emp1.salary); 
   printf("\n%s is %d years old and has %d id number and %.2f salary.\n",emp2.name, emp2.age, emp2.id_number,emp2.salary);
   printf("\n%s is %d years old and has %d id number and %.2f salary.\n",emp3.name, emp3.age, emp3.id_number,emp3.salary);  
   printf("\n%s is %d years old and has %d id number and %.2f salary.\n",emp4.name, emp4.age, emp4.id_number,emp4.salary); 

   return 0; 

}

Comments

Popular posts from this blog

Pointers

Pointers: A pointer is a variable whose value is a memory address. A pointer contains the memory address of a variable that, in turn, contains a specific value. In this sense, a variable name directly references a value, and a pointer indirectly references a value. Syntax: type * variable ; Interpretation: The value of the pointer variable ptr is a memory address. A data item whose address is stored in this variable must be of the specified type. Dynamic Memory Management: C/C++ enables programmers to control the allocation and deallocation of memory in a program for any built in or user defined type. The ability for a program to obtain more memory space at execution time to hold new nodes, and to release space no longer needed is known as dynamic memory management. Syntax: int *num = (int *)malloc(sizeof (int)*numCount); or int *ptr = (int *)calloc(numCount, sizeof (int)); /* returns a pointer to a section of memory just large enough to hold the integers, whose q...

Single LinkList in Java

Linked List: Linked List contains a sequence nodes which are linked together. Each node contains a connection to another link and data. Linked list is the second most-used data structure after array. Following are the important terms to understand the concept of Linked List. Link − Each link of a linked list can store a data called an element. Next − Each link of a linked list contains a link to the next link called Next. LinkedList − A Linked List contains the connection link to the first link called First. Types of Linked List: Following are the various types of linked list. Simple Linked List − Item navigation is forward only. Doubly Linked List − Items can be navigated forward and backward. Circular Linked List − Last item contains link of the first element as next and the first element has a link to the last element as previous. Basic Operations: Insert:  Inserts at tail,  specific index. Delete: Deletes from the tail.  specific index. ...

Object Oriented Programming (OOP)

Object Oriented Programming: Object Oriented Programming (OOP) is a programming concept which used in the modern programming world. Languages like Java, C++,  and Python support Object Oriented Programming (OOP). It works on the principle that objects are the most important part of a program. In OOP we think in terms of objects and every object has its attributes (properties) and a state (behavior/functions). Object Oriented Programming (OOP) is a technique of system modeling and its main purpose is to understand the product before developing it and manipulating these objects to achieve a specific task.   Pillars of Object Oriented Language (OOP): There are four basic principles of Object Oriented Language (OOP). Inheritance Polymorphism Data Encapsulation Abstraction WHY is Object Oriented Language (OOP) NEEDED? Problems with Procedural Languages: Functions have unrestricted access to global data Unrelated Functions and data. Before Object Oriente...