Data Structure Definition


“Data structure is a method or technique to store the data into the memory in an orderly manner, so that it can be easily accessed and efficiently used.”

The data store into the memory in such a way that can be easily accessed and should be easy to understand. Data may be organized in many different ways. The logical or mathematical model of particular organization of data is called a DATA STUCTURE.


TYPES OF DATA STRUCTURE :-
 
There are two types of data structure. These are :-
1.Linear Data Structure. 
 2.Non- Linear Data Structure



1. Linear data Structure:-
                     In the linear data structure data is arranged in sequence (in order). Data structure whose components are processed sequentially such as array, stack, linked list, queue.


2. Non- Linear data Structure :-
              In the non linear data structure data is not stored in sequence (in order).In this type lots of problems while access any information because the data is not store properly.
 

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