BPSC TRE – Data Structures & Algorithms | Full Subject Test 1

All three statements A, B, and C are correct for a conventional array with constant-size elements. Therefore, more than one of the above is correct.

In Column-Major order, column j is preceded by j full columns of M elements each. Adding row offset i gives total offset = j * M + i.

Here $a = 2$, $b = 2$, and f(n) = O(n). Since $n^{log_b$ a} = $n^1$ = $n = f(n)$, this matches Case 2 of the Master Theorem, yielding T(n) = O(n log n).

Unrolling the recurrence T(n) = T(n-1) + c yields c + c + ... + c (n times), which evaluates to O(n).

Triplet representation stores sparse matrices efficiently by maintaining a 3-column array of (row, col, value) for non-zero entries.