Match bit strides: 1. Power 2: p. Fast 2. Coeff: q. Stride c 3. Shift: r. Bit step
A1-p, 2-q, 3-r
B1-p, 2-r, 3-q
C1-q, 2-p, 3-r
D1-r, 2-p, 3-q
Answer & Solution
Correct answer: A. 1-p, 2-q, 3-r
When array column strides are powers of two, compilers optimize address arithmetic by replacing multiplication with bit shifting.
Keep practising Arrays in Java (Single and Double Dimensional)
Browse all Arrays in Java (Single and Double Dimensional) questions for ICSE Class 10, or explore more Computer Applications topics.
Related questions
Match compact math:
1. Tri: p. Half matrix
2. Deg 2: q. Quadratic
3. Form: r. PolynomialMatch multi order:
1. Row: p. Last index
2. Col: q. First index
3. Dims: r. High rankMatch ring algebra:
1. Ring: p. Noncomm
2. Square: q. N by N
3. Order: r. DimensionMatch zero offset:
1. Base: p. Origin
2. Min: q. Zero based
3. Tuple: r. Multi dimMatch Iliffe costs:
1. Dual: p. 2 indices
2. Fetch: q. Row fetch
3. Jagged: r. VaryingMatch pure diag:
1. Diag: p. Off-diag 0
2. Unit: q. Diag 1s
3. Main: r. i equals jMatch mult cache:
1. Mat A: p. Row major
2. Mat B: q. Col major
3. Prod: r. Optimal GCMatch matrix math:
1. Add: p. Same dims
2. Mult: q. Row by col
3. Square: r. Order n