Question

Develop have the (3. 15pts) Multidimensional arrays can be stored in row major order, as in C++. the access function for the row-major arrangement of three-dimensional arrays that following form: A[1b1. .ub1, 1b2. .ub2, 1b3. u and upper bounds for the respective dimensions of the array. Define the access function that a ub3], where lb and ubs represent the lower compiler needs to implement to compute the address of Al[i.j.K]. Address(ADJ.K]

Answer 1

Let the address of A[lb₁,lb₂,lb₃] be base address.

the size of data type of array be S.

Address(A[i,j,k]) =

first of all,we need to reach i^th 2-D.for that we need to cross or skip all the 2-D's that came before.(i.e i-lb₁) 2-D's need to be crossed to reach i^th 2-D.

Once we have reached i^th 2-D,we need to reach j^th row.for that we need to cross all rows that came before j^th row.i.e( j-lb₂ ) rows .

Once we need have reached desired row we need to reach desired column of j^th row.to do that we need to skip or cross all columns before that.i.e.(k - lb₃) columns.

Size of one 2-D = (ub₂ - lb₂ + 1)*(ub₃ - lb₃ + 1)*S

Size of one row = (ub₃ - lb₃ + 1)*S

Address(A[i,j,k]) =

Base address +( i-lb₁)*(ub₂-lb₂+1)*(ub₃ - lb₃ + 1)*S + (j-lb₂)*(ub₃- lb₃ + 1)*S + (k - lb₃)*S