Definitin fo Array



“The collection of homogenous data elements stored under a single name in consecutive memory locations.”
This single name is called array. Individual elements of array are called SUB-SCRIPTED variables. Thus a sub-scripted variable consists of an array name followed by sub-script of an index enclosed in square bracket. A pair of bracket is used for sub-script. Array may be one dimensional one dimensional or two dimensional.
TYPES OF ARRAY:

        1.ONE DIMENSIONAL ARRAY
        2.TWO DIMENSIONAL ARRAY
§  ONE DIMENSIONAL ARRAY:
This type of array is also called linier array. In this, there is only one sub-script. Each element of array is stored in consecutive location in memory as
Data type  array name  size
                                                  int a[10] = (1,2,3,4,5,6,7,8,9,10)
§  TWO DIMENSIONAL ARRAY:
It is also called 2-D array. It is also called MATRIX because it contains rows and columns. This type of array consists of two sub-scripts. First sub-script represents rows and second sub-script represents columns. It is also called m*n matrix. Here, ‘m’ represents rows & ‘m’ represents columns.
EXAMPLE:
                     a [3] [3]
MEMORY REPRESENTATION
§  ROW BY ROW
§  COLUMN BY COLUMN

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