1/9/25, 9:02 AM 2025 Update C949 WGU Terminology 2025 Update COMPREHENSIVE FREQUENTLY TESTED QUESTIONS and verified ans…
2025 Update C949 WGU Terminology 2025
Update COMPREHENSIVE FREQUENTLY
TESTED QUESTIONS and verified answers WITH
RATIONALES|100% accurate answers | already
graded A+
Practice questions for this set
Learn
Studied 7 terms
Nice work, you're crushing it
Continue studying in Learn
Terms in this set (72)
data structure that stores subitems, with a name
record
associated with each subitem
a data structure that stores an ordered list of items,
with each item is directly accessible by a positional
array index
homogeneous data elements
data structure that stores ordered list of items in
nodes, where each node stores data and has a
linked list
pointer to the next node; can have multiple
subitems
https://quizlet.com/991063509/2025-update-c949-wgu-terminology-2025-update-comprehensive-frequently-tested-questions-and-verified-answers… 1/9
, 1/9/25, 9:02 AM 2025 Update C949 WGU Terminology 2025 Update COMPREHENSIVE FREQUENTLY TESTED QUESTIONS and verified ans…
A data structure that consists of nodes, with one
root node at the base of the tree, and two nodes
(left child and right child) extending from the root,
binary tree and from each child node
can have no children, single left or right, or both
right and left
data structure that stores unordered items by
hash table mapping (or hashing) each item to a location in an
array
a tree that maintains the simple property that a
max-heap node's key is greater than or equal to the node's
childrens' keys
a tree that maintains the simple property that a
min-heap node's key is less than or equal to the node's
childrens' keys
data structure for representing connections among
graph
items, and consists of vertices connected by edges
vertice part of a graph the represents an item in a graph
part of a graph that represents a connection
edge
between to vertices in a graph
what is an advantage of a when inserting a new item at the beginning it causes
linked list over an array? no shift to the data
data type described by predefined user operations,
ADT (Abstract data Type) such as "insert data at rear", without indication how
each operation is implemented
list ADT for holding ordered data
ADT which items are only inserted on or removed
from the top of a stack
stack
LIFO
https://quizlet.com/991063509/2025-update-c949-wgu-terminology-2025-update-comprehensive-frequently-tested-questions-and-verified-answers… 2/9
2025 Update C949 WGU Terminology 2025
Update COMPREHENSIVE FREQUENTLY
TESTED QUESTIONS and verified answers WITH
RATIONALES|100% accurate answers | already
graded A+
Practice questions for this set
Learn
Studied 7 terms
Nice work, you're crushing it
Continue studying in Learn
Terms in this set (72)
data structure that stores subitems, with a name
record
associated with each subitem
a data structure that stores an ordered list of items,
with each item is directly accessible by a positional
array index
homogeneous data elements
data structure that stores ordered list of items in
nodes, where each node stores data and has a
linked list
pointer to the next node; can have multiple
subitems
https://quizlet.com/991063509/2025-update-c949-wgu-terminology-2025-update-comprehensive-frequently-tested-questions-and-verified-answers… 1/9
, 1/9/25, 9:02 AM 2025 Update C949 WGU Terminology 2025 Update COMPREHENSIVE FREQUENTLY TESTED QUESTIONS and verified ans…
A data structure that consists of nodes, with one
root node at the base of the tree, and two nodes
(left child and right child) extending from the root,
binary tree and from each child node
can have no children, single left or right, or both
right and left
data structure that stores unordered items by
hash table mapping (or hashing) each item to a location in an
array
a tree that maintains the simple property that a
max-heap node's key is greater than or equal to the node's
childrens' keys
a tree that maintains the simple property that a
min-heap node's key is less than or equal to the node's
childrens' keys
data structure for representing connections among
graph
items, and consists of vertices connected by edges
vertice part of a graph the represents an item in a graph
part of a graph that represents a connection
edge
between to vertices in a graph
what is an advantage of a when inserting a new item at the beginning it causes
linked list over an array? no shift to the data
data type described by predefined user operations,
ADT (Abstract data Type) such as "insert data at rear", without indication how
each operation is implemented
list ADT for holding ordered data
ADT which items are only inserted on or removed
from the top of a stack
stack
LIFO
https://quizlet.com/991063509/2025-update-c949-wgu-terminology-2025-update-comprehensive-frequently-tested-questions-and-verified-answers… 2/9
