DATA STRUCTURE

Introduction to data structures:

          

             The way information is organized in the memory of a computer is called data structure.

                                            (OR)

              A data structure is a way of organizing data that considers not only the items stored; but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.

The advantages and disadvantages of data structures are listed;

Advantages:

•         Allows easier processing of data.
•         Using internet, we can access the data anytime from any connected machine (computer, phone, etc.)
•         Allows safe storage of information on a computer.
•         Data structures allow information storage on hard disks.

Disadvantages:

•         Only advanced users can make changes to data structures.
•         Any problem involving data structure will need an expert’s help 

 Classifications of data structure:

               

Primitive data structure:

                 It is a basic data structure which can be directly operated by the machine instruction.  (i.e. float, integer, etc..)

Non Primitive Data Structure:

                  Data structure emphasize on structuring of a group of homogeneous (or) heterogeneous data items.

•       Homogeneous  data structure

                  In homogeneous data structure, all the elements are of same type.

•        Heterogeneous data structure:

                                 In heterogeneous data structure, the elements may or may not be of the same type.

Linear Data Structure:

                  A data structure which contains a linear arrangement of  element in the memory. (i.e. Array)

Non Linear Data Structure:

              

                  In non_ linear data structures, the data items are not in sequence.

 (i.e. Tree, Graph)

                        ************