DATA STRUCTURE OPERATIONS


The data stored in the data structure is processed by means of certain operations.The following operations are performed on to the Data Structure. These are :-

v  Traversing :-
                 Traversing means to access the each and every record exactly once, so that certain items in the record may process.

v  Searching :-
                 Searching means to find the location of the record with a given key value or finding of record which satisfy more than one condition.

 v  Insertion :-
                 Insertion means to insert a new element into the existing data structure. It means to add a new record into the existing data structure.

 v  Deletion :-
                 Deletion means to delete an existing element from the existing data structure. It means to remove the existing data structure.

 v  Sorting :-
                 Sorting refers to arranging the records in some logical order. The data may be either in ascending order or in descending order.

v  Merging :-
                     Merging means to combine the record of two different stored files into a single stored file. To combine the two files into a single stored file, one should always remember that the data store into the file is in the sorted manner.

Comments

Post a Comment

Popular posts from this blog

Write a program to add two number using inline function in C++?

#include<iostream.h> #include<conio.h> class bca {   public:   inline int sum(int x, int y)   {   return(x+y);   } }; int main() { clrscr(); int r,a,b; bca obj; cout<<"enter two integers :"<<endl; cin>>a>>b; r=obj.sum(a,b); cout<<" the sum of two integers is :"<<r<<endl; getch(); return 0; }   OUTPUT:- enter two integers :    3    6 the sum of two integer is :   9  
Read more

Traversing of elements program with algorithm and Flowchart

Image
ALGORITHM VARIABLES: §   i:      loop counter of array. §   A:    array name. §   LB: lower bound. §   UB: upper bound. ALGORITHM: STEP 1:         set i =LB STEP 2:         repeat steps 3 & 4                            While i<=UB STEP 3:         apply process to A[i] STEP 4:         i = i+1            STEP 5:         exit EXPLANATION: §   To traverse the elements of the array, firstly set the loop counter ‘i’ equal to last element of the array called the LOWER BOUND. §   Now, repeat step 3 & 4 for accessing all the elements of the array until loop counter ‘i’ is not less than or equal first element of array. §   Now, after checking the above condition, the whole process will repeat for all the elements of array. §   After applying process upon a[i], increment the loop counter by 1, until the condition is not satisfied. IMPLEMENTATION
Read more