ARRAY ADDRESS CALCULATION | ISC JAVA | ROW MAJOR & COLUMN MAJOR

===============================================
✅ In this video,

✔️ Class: 12
✔️ Subject: Computer Science (ISC Board)
✔️ Chapter: Arrays
✔️ Topic Name: Array address calculation

===============================================
Calculating the address of an element in an N-dimensional array
N-Dimensional Arrays: The N-Dimensional array is basically an array of arrays. As 1-D arrays are identified as a single index, 2-D arrays are identified using two indices, similarly, N-Dimensional arrays are identified using N indices. A multi-dimensional array is declared as follows:

int NDA[S1][S2][S3]……..[SN];
Explanation:

Here, NDA is the name of the N-Dimensional array. It can be any valid identifier name.
In the above syntax, S1, S2, S3……SN denotes the max sizes of the N dimensions.
The lower bounds are assumed to be zeroes for all the dimensions.
The above array is declared as an integer array. It can be any valid data type other than integer as well.
Address Calculation of N-Dimensional Arrays:
The N-Dimensional array NDA with the maximum sizes of N dimensions are S1, S2, S3, ………, SN.
The element whose address needs to be calculated having indices l1, l2, l3, …………..lN respectively.
It is possible that the array indices do not have the lower bound as zero. For example, consider the following array T: T[-5…5][2……9][14…54][-9…-2].
Explanation:

In the above array T, the lower bounds of indices are not zeroes.
So that the sizes of the indices of the array are different now and can be calculated by using the formula:
UpperBound – LowerBound +1
So, here the S1 = 5 – (-5) + 1 = 11. Similarly, S2 = 8, S3 = 41 and S4 = 8.
For address calculation, the lower bounds are t1, t2, t3…….tN. There exist two ways to store the array elements:

Row Major
Column Major

JOIN & LIKE US

Facebook: https://www.facebook.com/Solving-Mant...
Telegram: t.me/solvingmantra
E-mail: [email protected]