+
Cards In This Set
| Front | Back |
|
Abstract data type (ADT)
|
A container whose properties (data and operations) are specified independently of any particular implementation
|
|
Adjacent Vertices
|
Two vertices that are connected by an edge
|
|
Arguments
|
1) The identifiers listed in parenthesis on the subprogram call2) Sometimes called actual parameters
|
|
Binary Tree
|
An abstract composite structure with a unique starting node called the root, in which each node is capable of two child nodes, and in which a unique path exists from the root to every other node
|
|
Containers
|
Objects whose role is to hold and manipulate other objects
|
|
Data Structure
|
The implementation of a composite data field in an abstract data type
|
|
Directed graph (digraph)
|
A graph in which each edge is directed from one vertex to another (or the same) vertex
|
|
Edge (arc)
|
A pair of vertices representing a connection between two nodes in a graph
|
|
Graph
|
A data structure that consists of a set of nodes and a set of edges that relate the nodes to each other
|
|
Leaf Node
|
A tree node that has no children
|
|
Linked structure
|
An implementation of a container where the items are stored together with information on where the next item can be found
|
|
Parameters
|
1) The identifiers listed in parenthesis beside the subprogram name2) Sometimes called formal parameters
|
|
Path
|
1) A text designation of the location of a file or subdirectory in a file system2) A sequence of vertices that connects two nodes in a graph
|
|
Reference Parameter
|
A parameter that expects the address of its argument to be passed by the calling unit (put on the message board)
|
|
Root
|
The unique starting node in a tree
|
