1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
LOC(LA[K])=Base(LA) + w (K‐lower bound)
Where w is the number of words per memory cell for the array LA.
Multidimensional arrays
This can be done by the following methods
ROW MAJOR IMPLEMENTATION
Row major implementation is a linearization technique in which elements of
array are reader from the keyboard row wise i.e the complete first row is
stored, then the complete second row is stored and so on.
Address of elements in row major implementation:
The computer does not keep the track of all the elements of the array, rather, it
keeps a base address and calculates the address of required element when
needed. It calculates this by the following relation:
Address of element a[i][j]= B+W (n (i‐L1) + (j‐L2))
Where B is the base address of the array, W is size of each array element, n is
the number of column. L1 the lower bound of row,l2 is lower bound of column.
Let us study an example to get a clear idea of row major implementation.
A two dimensional array defined as a [4.. 7,‐1.. 3] requires 2 bytes of storage
space for each element. If the array is stored in row major form, then calculate
the address of element at location a[6,2]. Give that the base address is 100.
Base address B=100
Size of each element in the array W= 2 bytes
Lower bound of row L1=4
Lower bound of column L2=‐1
Upper bound of row U1=7
Upper bound of column U2=3
Row number of the required element i=6
Column number of required element j=2
Now the number of columns n will be:
U2 – L2 + 1= 3 – (‐1) + 1+5
Address of a[6][2] = 100+2(5(6‐4)+(2‐(‐1)))
=100+2(5*2+3)
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 37 ‐