Author Archives: Thomas Mani P
Array address calculation 2012
A matrix B[10][7] is stored in the memory with each requiring 2 bytes of storage. If the base address at B[x][1] is 1012 and the address at B[7][3] is 1060 determine the value of ‘x’ where the matrix is stored … Continue reading
Array address calculation 2011
A square matrix A[mxm] is stored in the memory with each element requiring 2 bytes of storage. If the base addressA[1][1] is 1098 and the address at A[4][5] is 1144, determine the order of the matrix A[mxm] when the matrix … Continue reading
Array address calculation 2019
A matrix ARR[ – 4…6, 3….8] is stored in the memory with each element requiring 4 bytes of storage. If the base address is 1430, find the address of ARR[3][6] when the matrix is stored in Row Major Wise. Row … Continue reading
Array address calculation 2018
A matrix A[m][m] is stored in the memory with each element requiring 4 bytes of storage. If the base address at A [1][1] is 1500 and address of A [4][5] is 1608, determine the order of matrix when it is … Continue reading
Array address calculation 2017
A matrix P[15][10] is stored with each element requiring 8 bytes of storage. If the base address at P[0][0] is 1400, determine the address at P[10][7] when the matrix is stored in Row Major Wise. Row Major Wise: P[i][j] = … Continue reading
Array address calculation 2016
A matrix A[m][n] is stored with each element requiring 4 bytes of storage. If the base address at A[1][1] is 1500 and the address at A[4][5] is 1608, determine the number of rows of the matrix when the matrix is … Continue reading
Array address calculation 2015
The array D[-2…10][3…8] contains double type elements. If the base address is 4110, find the address of D[4][5], when the array is stored in Column Major Wise. The given values are:B = 4110, W = 8 bytes or 64 bits … Continue reading
Infix to postfix 2019
Convert the following infix notation to postfix form: (A + B * C ) – ( E * F / H ) + J = ( A + BC* ) – ( EF* / H ) + J = ( … Continue reading
Infix-postfix 2018
Convert the following infix notation to postfix form: A + (B – C * (D / E) * F) = A + (B – C * DE/ * F) = A + (B- CDE/* * F) =A + (BCDE/*F*-) ABCDE/*F*-+
Infix to postfix 2017
Convert the following infix expression to postfix form: P * Q / R + (S + T) = P * Q / R + ST+ = P Q* / R + ST+ = PQ*R/ + ST+ P Q * R … Continue reading