In 1-based indexing for a 2D array A[1..M][1..N], what is the Row-Major address of A[i][j] given Base B and element size W?
For 1-based indexing, there are (i-1) complete rows preceding row i, and (j-1) elements preceding column j in row i.
What is the asymptotic solution of T(n) = T(n/2) + O(1), with T(1) = O(1)?
Each recursive step halves n, so there are Θ(log n) levels, with O(1) work per level. Thus T(n)=Θ(log n), which is not listed among A-C.
What is the maximum number of elements that can be stored in a 3D array A[D1][D2][D3]?
The total capacity of a 3D array is the product of its three dimension bounds: D1 * D2 * D3.
Which data structure is most appropriate for representing a symmetric matrix of size N x N without storing redundant elements?
Since a symmetric matrix has A[i][j] = A[j][i], storing only the lower (or upper) triangular portion in a 1D array reduces space by nearly 50%.
Which statements correctly describe Little-o notation f(n) = o(g(n))?
Little-o means lim(f(n)/g(n)) = 0. Thus A and B describe the relationship, and C follows under the usual positivity assumptions.