Free WGU Foundations-of-Computer-Science Exam Questions

Become WGU Certified with updated Foundations-of-Computer-Science exam questions and correct answers

Page: 1 / 15

Total 71 Questions | Updated On: Apr 03, 2026

Add To Cart

Question 1

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

A : np_2d[0,1][1]

B : np_2d[0,1]

C : np_2d[2]

D : np_2d[2, 0]

Answer: B

Question 2

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

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 3

What is the time complexity of a quicksort algorithm?

A : O(n)

B : O(n log n)

C : O(log n)

D : O(1)

Answer: B

Question 4

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

A : Tuple

B : List

C : Array

D : Dictionary

Answer: D

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?

A : Selection sort

B : Incremental sort

C : Progressive sort

D : Pointer sort

Answer: A

Page: 1 / 15

Total 71 Questions | Updated On: Apr 03, 2026

Add To Cart