1 for specific request mail
C949 WGU Terminology Questions and Correct
Answers | Latest Update
record Ans: data structure that stores subitems, with a name associated
with each subitem
array Ans: a data structure that stores an ordered list of items, with each
item is directly accessible by a positional index
homogeneous data elements
linked list Ans: data structure that stores ordered list of items in nodes,
Assignment Expert
where each node stores data and has a pointer to the next node; can have
multiple subitems
Guru01 - Stuvia
binary tree 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, and from each child node
2026
can have no children, single left or right, or both right and left
©
hash table Ans: data structure that stores unordered items by mapping
(or hashing) each item to a location in an array
max-heap Ans: a tree that maintains the simple property that a node's
key is greater than or equal to the node's childrens' keys
min-heap Ans: a tree that maintains the simple property that a node's
key is less than or equal to the node's childrens' keys
graph Ans: data structure for representing connections among items,
and consists of vertices connected by edges
vertice Ans: part of a graph the represents an item in a graph
edge Ans: part of a graph that represents a connection between to
vertices in a graph
, 2 for specific request mail
what is an advantage of a linked list over an array? Ans: when inserting a
new item at the beginning it causes no shift to the data
ADT (Abstract data Type) Ans: data type described by predefined user
operations, such as "insert data at rear", without indication how each
operation is implemented
list Ans: ADT for holding ordered data
stack Ans: ADT which items are only inserted on or removed from the
top of a stack
Assignment Expert
LIFO
Queue Ans: ADT in which items are inserted at the end of the queue and
Guru01 - Stuvia
removed from the front of the queue
FIFO
deque ("deck") Ans: ADT in which items can be removed at both the front
2026
and back
©
Bag Ans: ADT for stroing items in which the order does not matter and
duplicate items are allowed
Set Ans: ADT for collection of distinct items
common underlying DS: Binary search tree, hash table
Priority Queue Ans: a queue in which the highest-priority elements are
removed first; within a priority value, the earliest arrival is removed first.
common underlying DS: heap
Dictionary (map) Ans: ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
List, Bag Ans: ADTs with array, linked list as common underlying DS
C949 WGU Terminology Questions and Correct
Answers | Latest Update
record Ans: data structure that stores subitems, with a name associated
with each subitem
array Ans: a data structure that stores an ordered list of items, with each
item is directly accessible by a positional index
homogeneous data elements
linked list Ans: data structure that stores ordered list of items in nodes,
Assignment Expert
where each node stores data and has a pointer to the next node; can have
multiple subitems
Guru01 - Stuvia
binary tree 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, and from each child node
2026
can have no children, single left or right, or both right and left
©
hash table Ans: data structure that stores unordered items by mapping
(or hashing) each item to a location in an array
max-heap Ans: a tree that maintains the simple property that a node's
key is greater than or equal to the node's childrens' keys
min-heap Ans: a tree that maintains the simple property that a node's
key is less than or equal to the node's childrens' keys
graph Ans: data structure for representing connections among items,
and consists of vertices connected by edges
vertice Ans: part of a graph the represents an item in a graph
edge Ans: part of a graph that represents a connection between to
vertices in a graph
, 2 for specific request mail
what is an advantage of a linked list over an array? Ans: when inserting a
new item at the beginning it causes no shift to the data
ADT (Abstract data Type) Ans: data type described by predefined user
operations, such as "insert data at rear", without indication how each
operation is implemented
list Ans: ADT for holding ordered data
stack Ans: ADT which items are only inserted on or removed from the
top of a stack
Assignment Expert
LIFO
Queue Ans: ADT in which items are inserted at the end of the queue and
Guru01 - Stuvia
removed from the front of the queue
FIFO
deque ("deck") Ans: ADT in which items can be removed at both the front
2026
and back
©
Bag Ans: ADT for stroing items in which the order does not matter and
duplicate items are allowed
Set Ans: ADT for collection of distinct items
common underlying DS: Binary search tree, hash table
Priority Queue Ans: a queue in which the highest-priority elements are
removed first; within a priority value, the earliest arrival is removed first.
common underlying DS: heap
Dictionary (map) Ans: ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
List, Bag Ans: ADTs with array, linked list as common underlying DS
