Flashcards
Computing A-Level Chapter 7
Cards in this deck (13)
- 1Data Structurea common format for storing large volumes of related data, which is an implementation of an abstract data type
- 2Abstract Data Typea conceptual model of how data can be stored and the operations that can be carried out on the data
- 3Filea collection of related data
- 4Arraya set of related data items stored under a single identifier. Can work on more than 1 dimension
- 5Text Filea file that contains human-readable characters
- 6Binary Filestores data as sequences of 0's and 1's
- 7Recordone line of a text file
- 8Fieldan item of data
- 9Queuea data structure where the first item added is the first item removed
- 10Stacka data structure where the last item added is the first removed
- 11Static Data Structurea method of storing data where the amount of data stored is fixed
- 12Dynamic Data Structurea method of storing data where the amount of data stored will vary as the program is being run
- 13Heapa pool of unused memory that can be allocated to a dynamic s
data structure
Information
- Description
- A level Computing Flashcards on Computing A-Level Chapter 7, created by Sam Carvell on 18/05/2018.
- Created by
- Sam Carvell
- Views
- 0
- Rating