An array T[50][20] is stored in the memory along the column with each

1.	An array T[50][20] is stored in the memory along the column with each element occupying 4 bytes. Find out the base address and address of the element T [30][15], if the element T[25][10] is stored at the memory location 9800.
Answer» T[50][20] No. of Rows(i.e., R) = 50 No. of Cols(i.e., C) = 20 Element size(W) = 4 bytes T[I][J] = T[30][15] => I=30, J=15 Address of T[25][10] = 9800 Base Address (B) =? Lowest Row (i.e., lr) = 0 Lowest Col (i.e., lc) = 0 Formula to calculate address in Column Major arrangement is: T[P][Q] = B + W[(P - l_r) + R(Q - l_c )] T[25][10] = B + 4((25 – 0) + 50(10 – 0)) 9800 = B + 4(525) (∵ T[25][10] = 9800 given) 9800 = B + 2100 => B = 9800 – 2100 = 7700 Parallely, T[I][J] = B + W[(I - lr ) + R(J - lc )] T[30][15] = 7700 + 4[(30 – 0) + 50(15 – 0)] = 7700 + (4 x 780) = 7700 + 3120 = 10820

An array T[50][20] is stored in the memory along the column with each element occupying 4 bytes. Find out the base address and address of the element T [30][15], if the element T[25][10] is stored at the memory location 9800.

Answer»

T[50][20]

No. of Rows(i.e., R) = 50

No. of Cols(i.e., C) = 20

Element size(W) = 4 bytes

T[I][J] = T[30][15] => I=30, J=15

Address of T[25][10] = 9800

Base Address (B) =?

Lowest Row (i.e., lr) = 0

Lowest Col (i.e., lc) = 0

Formula to calculate address in Column Major arrangement is:

T[P][Q] = B + W[(P - l_r) + R(Q - l_c )]

T[25][10] = B + 4((25 – 0) + 50(10 – 0))

9800 = B + 4(525) (∵ T[25][10] = 9800 given)

9800 = B + 2100

=> B = 9800 – 2100

= 7700 Parallely, T[I][J] = B + W[(I - lr ) + R(J - lc )]

T[30][15] = 7700 + 4[(30 – 0) + 50(15 – 0)]

= 7700 + (4 x 780)

= 7700 + 3120

= 10820

Discussion

No Comment Found

Related InterviewSolutions

An array Arr[35][15] is stored in the memory along the row with each element occupying 4 bytes. Find out the base address and address of an element Arr[20][5], if the location Arr[2][2] is stored at the address 3000.
An array Arr[15][35] is stored in the memory along the column with each element occupying 8 bytes. Find out the base address and address of the element Arr[2][5], if the location Arr[5][10] is stored at the address 4000.
What is the pre-condition for applying binary search algorithm?
Write an algorithm to search for 66 and 71 in the following array:3, 4, 7, 11, 18, 29, 45, 71, 87, 89, 93, 96, 99Make use of binary search technique. Also give the intermediate results while executing this algorithm. Convert this algorithm into a C++ program.
Suppose X, Y, Z are arrays of integers of size M, N and M+N respectively. The numbers in array X and Y appear in descending order.Write a user defined function in C++ to produce third array Z by merging arrays X and Y in descending order.
Suppose A, B, C are arrays of integers of size M, N and M+N respectively. The numbers in array A appear in ascending order while the numbers in array B appear in descending order. Write a user defined function in C++ to produce third array C by merging arrays A ad B in Ascending order. Use A, B, and C as arguments in the function.
Suppose A, B, C are arrays of integers of sizes m, n, m+n respectively. The numbers in arrays A and B appear in descending order. Give an algorithm to produce a third array C, containing all the data of array A and B in ascending order.
Given two arrays of integers X and Y of sizes m and n respectively. Write a function named MERGE() which will produce a third array named Z, such that the following sequence is followed:(i) All odd numbers of X from left to right are copied into Z from left to right(ii) All even numbers of X from left to right are copied into Z from right to left(iii) All odd numbers of Y from left to right are copied into Z from left to right(iv) All even numbers of Y from left to right are copied into Z from right to left X, Y and Z are passed as argument to MERGE().e.g., X is {3, 2, 1, 7, 6, 3} and Y is {9, 3, 5, 6, 2, 8, 10} the resultant array Z is {3, 1, 7, 3, 9, 3, 5, 10, 8, 2, 6, 6, 2}
Write an algorithm to merge two arrays X[6], Y[5] stored in descending order. The resultant array should be in ascending order.
Write an algorithm to add corresponding elements of two matrices A[3 x 3] and B[3 x 3]