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

WGU C949 Practice Questions – Set 4

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

Question 1 of 50

Which type of linked list allows navigation in both forward and backward directions?

Question 2 of 50

In a binary tree, what are nodes called that have no children?

Question 3 of 50

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

Question 4 of 50

Which data structure is primarily used to manage elements in Last-In-First-Out (LIFO) order?

Question 5 of 50

In a queue, where are elements removed?

Question 6 of 50

What method would retrieve and remove the highest-priority element in a priority queue?

Question 7 of 50

Which ADT operation for stacks returns, but does not remove, the top item?

Question 8 of 50

What traversal order is generally used to delete all nodes in a tree?

Question 9 of 50

Which sorting algorithm starts with the farthest elements and reduces the gap between compared elements gradually?

Question 10 of 50

Which data structure does not allow duplicate elements and stores data unordered?

Question 11 of 50

What data structure would be best suited for managing undo operations in software?

Question 12 of 50

What does the expression my_list[:3] return in Python if my_list = [5, 10, 15, 20, 25]?

Question 13 of 50

In Python, which function finds the index of the first element in a list that matches a specific value?

Question 14 of 50

Which algorithm is designed to find the kth smallest element in an unsorted list?

Question 15 of 50

What is the primary function of append() in a linked list?

Question 16 of 50

What ADT supports only First-In-First-Out (FIFO) operations?

Question 17 of 50

What is the purpose of the __init__ method in Python classes?

Question 18 of 50

In a binary tree, which traversal visits the root, followed by the left subtree, then the right subtree?

Question 19 of 50

Which data structure is particularly efficient for finding the minimum or maximum value in a collection?

Question 20 of 50

What is the time complexity of searching in a balanced binary search tree?

Question 21 of 50

Which sorting algorithm splits the array into smaller arrays, sorts them, and merges them back together?

Question 22 of 50

In Python, what does the any() function return if all elements in a list are False?

Question 23 of 50

Which operation in a binary search tree has an average complexity of O(log n)?

Question 24 of 50

What is a unique attribute of a singly linked list?

Question 25 of 50

In a stack, which operation would you use to add an element to the top?

Question 26 of 50

Which data structure uses hashing to map keys to values, allowing quick lookups?

Question 27 of 50

What does range(5, -6, -1) produce in Python?

Question 28 of 50

Which sorting algorithm has the best time complexity of O(n log n) on average?

Question 29 of 50

In a circular linked list, where does the last node point?

Question 30 of 50

What is the Big-O notation for the worst-case time complexity of binary search?

Question 31 of 50

Which algorithm repeatedly finds the minimum element and places it at the beginning of the array?

Question 32 of 50

In a binary tree, which traversal visits nodes from the lowest level up to the root?

Question 33 of 50

What is the output of all([0, 1, 2]) in Python?

Question 34 of 50

What is a primary advantage of hash tables?

Question 35 of 50

What type of data does a max-heap maintain at the root?

Question 36 of 50

What type of node is the root in a tree?

Question 37 of 50

What is an associative array commonly known as in Python?

Question 38 of 50

Which function removes the last item from a list in Python?

Question 39 of 50

What is the main feature of a binary search algorithm?

Question 40 of 50

Which data structure would be best suited for a breadth-first search?

Question 41 of 50

In a min-heap, where would you typically find the smallest value?

Question 42 of 50

What method would you use to access all values in a dictionary?

Question 43 of 50

What traversal would result in visiting nodes in ascending order in a binary search tree?

Question 44 of 50

What operation is used to add a new node in a max heap?

Question 45 of 50

In a binary tree, what is a node that has one or more children called?

Question 46 of 50

Which data structure supports insertion and deletion at both ends?

Question 47 of 50

In a graph, what is the term for a direct connection between two vertices?

Question 48 of 50

Which of these has a complexity of O(n^3)?

Question 49 of 50

In Python, which function returns the data type of an object?

Question 50 of 50

In a binary tree, which traversal visits nodes starting from the root, then moves level by level?

Set 4 complete

You scored 0%

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

Next: Set 5

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