C949 WGU Terminology with
Complete Questions and Answers
record - ANSWER-data structure that stores subitems, with a name
associated with each subitem
array - ANSWER-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 - ANSWER-data structure that stores *ordered* list of items in
nodes, where each node stores data and has a pointer to the next node; can
have multiple subitems
binary tree - ANSWER-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
, can have no children, single left or right, or both right and left
what is an advantage of a linked list over an array? - ANSWER-when inserting
a new item at the beginning it causes no shift to the data
ADT (Abstract data Type) - ANSWER-data type described by predefined user
operations, such as "insert data at rear", without indication how each
operation is implemented
hash table - ANSWER-data structure that stores *unordered* items by
mapping (or hashing) each item to a location in an array
Priority Queue - ANSWER-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) - ANSWER-ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
Complete Questions and Answers
record - ANSWER-data structure that stores subitems, with a name
associated with each subitem
array - ANSWER-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 - ANSWER-data structure that stores *ordered* list of items in
nodes, where each node stores data and has a pointer to the next node; can
have multiple subitems
binary tree - ANSWER-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
, can have no children, single left or right, or both right and left
what is an advantage of a linked list over an array? - ANSWER-when inserting
a new item at the beginning it causes no shift to the data
ADT (Abstract data Type) - ANSWER-data type described by predefined user
operations, such as "insert data at rear", without indication how each
operation is implemented
hash table - ANSWER-data structure that stores *unordered* items by
mapping (or hashing) each item to a location in an array
Priority Queue - ANSWER-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) - ANSWER-ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
