Question 1

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 2

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 3

The np_2d array stores information about multiple family members. Each row represents a different person, and the columns store family member attributes in the following order:Age (years)Weight (pounds)Height (inches)How is the weight of all family members selected from the np_2d array?

Options :

A : np_2d[:, 2]

B : np_2d[:, 1]

C : np_2d[2, :]

D : np_2d[1, :]

Answer: B

Question 4

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

Question 5

Which type of sorting algorithm starts at the first position and moves the pointer until the end of the list, determining the lowest value?

Options :

A : Selection sort

B : Incremental sort

C : Progressive sort

D : Pointer sort

Answer: A

Free Foundations-of-Computer-Science Mock Exam – Practice Online Confidently

Buying Options: