WGU C949 FINAL TEST 2026 QUESTIONS
WITH CORRECT ANSWERS GRADED A+
◍ dynamic array.
Answer: variable-size, ordered data and indexed access ADT
◍ Post analysis.
Answer: happens after implementation
◍ Abstract Data Type (ADT).
Answer: A data type whose properties are specified without prior knowledge
of how they'll work
◍ Why does a doubly-linked list implementation of insertion sort allow
traversing the list backward?.
Answer: Because the nodes are connected in both directions
◍ binary tree.
Answer: each node has 0 to 2 children
◍ vertex.
Answer: item in graph
◍ max-heap.
Answer: tree w node key >= child keys
◍ What can be said about the height of a Binary Search Tree when items are
inserted in random order?.
Answer: It keeps a BST's height near the minimum.
◍ dictionary.
Answer: key, value pair ADT
◍ Nonlinear Data Structures.
Answer: Elements are not in sequential orderEx: tree & graph
,◍ Algorithm.
Answer: A set of instructions followed step by step to solve a problem
◍ heuristic.
Answer: speed prioritized over optimization and accuracy
◍ set.
Answer: distinct items ADT
◍ deque.
Answer: double-ended ADT
◍ Binary Tree.
Answer: a data structure in which each node stores data and has up to two
childrenthe top node is the root
◍ In a hash table using linear probing, what happens if the algorithm
encounters an empty-after-removal bucket during a remove operation?.
Answer: the algorithm keeps probing
◍ inorder traversal.
Answer: left subtree, root, right subtree
◍ data structure.
Answer: organize and store data
◍ what are elements in a hash table called?.
Answer: bucket
◍ Characteristics of an Algorithm.
Answer: 1. Clear & unambiguous2. Well-defined inputs3. Well-defined
outputswhat will be produced?4. Finite-ness5. Feasible6. Language
independent
◍ priority queue.
Answer: priority ordered items ADT
◍ How does using a dummy node simplify the implementation of linked lists?.
Answer: It removes the need to check for a null head in list operations
, ◍ Full Binary Tree.
Answer: Each node has 0 or 2 children
◍ what does .pop() do for a stack.
Answer: removes the 1st element from the top of the list
◍ shortest path.
Answer: shortest route from start point to end point
◍ list.
Answer: ordered data ADT
◍ What uses the first in first out method.
Answer: queue
◍ List examples of data structures.
Answer: 1. Record2. Array3. Linked list4. Binary Tree5. Hash table6.
Heap7. Graph
◍ computational problem.
Answer: input, question, desired output
◍ B-Tree.
Answer: a tree where nodes can have up to K-1 keys and up to K children
◍ Factors of an Algorithm.
Answer: 1. Modularity (can be broken down)2. Correctness3.
Maintainability (no major changes when redefining the algorithm)4.
Functionality5. Robustness (ability to define problem clearly)6. User
friendly7. Simplicity8. Extensibility (Future developers can understand it &
build upon it)
◍ Linear Probing.
Answer: a strategy for resolving collisions, by placing the new key into the
closest following empty cell
◍ record.
Answer: fields w names
WITH CORRECT ANSWERS GRADED A+
◍ dynamic array.
Answer: variable-size, ordered data and indexed access ADT
◍ Post analysis.
Answer: happens after implementation
◍ Abstract Data Type (ADT).
Answer: A data type whose properties are specified without prior knowledge
of how they'll work
◍ Why does a doubly-linked list implementation of insertion sort allow
traversing the list backward?.
Answer: Because the nodes are connected in both directions
◍ binary tree.
Answer: each node has 0 to 2 children
◍ vertex.
Answer: item in graph
◍ max-heap.
Answer: tree w node key >= child keys
◍ What can be said about the height of a Binary Search Tree when items are
inserted in random order?.
Answer: It keeps a BST's height near the minimum.
◍ dictionary.
Answer: key, value pair ADT
◍ Nonlinear Data Structures.
Answer: Elements are not in sequential orderEx: tree & graph
,◍ Algorithm.
Answer: A set of instructions followed step by step to solve a problem
◍ heuristic.
Answer: speed prioritized over optimization and accuracy
◍ set.
Answer: distinct items ADT
◍ deque.
Answer: double-ended ADT
◍ Binary Tree.
Answer: a data structure in which each node stores data and has up to two
childrenthe top node is the root
◍ In a hash table using linear probing, what happens if the algorithm
encounters an empty-after-removal bucket during a remove operation?.
Answer: the algorithm keeps probing
◍ inorder traversal.
Answer: left subtree, root, right subtree
◍ data structure.
Answer: organize and store data
◍ what are elements in a hash table called?.
Answer: bucket
◍ Characteristics of an Algorithm.
Answer: 1. Clear & unambiguous2. Well-defined inputs3. Well-defined
outputswhat will be produced?4. Finite-ness5. Feasible6. Language
independent
◍ priority queue.
Answer: priority ordered items ADT
◍ How does using a dummy node simplify the implementation of linked lists?.
Answer: It removes the need to check for a null head in list operations
, ◍ Full Binary Tree.
Answer: Each node has 0 or 2 children
◍ what does .pop() do for a stack.
Answer: removes the 1st element from the top of the list
◍ shortest path.
Answer: shortest route from start point to end point
◍ list.
Answer: ordered data ADT
◍ What uses the first in first out method.
Answer: queue
◍ List examples of data structures.
Answer: 1. Record2. Array3. Linked list4. Binary Tree5. Hash table6.
Heap7. Graph
◍ computational problem.
Answer: input, question, desired output
◍ B-Tree.
Answer: a tree where nodes can have up to K-1 keys and up to K children
◍ Factors of an Algorithm.
Answer: 1. Modularity (can be broken down)2. Correctness3.
Maintainability (no major changes when redefining the algorithm)4.
Functionality5. Robustness (ability to define problem clearly)6. User
friendly7. Simplicity8. Extensibility (Future developers can understand it &
build upon it)
◍ Linear Probing.
Answer: a strategy for resolving collisions, by placing the new key into the
closest following empty cell
◍ record.
Answer: fields w names
