Skip to content
Pass Any WGU OA Exam Now & Pay After You Pass. Contact Us!
  1. Home
  2. WGU Exams
  3. WGU C949
  4. Set 2
WGU C949 · Data Structures and Algorithms I

WGU C949 Practice Questions – Set 2

50 multiple-choice questions with answers and detailed explanations. Untimed — choose an answer to check it instantly.

Question 1 of 50

What operation does a queue perform when it removes the item at the front?

Question 2 of 50

What is the output of the code my_list = [5, 10, 20] when calling print(my_list[0:2])?

Question 3 of 50

What operation would you use to create a duplicate of the list my_list?

Question 4 of 50

In a dictionary d, which command retrieves all keys?

Question 5 of 50

What is an advantage of using a linked list over an array for insertion operations?

Question 6 of 50

Which ADT allows duplicate items and does not require ordered elements?

Question 7 of 50

What is the primary purpose of a reference count in garbage collection?

Question 8 of 50

What type of loop executes as long as its condition is true?

Question 9 of 50

What would print(user_value * 5) display if user_value = "-"?

Question 10 of 50

What is displayed when for i in range(3) is used in a loop?

Question 11 of 50

What does the type() function in Python display?

Question 12 of 50

What is the average runtime complexity of a shell sort?

Question 13 of 50

Which data type should be used for a large, fixed-size set of numbers in Java?

Question 14 of 50

In a Python list, how would you retrieve elements from start to end-1 with a specified step?

Question 15 of 50

Which ADT is used to associate keys with values, allowing fast retrieval?

Question 16 of 50

In a binary search tree, the right subtree of a node contains only nodes with values that are...

Question 17 of 50

What is the runtime complexity of searching in a binary search tree in its average case?

Question 18 of 50

How are items organized in a priority queue?

Question 19 of 50

Which traversal method visits nodes in the order: left child, root, right child?

Question 20 of 50

What is an example of a Last-In-First-Out (LIFO) data structure?

Question 21 of 50

What type of function complexity is represented by O(n^2)?

Question 22 of 50

Which function finds the smallest value in an unsorted list in linear time?

Question 23 of 50

What is the time complexity of insertion in a max heap?

Question 24 of 50

Which ADT operation returns the number of items in a stack?

Question 25 of 50

What sorting algorithm selects the smallest element and moves it to the correct position?

Question 26 of 50

Which ADT is appropriate for a collection of distinct items without duplicates?

Question 27 of 50

Which structure supports both FIFO and LIFO behaviors?

Question 28 of 50

How can you remove a leaf node in a binary search tree?

Question 29 of 50

What does the append method do in an array-based list?

Question 30 of 50

What does the pop function do in a priority queue?

Question 31 of 50

Which Big-O notation describes a binary search?

Question 32 of 50

What is the Big-O notation for merging two sorted arrays?

Question 33 of 50

Which function would you use to retrieve a dictionary's items?

Question 34 of 50

How are elements accessed in an associative array?

Question 35 of 50

In a binary tree, how many parents does each node have?

Question 36 of 50

In Python, what would any(b) return if b is a dictionary?

Question 37 of 50

What is the time complexity of traversing a binary search tree?

Question 38 of 50

Which traversal method is useful for sorting a binary search tree?

Question 39 of 50

What structure is used to store a key-value pair in an associative array?

Question 40 of 50

In a hash table, what is a bucket?

Question 41 of 50

In a hash function, what property must be satisfied for secure hashing?

Question 42 of 50

In which data structure does the largest element in a max-heap tree reside?

Question 43 of 50

What complexity classifies an algorithm that breaks problems into smaller chunks?

Question 44 of 50

What is a record in a data structure?

Question 45 of 50

What type of ADT stores unique elements in an unordered manner?

Question 46 of 50

What is the complexity of an algorithm using a doubly nested loop?

Question 47 of 50

What does the peek function do in a stack?

Question 48 of 50

What data structure allows removal of items in constant time on average?

Question 49 of 50

In which case would a doubly linked list be more beneficial than a singly linked list?

Question 50 of 50

What is the primary use of a binary tree's in-order traversal?

Set 2 complete

You scored 0%

0 correct out of 0 answered (50 questions in this set).

Next: Set 3

Struggling with WGU C949?

If this exam is giving you a hard time, let us be your helping hand. Contact us, and we'll provide the assistance you need to pass and move forward.

Chat Now