Unit XIII - Data representation (A Level CS) - Key terms

Front

What is a user-defined data type?

Back

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

Front

What is a non-composite data type?

Back

A data type that does not reference any other data types.

Front

What is an enumerated data type?

Back

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

Front

What is a pointer data type?

Back

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

Front

What is a set in data types?

Back

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

Front

What is serial file organization?

Back

A method of file organization in which records of data are physically stored in a file, one after another, in the order they were added to the file.

Front

What is sequential file organization?

Back

A method of file organization in which records of data are physically stored in a file, one after another, in a given order.

Front

What is random file organization?

Back

A method of file organization 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.

Front

What is a hashing algorithm in file access?

Back

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.

Front

What is file access?

Back

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