Arrays in Data Structures MCQ question and answer with solution

A. array[length]

B. array[-1]

C. array[array.length - 1]

D. array.getLast()

A. O(n)

B. O(n log n)

C. O(n²)

D. O(m + n)

A. They have a fixed size

B. They can change size during runtime

C. They do not allow random access

D. They are implemented using linked lists

A. Java

B. Python

C. JavaScript

D. C

A. 1

B. 2

C. 3

D. 4

A. sortArray()

B. qsort()

C. sort()

D. array_sort()

A. Collections.reverse(array)

B. array.reverse()

C. Arrays.reverse(array)

D. ArrayUtils.reverse(array)

A. Sort the array and pick the first element

B. Iterate through the array and track the largest element

C. Use a binary search

D. Use a hash table

A. int* array = new int[size];

B. int array = new int[size];

C. int array[size];

D. int* array = malloc(size * sizeof(int));

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

B. int array[][][] = new int[3][3][3];

C. int array[3][3][3];

D. int[] array = new int[3][3][3];