7517 08 Queues and Stacks

Front

stack

Back

a data structure where the last item added is the first item removed.

Front

LIFO

Back

last in first out refers to a data structure such as a stack where the last item of data entered is the first item of data to leave.

Front

pointer

Back

a data item that identifies a particular element in a data structure - normally the front or rear

Front

stack frame

Back

a collection of data about a subroutine call.

Front

call frame

Back

a special type of stack used to store information about active subroutines and functions within a program.

Front

interrupt

Back

a signal sent by a device or program to the processor requesting its attention.

Front

nesting

Back

placing one set of instructions within another set of instructions,

Front

recursion

Back

the process of a subroutine calling itself.

Front

queue

Back

a data structure where the first Item added is the first item removed.

Front

FIFO

Back

first in first out refers to a data structure such as a queue where the first item of data entered is the first item of data to leave,