Skip to main content

Introduction of Structure in DataStructure, C Programming

       The standard data types available in any programming language like “C” cannot meet every need of the user his for data handling. It is not possible to implement s all real life activities and entities by using only standard data types. So the help of available standard data type by clubbing them into a single unit. Structures are user defined data types, which are used to club dissimilar data member into a single unit. That unit is the new user defined data type and can be used to declare the data variables according to the requirement.
             Usually the structures are defined to club the similar, related characteristics of an object derived as new data type.

Defining a structure  

            A structure is defined using a keyword struct and giving a name to the structure data type and declaring each individual members (elements) as normal declaration in a block (i.e., within a pair of curly brackets, {}) and ending the block by semicolon; because of data definition. The syntax of structure definition is as follows:
        struct datatype_name
        Member1 declaration;
       Membern declaration;
Here “struct” is a key word. Datatype_name can be any valid identifier, used as a name for new data type. For example, an employee structure may be defined as:
        Struct emp
             Int eno;
             Char ename [21];
             Float salary;
Here “struct emp” is a new user defined data type (note: not a variable) and can be used to declare the variables of that type, like struct emp e1, e2, earr[10] etc. The variables defied inside the struct like eno, ename  and salary are the members of struct emp and are also called as elements of the structure. With the help of a variable of the type struct emp, the individual members (elements) may be referred by means of dot (.) operator also called as member access operator. At the time of defining data type the variables may be declared after closing curly bracket ‘}’, before the semi colon ‘;’ as shown below:
struct emp
 Int eno;
 char ename [21];
 float salary;
} e1,e2;
The structure variables can be initialized at the time of declaration as follows:
struct emp
  Int eno;
  Char ename [21];
  Float salary;
} e1={101,”Sachin”, 12360.55};


Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video

Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:

      Suppose next node is allocated at an address 506, so the list becomes,

  Suppose next node is allocated with an address with an address 10,s the list become,

The other way to represent the linked list is as shown below:

 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …