TERM 1
data type
DEFINITION 1
a named set of values and a set of operations on those
values. we associate some name with a data type so that we
may use it. For example, the data type called 'boolean' is
made up of (a) {false, true} - a set of values, and (b) {and,
or, not} - a set of operations on those values.
TERM 2
data structures
DEFINITION 2
is a data type that does have access ible component parts. For
example a student record, an array o r list of values, even a string
which may provide access to the individual char acters that make it
up. Data structures can be supporte d by the programming
language or can be supported by prog rammer written code, for
example when the programmer cre ates a linked list of nodes or
even when he defines a class for obje cts that have two or more
data parts to them.
TERM 3
ADT
DEFINITION 3
Abstract data type. we use an abstract model that specifies
the type of data stored and the operations that support the
data
TERM 4
data
stack
DEFINITION 4
is made up of activation records. We use the term stack
since a new activation record is 'pushed' onto the stack each
time we enter a new block and that same activation record is
'popped' off of the data stack when execution of the block of
code terminates.
TERM 5
dynamic allocation
DEFINITION 5
Definition
