WGU C949 Pre-Assessment 2026/2027 Data Structures and Algorithms I Questions and

WGU C949 Pre-Assessment ( 2026/2027) Data Structures and Algorithms I Questions and Answers

WGU C949 Pre-Assessment ( 2026/

2026) Data Structures and Algorithms I

Questions and Answers

Correct

Q: What does a time complexity analysis of an algorithm include?

Answer:

Worst case

Q: Which data type do heap sorts work with?

Answer:

Tree-based data structure

Q: Which function is used in conjunction with a merge sort algorithm?

Answer:

Re- cursive

Q: Which attribute of a recursive function makes it unique?

Answer:

Calls itself

Q: What is x in the following block of logic?

x=28

If x >= 10 and x < 20 xss=removed>

elif x <= 30 x = 25

elif x >= 50 x = 100 else

x = 500

Answer:

25

Q: What is an if statement inside of an if statement referred to as?

Answer:

Nested

Q: Which search algorithm functions by continually dividing the data set in half until the

sought item is found orthe data set is exhausted?

Answer:

Binary search

Q: Which search algorithm has the best performance when the data set is sorted?

Answer:

Interval search

Q: Which term describes a way of organizing, storing, and performing opera- tions on data?

Answer:

Data structure

Q: Which data structure is used to implement a dictionary data type?

Answer:

Hash table