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

WGU C949 Practice Questions – Set 5

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

Question 1 of 50

What is the complexity of inserting an element at the beginning of a linked list?

Question 2 of 50

Which data structure organizes elements based on their key-value association?

Question 3 of 50

Which sorting algorithm has a time complexity of O(n^2) in the worst case but is efficient for nearly sorted data?

Question 4 of 50

What is the return type of the Python function type()?

Question 5 of 50

Which operation in a priority queue always retrieves the highest priority item?

Question 6 of 50

What is a tree structure with each node having at most two children?

Question 7 of 50

In Python, which function can be used to return a sequence of numbers from 10 to 20 in steps of 2?

Question 8 of 50

Which sorting algorithm divides the data into smaller sections around a pivot and recursively sorts them?

Question 9 of 50

What is the expected time complexity for searching an item in an unbalanced binary search tree?

Question 10 of 50

In a stack, what does the pop operation do?

Question 11 of 50

What data structure is ideal for a collection where each item has a unique identifier and can be quickly accessed by its key?

Question 12 of 50

What data structure is well-suited for implementing a collection of tasks prioritized by their importance?

Question 13 of 50

Which traversal of a binary tree visits the root node before its children?

Question 14 of 50

What is the purpose of remove() in a Python list?

Question 15 of 50

What is a node with two pointers, one to the next and one to the previous node, called in a linked list?

Question 16 of 50

What type of list uses both head and tail pointers for efficient front and back operations?

Question 17 of 50

In a queue, where is the newest element added?

Question 18 of 50

What is the complexity of finding the smallest element in an unsorted list?

Question 19 of 50

Which function in Python returns a list with every nth element from start to end?

Question 20 of 50

What traversal method in a binary tree is used to display nodes in sorted order?

Question 21 of 50

Which data structure is characterized by First-In-First-Out (FIFO) access?

Question 22 of 50

What is the average case time complexity for insertion sort?

Question 23 of 50

In a circular queue, where does the last element connect?

Question 24 of 50

What method in Python dictionaries removes and returns a specified key-value pair?

Question 25 of 50

In a binary search tree, which traversal method visits nodes in descending order?

Question 26 of 50

What complexity does a linear search exhibit?

Question 27 of 50

Which algorithm repeatedly merges sorted halves?

Question 28 of 50

What is the worst-case time complexity of deleting an element in a balanced binary search tree?

Question 29 of 50

Which data structure is optimized for storing elements in key-value pairs and supports fast retrieval?

Question 30 of 50

What is the time complexity of inserting an element in an unsorted array?

Question 31 of 50

Which function removes all elements from a Python list?

Question 32 of 50

What type of traversal in a binary tree is used to process nodes level by level?

Question 33 of 50

What type of data structure is ideal for implementing a collection where duplicates are allowed and order does not matter?

Question 34 of 50

In a binary search, which condition is crucial for the algorithm to work correctly?

Question 35 of 50

What type of node is removed when deleting a leaf node from a binary tree?

Question 36 of 50

What complexity is associated with finding the middle element in an unsorted linked list?

Question 37 of 50

In Python, what does dict.keys() return?

Question 38 of 50

What is a major drawback of linear search?

Question 39 of 50

Which data structure is ideal for implementing a collection that needs fast membership testing?

Question 40 of 50

What is the space complexity of a hash table storing n elements?

Question 41 of 50

Which function in Python removes the first occurrence of a specific value in a list?

Question 42 of 50

What type of algorithm is typically used for pathfinding in a graph?

Question 43 of 50

Which complexity does a binary search exhibit on a sorted array?

Question 44 of 50

In a min-heap, where is the minimum element located?

Question 45 of 50

What data structure is used to store unique elements in no particular order in Python?

Question 46 of 50

Which algorithm is most efficient for sorting large data sets?

Question 47 of 50

What operation is used to add a key-value pair to a dictionary in Python?

Question 48 of 50

What is the complexity of removing an element from a priority queue?

Question 49 of 50

Which data structure uses the LIFO principle?

Question 50 of 50

What traversal of a binary tree first visits the left subtree, then the root, and then the right subtree?

Set 5 complete

You scored 0%

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

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