Algorithm: Data structure : Post 5

A Data Structure is a particular way of organizing data in a computer so that it can be used efficiently. 

                   or in other words 

Data structure refers to a scheme for organizing related pieces of information. 

Different kinds of data structure are suited for different use and for different kinds of application, and some are highly specialized to specific tasks.

List of areas in which data structure are applied extensively are:-

1. Compiler Design

2. Operating System

3. Database Management System

4. Statistical Analysis package

5. Numerical Analysis

6. Graphics

7. Artificial Intelligence

8. Simulation 

So practically almost every where...

Data Structure are generally used to store information in a particular way,  mostly to make it easily accessible and more related to the need of the program.

They are generally based on the ability of a computer to fetch and store data at any place in its memory.

The implementation of a data structure usually requires writing a set of procedures that create and manipulate instances of that structure.

Data structure / data type can broadly be divided into two categories.

Primitives and Non-Primitives

and digging deeper in non-primitive data structure

We have 

Linear data structure:- A linear data structure traverse the data elements sequentially, in which only one data element is directly be reached. Ex: Array, Stack, Queue, Linked List

Non Linear data structure:- Every data item is attached to several other data item in a way that is specific for reflecting relationships. The data items are not arranged in sequential structure. Ex: Trees, Graphs.

Thanks for reading this post.

In next post we will be discussing about Array.