Arrays In Data Structures - Practice Test

(A) O(1)

(B) O(log n)

(C) O(n)

(D) O(n log n)

(C) O(n)

(A) Random access

(B) Fixed size

(C) Cache friendliness

(D) Ease of use

(B) Fixed size

(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]

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

(A) Dynamic size

(B) Better cache locality

(C) Easier insertion and deletion

(D) Lower memory usage

(B) Better cache locality

(A) O(1)

(B) O(n)

(C) O(log n)

(D) O(n log n)

(B) O(n)

Arrays In Data Structures - Study Mode