WGU C949 DATA STRUCTURES AND
ALGORITHMS COMPREHENSIVE STUDY
GUIDE 2026 FULL QUESTIONS AND
SOLUTIONS GRADED A+
◍ The left child is visited before the node, then the right child.
Answer: In-order
◍ For a function to qualify as a hash function it has to have what three
properties.
Answer: StabilityUniformitySecurity
◍ What are in-order traversals useful for?.
Answer: Sorting trees from least to greatest
◍ Which method removes all keys from a dictionary?.
Answer: keys();
◍ Which type of function allows for items to be added or removed from the
beginning or end?.
Answer: Doubly Ended Queue (deque)
◍ The insertion complexity on average of a binary search tree.
Answer: O(long n)
◍ A data structure for representing connections among items, and consists of
vertices connected by edges..
Answer: graph
◍ A hash function always generates the same output given the same input.
Answer: Stability
◍ A container where data is stored in nodes consisting of a single data item
, and a reference to the next node.
Answer: Linked List
◍ Given a hash table with 100 buckets and modulo hash function, in which
bucket will HashInsert(table, item 334) insert item 334?.
Answer: 34
◍ A data structure that stores an ordered list of items, with each item is
directly accessible by a positional index..
Answer: Array
◍ The left and right children are visited before the node.
Answer: Post-order
◍ Linking together complex nodes into a single structure.
Answer: Linked List
◍ Finds the first node whose value equals the provided argument.
Answer: Find
◍ The node is visited before it's children.
Answer: Pre-order
◍ Containers that contain key-value pairs.
Answer: Associative Array
◍ These can have any value, but cannot have matching keys.
Answer: Dictionaries
◍ A First-in, First-out (FIFO) container.
Answer: Queue
◍ The maximum amount of edges between that node and a leaf.
Answer: Height
◍ An example of this type of function is when there is a nested loop that
iterates of two distinct collections of data.
Answer: O(nm)
◍ How can a leaf node be removed from a tree?.
ALGORITHMS COMPREHENSIVE STUDY
GUIDE 2026 FULL QUESTIONS AND
SOLUTIONS GRADED A+
◍ The left child is visited before the node, then the right child.
Answer: In-order
◍ For a function to qualify as a hash function it has to have what three
properties.
Answer: StabilityUniformitySecurity
◍ What are in-order traversals useful for?.
Answer: Sorting trees from least to greatest
◍ Which method removes all keys from a dictionary?.
Answer: keys();
◍ Which type of function allows for items to be added or removed from the
beginning or end?.
Answer: Doubly Ended Queue (deque)
◍ The insertion complexity on average of a binary search tree.
Answer: O(long n)
◍ A data structure for representing connections among items, and consists of
vertices connected by edges..
Answer: graph
◍ A hash function always generates the same output given the same input.
Answer: Stability
◍ A container where data is stored in nodes consisting of a single data item
, and a reference to the next node.
Answer: Linked List
◍ Given a hash table with 100 buckets and modulo hash function, in which
bucket will HashInsert(table, item 334) insert item 334?.
Answer: 34
◍ A data structure that stores an ordered list of items, with each item is
directly accessible by a positional index..
Answer: Array
◍ The left and right children are visited before the node.
Answer: Post-order
◍ Linking together complex nodes into a single structure.
Answer: Linked List
◍ Finds the first node whose value equals the provided argument.
Answer: Find
◍ The node is visited before it's children.
Answer: Pre-order
◍ Containers that contain key-value pairs.
Answer: Associative Array
◍ These can have any value, but cannot have matching keys.
Answer: Dictionaries
◍ A First-in, First-out (FIFO) container.
Answer: Queue
◍ The maximum amount of edges between that node and a leaf.
Answer: Height
◍ An example of this type of function is when there is a nested loop that
iterates of two distinct collections of data.
Answer: O(nm)
◍ How can a leaf node be removed from a tree?.
