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 3
WGU C949 · Data Structures and Algorithms I

WGU C949 Practice Questions – Set 3

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

Question 1 of 50

Which data structure stores unordered items by mapping each item to a specific location in an array?

Question 2 of 50

Which ADT requires only unique elements and does not allow duplicates?

Question 3 of 50

What type of loop is generally associated with O(n^2) complexity?

Question 4 of 50

What is the time complexity of accessing a specific element in an array?

Question 5 of 50

Which data structure stores nodes with a parent-child relationship, and each node has at most two children?

Question 6 of 50

Which sorting algorithm uses comparisons to arrange elements in order?

Question 7 of 50

What is the Big-O notation for the worst-case time complexity of bubble sort?

Question 8 of 50

What is a characteristic of linked allocation in data structures?

Question 9 of 50

What is the output of print(my_list[2:]) if my_list = [5, 10, 20, 40, 80]?

Question 10 of 50

What is an advantage of using a doubly linked list over a singly linked list?

Question 11 of 50

What is the primary purpose of the __init__ method in a Python class?

Question 12 of 50

Which method is used to remove a key-value pair from a Python dictionary?

Question 13 of 50

What data structure is often used to represent a collection of nodes connected by edges?

Question 14 of 50

What is the effect on an object when its reference count reaches zero in a memory-managed environment?

Question 15 of 50

What method is commonly used to add a new element to the end of a Python list?

Question 16 of 50

Which ADT follows a First-In-First-Out (FIFO) structure?

Question 17 of 50

In a stack, what operation adds an item to the top?

Question 18 of 50

What does my_list[0:5:3] return if my_list = [5, 10, 20, 40, 80]?

Question 19 of 50

What is the main purpose of a hash function in a hash table?

Question 20 of 50

What is the time complexity of searching for an item in a well-designed hash table on average?

Question 21 of 50

In which scenario would a stack be the most appropriate data structure to use?

Question 22 of 50

Which ADT is used when data must be stored with no specific order and duplicates are allowed?

Question 23 of 50

What is the purpose of the range() function in Python?

Question 24 of 50

What is an advantage of using a binary search tree?

Question 25 of 50

Which function would you use to count occurrences of a specific value in a list?

Question 26 of 50

What is the result of my_list[:4] if my_list = [5, 10, 20, 40, 80]?

Question 27 of 50

What does a dictionary.keys() function return in Python?

Question 28 of 50

Which complexity is typical of an insertion sort?

Question 29 of 50

What traversal method is used in binary trees to delete nodes?

Question 30 of 50

In which traversal is the root node visited last?

Question 31 of 50

What does isEmpty() check in a stack?

Question 32 of 50

What is a priority queue's main characteristic?

Question 33 of 50

What traversal in a binary search tree yields sorted output?

Question 34 of 50

Which function removes all key-value pairs from a dictionary in Python?

Question 35 of 50

Which ADT is used when both FIFO and LIFO are needed?

Question 36 of 50

In a graph, what is a connection between two vertices called?

Question 37 of 50

What is a min-heap property?

Question 38 of 50

What operation removes the front item in a queue?

Question 39 of 50

What is the role of hash() in Python?

Question 40 of 50

What type of ADT is implemented when items can only be inserted or removed from the top?

Question 41 of 50

In a max-heap, where is the largest value typically stored?

Question 42 of 50

What is a typical use case for binary search?

Question 43 of 50

What complexity does traversing all nodes in a graph have?

Question 44 of 50

What is a tuple in Python?

Question 45 of 50

What traversal is commonly used to create a copy of a binary tree?

Question 46 of 50

How many parents does a node have in a binary tree?

Question 47 of 50

What is the primary advantage of hash tables for storing key-value pairs?

Question 48 of 50

What does the len() function return in Python?

Question 49 of 50

What is a binary search tree's average insertion complexity?

Question 50 of 50

In a graph, what is the name of an individual item represented as a node?

Set 3 complete

You scored 0%

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

Next: Set 4

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