Types of data structure

 

As you go through different books There are different point of view is  choosed for categorising data  structure …..

           

Data structures are broadly divided into two :

1.      Primitive data structures : These are the basic data structures and are directly operated upon by the machine instructions, which is in a primitive level.

      They are integers, floating point numbers, characters, string constants, pointers etc.

 

2.      Non-primitive data structures : It is a more sophisticated data structure emphasizing on structuring of a group of homogeneous (same type) or heterogeneous (different type) data items. Array, list, files, linked list, trees and graphs fall in this category.

        

Introduction of Data Structure

    In computer science, a data structure is a particular way of storing and organizing data in a computer’s memory so that it can be used efficiently.

A data structure is a special way of organizing and storing data in a computer so that it can be used efficiently. Array, Linked List, Stack, Queue, Tree, Graph etc are all data structures that stores the data in a special way so that we can access and use the data efficiently.

      Data Structures are the main part of many computer science algorithms as they enable the programmers to handle the data in an efficient way. It plays a vitle role in enhancing the performance of a software or a program as the main function of the software is to store and retrieve the user’s data as fast as possible.