C949 WGU Terminology
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
hash table -answer data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
max-heap -answer 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 -answer a tree that maintains the simple property that a node's key is less
than or equal to the node's childrens' keys
,graph -answer data structure for representing connections among items, and consists
of vertices connected by edges
vertice -answer part of a graph the represents an item in a graph
edge -answer part of a graph that represents a connection between to vertices in a
graph
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
list -answer ADT for holding ordered data
stack -answer ADT which items are only inserted on or removed from the top of a
stack
LIFO
Queue -answer ADT in which items are inserted at the end of the queue and removed
from the front of the queue
FIFO
,deque ("deck") -answer ADT in which items can be removed at both the front and
back
Bag -answer ADT for stroing items in which the order does not matter and duplicate
items are allowed
Set -answer ADT for collection of distinct items
common underlying DS: Binary search tree, hash table
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
List, Bag -answer ADTs with array, linked list as common underlying DS
Stack, Queue, Deque -answer ADTs with linked list as their only common underlying
DS
Peek -answer ADT operation for a queue that returns but does not remove item at the
front of the queue
, identity -answer unique identifier that describes the object
// -answer symbol for floored division
tuple -answer behaves similar to a list but is immutable -- once created the els can
not be chagned
const array/list
for i in range(0) -answer sets i to 0 during the first iteration of the for loop, i to 1
during the second iteration, and finally i to 2 on the third iteration. The value within the
parentheses is not included in the generated sequence.
range(5, -6, -1) -answer code for every int form 5 down to -5
range(10, 21, 2) -answer code for every 2nd int from 10 to 20
polymorphism -answer functional behavior depends on the argument types
dynamic typing -answer used to determine the type of objects as a program executes;
Python
Static Typing -answer requires the programmer to define the type of every variable
and every function parameter in a program's source code; C, C++
class -answer keyword that can be used to create a user-defined type of object
containing groups of related vars and fxns
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
hash table -answer data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
max-heap -answer 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 -answer a tree that maintains the simple property that a node's key is less
than or equal to the node's childrens' keys
,graph -answer data structure for representing connections among items, and consists
of vertices connected by edges
vertice -answer part of a graph the represents an item in a graph
edge -answer part of a graph that represents a connection between to vertices in a
graph
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
list -answer ADT for holding ordered data
stack -answer ADT which items are only inserted on or removed from the top of a
stack
LIFO
Queue -answer ADT in which items are inserted at the end of the queue and removed
from the front of the queue
FIFO
,deque ("deck") -answer ADT in which items can be removed at both the front and
back
Bag -answer ADT for stroing items in which the order does not matter and duplicate
items are allowed
Set -answer ADT for collection of distinct items
common underlying DS: Binary search tree, hash table
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
List, Bag -answer ADTs with array, linked list as common underlying DS
Stack, Queue, Deque -answer ADTs with linked list as their only common underlying
DS
Peek -answer ADT operation for a queue that returns but does not remove item at the
front of the queue
, identity -answer unique identifier that describes the object
// -answer symbol for floored division
tuple -answer behaves similar to a list but is immutable -- once created the els can
not be chagned
const array/list
for i in range(0) -answer sets i to 0 during the first iteration of the for loop, i to 1
during the second iteration, and finally i to 2 on the third iteration. The value within the
parentheses is not included in the generated sequence.
range(5, -6, -1) -answer code for every int form 5 down to -5
range(10, 21, 2) -answer code for every 2nd int from 10 to 20
polymorphism -answer functional behavior depends on the argument types
dynamic typing -answer used to determine the type of objects as a program executes;
Python
Static Typing -answer requires the programmer to define the type of every variable
and every function parameter in a program's source code; C, C++
class -answer keyword that can be used to create a user-defined type of object
containing groups of related vars and fxns
