Arrays in Data Structures MCQ question and answer with solution

A. 1

B. 2

C. 3

D. IndexError

A. size()

B. length()

C. sizeof(array)/sizeof(array[0])

D. array.size()

A. They allow for easy insertion/deletion

B. They offer O(1) access time by index

C. They automatically resize

D. They do not require contiguous memory

A. When you need constant time access by index

B. When you need dynamic resizing

C. When you frequently insert elements

D. When you frequently delete elements

A. int[] array = new int[5];

B. int[] array = {1, 2, 3, 4, 5};

C. int array[] = new int[5];

D. int array[] = {1, 2, 3, 4, 5};

A. array[2]

B. array[3]

C. array(2)

D. array.get(2)

A. C

B. Java

C. Python

D. JavaScript

A. An array with rows of different lengths

B. A multi-dimensional array

C. An array containing different data types

D. An array that can dynamically resize

A. array.sort()

B. sort(array)

C. array.order()

D. Arrays.sort(array)

A. array.remove(index);

B. array.delete(index);

C. array.splice(index, 1);

D. array.pop(index);