C949 WGU Terminology QUESTIONS AND ANSWERS VERIFIED

C949 WGU Terminology QUESTIONS AND ANSWERS VERIFIEDdata structure that stores subitems, with a name associated with each subitem record a data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements array 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 linked list 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 binary tree data structure that stores unordered items by mapping (or hashing) each item to a location in an array hash table a tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys max-heap a tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys min-heap data structure for representing connections among items, and consists of vertices connected by edges graph part of a graph the represents an item in a graph vertice part of a graph that represents a connection between to vertices in a graph edge when inserting a new item at the beginning it causes no shift to the data what is an advantage of a linked list over an array? data type described by predefined user operations, such as "insert data at rear", without indication how each operation is implemented ADT (Abstract data Type) ADT for holding ordered data list ADT which items are only inserted on or removed from the top of a stack LIFO stack ADT in which items are inserted at the end of the queue and removed from the front of the queue FIFO Queue ADT in which items can be removed at both the front and back deque ("deck") ADT for stroing items in which the order does not matter and duplicate items are allowed Bag ADT for collection of distinct items common underlying DS: Binary search tree, hash table Set 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 Priority Queue ADT that associates (or maps) keys with values common underlying DS: has table, binary search tree Dictionary (map) ADTs with array, linked list as common underlying DS List, Bag ADTs with linked list as their only common underlying DS Stack, Queue, Deque ADT operation for a queue that returns but does not remove item at the front of the queue Peek unique identifier that describes the object identity symbol for floored division // behaves similar to a list but is immutable -- once created the els can not be chagned const array/list tuple