Chapter Eight - Abstract Data Types and Subprograms Flashcards
1
Q
abstract data type (ADT)
A
- CONTAINER in which DATA items are STORED, and each exhibits specific behaviors (e.g. stacks, queues, binary trees…)
2
Q
data structure
A
- implementation of a COMPOSITE(made up of several parts) DATA FIELD in an abstract data type.
3
Q
containers
A
- objects whose role is to HOLD & MANIPULATE other objects
4
Q
linked structure
A
- implementation of a CONTAINER where the items are stored together with information on where the NEXT item can be found (based on concept of NODE > data + pointer to next node)
5
Q
binary tree
A
- abstract composite structure; starting node: ROOT; each node is capable of having two child nodes
6
Q
root
A
- unique starting node in a tree
7
Q
leaf node
A
- tree node that has NO CHILDREN
8
Q
graph
A
- data structure (consists of NODES and EDGES that relate the nodes to each other)
9
Q
vertex
A
- a NODE in a graph
10
Q
edge (arc)
A
- the lines that connect the nodes
11
Q
undirected graph
A
- graph in which EDGES have no direction (e.g. roads that run b/w cities are two way paths)
12
Q
directed graph (digraph)
A
- graph where EDGES is directed from one vertex to another (e.g. vertices representing a flight from one city to another, the path is not a two way)
13
Q
adjacent vertices
A
- two VERTICES that are connected by an EDGE
14
Q
path
A
- SEQUENCE OF VERTICES that connects TWO NODES in a graph
15
Q
parameter list
A
- list of identifiers or values with which the subprogram is to work; appears in parenthesis beside the subprogram name.
