Arrays in Data Structures MCQ question and answer with solution

A. System.copy()

B. Arrays.copyOf()

C. Collections.copy()

D. System.arraycopy()

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. Random access

B. Fixed size

C. Cache friendliness

D. Ease of use

A. array = [[0]*m]*n

B. array = array([[0]*m]*n)

C. array = [[0 for i in range(m)] for j in range(n)]

D. array = [0, 0, 0, 0]

A. Dynamic size

B. Better cache locality

C. Easier insertion and deletion

D. Lower memory usage

A. O(1)

B. O(n)

C. O(log n)

D. O(n log n)

A. They start from 1

B. They can be negative

C. They start from 0

D. They start from a user-defined value

A. array = [0] * 5

B. array = {0, 0, 0, 0, 0}

C. array = (0, 0, 0, 0, 0)

D. array = new array[5]

A. By value

B. By reference

C. By copying

D. By pointer

A. Dynamic size

B. Random access

C. Ease of insertion and deletion

D. Lower memory usage