A Level CS (9618) 13 Data Representation

call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/17

flashcard set

Earn XP

Description and Tags

13.1 User-defined data types 13.2 File organisation and access 13.3 Floating-point numbers, representation and manipulation

Last updated 6:34 AM on 1/5/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Add student to class section state
Add studentsNo students in these sections. Invite them to track progress!

18 Terms

1
New cards

User-defined data type

"a data type based on an existing data type or other data types that have been defined by a programmer."

2
New cards

Non-composite data type

"a data type that does not reference any other data types."

3
New cards

Enumerated data type

"a non-composite data type defined by a given list of all possible values that has an implied order."

4
New cards

Pointer data type

"a non-composite data type that uses the memory address of where the data is stored."

5
New cards

Set

"a given list of unordered elements that can use set theory operations such as intersection and union."

6
New cards

Serial file organisation

"a method of file organisation in which records of data are physically stored in a file

7
New cards

Sequential file organisation

"a method of file organisation in which records of data are physically stored in a file

8
New cards

Random file organisation

"a method of file organisation in which records of data are physically stored in a file in any available position; the location of any record in the file is found by using a hashing algorithm on the key field of a record."

9
New cards

Hashing algorithm (file access)

"a mathematical formula used to perform a calculation on the key field of the record; the result of the calculation gives the address where the record should be found."

10
New cards

File access

"the method used to physically find a record in the file."

11
New cards

Sequential access

"a method of file access in which records are searched one after another from the physical start of the file until the required record is found."

12
New cards

Direct access

"a method of file access in which a record can be physically found in a file without physically reading other records."

13
New cards

Mantissa

"the fractional part of a floating point number."

14
New cards

Exponent

"the power of 2 that the mantissa (fractional part) is raised to in a floating-point number."

15
New cards

Binary floating-point number

"a binary number written in the form M ร— 2E (where M is the mantissa and E is the exponent)."

16
New cards

Normalisation (floating-point)

"a method to improve the precision of binary floating-point numbers; positive numbers should be in the format 0.1 and negative numbers in the format 1.0."

17
New cards

Overflow

"the result of carrying out a calculation which produces a value too large for the computer's allocated word size."

18
New cards

Underflow

"the result of carrying out a calculation which produces a value too small for the computer's allocated word size."