4.2.1 Data Structures and Abstract Data Types Flashcards
Define Data Structures.
A data structure is a format used to store, organise and manage data in a way that allows efficient access and modification for the needs of the program.
Define Abstract Data Type.
They don’t exist as data structures in their own rights, instead they use other structures such as arrays.
A conceptual model that describes how data is organised and which operations can be carried out on the data from the perspective of an end user who does not need to know how this is implemented.
Define Arrays.
A data structure for storing a finite, ordered set of data of the same data type within a single identifier.
Define Multi-Dimensional Arrays.
An array where each data item is located using multiple indices.
Define Single-Dimensional Arrays.
An array where each data item can be located using a single index.
Define Files.
Information is stored by computers as a series of files. Each file is made up of records which are composed of a number of fields.
Define Binary File.
An organised collection of records where data is stored in binary.
Define Fields.
A single item of data.
Define Records.
A data structure that stores multiple fields, organised based on attributes, within a single line of a file.
Define Text File.
An organised collection of records where data is stored in human-readable characters.
Define Dynamic Structures.
A data structure whose memory allocation size can change throughout the execution of the program.
As the number of memory locations required is not fixed, each item of the data structure is stored alongside a reference of where the next item is stored in memory.
Define Static Structures.
A data structure that is allocated a fixed amount of memory space, which does not change throughout the execution of the program.
It is declared in memory as a series of sequential, contiguous memory locations so that the next element will be the memory location next door.
