13 Data Representation Flashcards
User-defined data types
data type based on an existing data type or other data types that have been defined by the programmer
Non-composite data types
data type that doesn’t reference any other data type
Enumerated data type
a non-composite data type defined by a given list of all possible values that has implied order.
Pointer data type
a non-composite data type that uses the memory address of where the data is stored
Set
a given list of unordered elements that can use set theory operations such as intersection and union
Serial File Organisation
method of file organization in which data records are physically stored in a file in the order they were added
Sequential File Organization
method of file organization in which data records are stored physically in a file in a given order
Random File Organization
method of file organization in which data records are physically stored in a file in any available position, a hashing algorithm is is used to find the location of the file stored
Hashing Algorithm
mathematical formula used to perform calculation on the key field of the record the result of the calculation gives the address where the record should be found
File Access
method used to physically find a record in a file
Sequential Access
method of file access in which records are searched one after another from the start till required file is found
Direct Access
method of file access in which record can be physically found without reading other records.
Mantissa
fractional part of a floating point number
Exponent
power of 2 that the mantissa is raised to in a floating point number
Binary Floating-Point Number
a binary number written in the form M x 2^e (M is mantissa and e is exponent)