Information of Data Structure

 In a computer, we require a proper system of storing and retrieval of data/information. Such system is called data structure. It is a genuine thing.

A Data Structure is a way of organizing all data items that considered not only the element stored but also their relationship to each other. 

Data structure are commonly based on the ability of a computer to fetch and store information at wherever in its memory, specified by a pointer—a bit string, signifying a memory address, that can be itself stored in memory and changed by the program.

We can only define it as a mathematical or logical model of particular organizations of data base.

Data structure mainly specified the following things:-

* Organization of Data.

* Accessing Method.

* Degree of Associativity.

* Processing Altering for information.

Data structure are the building block of a program.

The selection of a particular data base structure is based on the following two things:-

1. The data structure must be enough in structure to reflect

    the relationships existing between the data.

2. The structure should be simple show that we can process

    data effective whenever required.

OPERATION OF DATA STRUCTURE

TRAVERSING :-

Accessing each record exactly one so that certain item in the record may be processed (visiting every element at least one time.)

SEARCHING :-

Finding the location of records.

INSERTION :-

Adding new records to the structure.

DELETION :-

Removing a record.

SHORTING :-

Arranging the data in some logical order. Example- In numerical increasing order or alphabetical.

MERGING :-

Combing the data of two difference sorted files into a signal sorted file.