WGU C949 Data Structures and Algorithms I Objective Assessment 2026/2027 | Questions & Detailed Answers

WGU C949 DATA STRUCTURES AND ALGORITHMS I –
OBJECTIVE

ASSESSMENT EXAM QUESTIONS & CORRECT
DETAILED ANSWERS 2026/2027 LATEST



The first and last nodes of a doubly linked list should
have a value of null



Adds a value to the beginning of the list

AddHead




Adds a value at the end of the linked list

AddTail




Finds the first node whose value equals the provided argument

Find




Returns true if the specified value exists in the list, false otherwise

Contains

,Removes the first node on the list whose value is equal to the argument

Remove




A doubly linked list where the values are inserted and sorted in order

Sorted List




Adds the specified item to the linked list in the sort order of the item
type

Add




A way of organizing, storing, and performing operations on data

Data Structure




A data structure that stores subitems, with a name associated
with each subitem. record



A data structure that stores an ordered list of items, with each item is
directly accessible by a positional index.

Array

, A data structure that stores ordered list of items in nodes, where each
node stores data and has a pointer to the next node.

linked list




A data structure in which each node stores data and has up to two
children, known as a left child and a right child. binary tree



A data structure that stores unordered items by mapping (or hashing)
each item to a location in an array. hash table




A functions whose cost scales linearly with the size of the input

O(n)


Iterating over a collection of data once often indicates an algorithm.
(alphabet for-loop example) O(n)


A functions whose cost scales logarithmically with the input size

O(log n)


Which type of function works by breaking down large problem into
smaller and smaller chunks?

O(log n)