Question 1

What is the built-in data structure that implements a hash table in Python?

Options :

A : Tuple

B : List

C : Array

D : Dictionary

Answer: D

Question 2

Which line of code below contains an error in the use of NumPy?

Options :

A : wgu_list = np.quicksort(arr)

B : print(wgu_list)

C : import numpy as np

D : arr = np.array([3, 2, 0, 1])

Answer: A

Question 3

What Python code would return the value 2 from np_2d, where np_2d = np.array([[1, 2, 3, 4], [10, 20, 30, 40]])?

Options :

A : np_2d[0,1][1]

B : np_2d[0,1]

C : np_2d[2]

D : np_2d[2, 0]

Answer: B

Question 4

What code would print a subarray of the first 5 elements in numpy_array?

Options :

A : print(numpy_array[1:5])

B : print(numpy_array.get(0, 5))

C : print(numpy_array[:5])

D : print(numpy_array.get(5, 1))

Answer: C

Question 5

What is the time complexity of a quicksort algorithm?

Options :

A : O(n)

B : O(n log n)

C : O(log n)

D : O(1)

Answer: B