term1 Definition1term2 Definition2term3 Definition3
Please sign in to your Google account to access your documents:
Abstract Data Type
A conceptual model of how data can be stored and the operations that can be carried out on the data.
Data Structure
A common format for storing related data, which is an implementation of an abstract data type.
Array
A set of related data items stored under a single identifier.
Text File
A file containing human-readable characters.
Each line is referred to as a record.
Different items of data are referred to as fields.
Binary File
A file containing a sequence of 0s and 1s. Contains some header information that describes what the binary code represents.
Queue
A data structure where the first item added is the first item removed.
Stack
A data structure where the last item added is the first item removed.
Static Data Structure
A method of storing data where the amount of data stored is fixed.
Dynamic Data Structure.
A method of storing data where the amount of data stored may change as the program is run.
More efficient as memory is taken up when not needed.
Heap
A pool of unused memory that can be allocated to a dynamic data structure.
Dynamic data structures take blocks of memory off the heap if needed and put unused blocks back back when not.
Need help typing ? See our FAQ (opens in new window)
Please sign in to create this set. We'll bring you back here when you are done.
Discard Changes Sign in
Please sign in to add to folders.
Sign in
Don't have an account? Sign Up »
You have created 2 folders. Please upgrade to Cram Premium to create hundreds of folders!