Chapter 13

Question 1

user-defined datatype

Answer 1

data type based on existing data type or other data types that have been defined by the programmer.

Question 2

Non-composite data type

Answer 2

data type that does not reference any other data types.

Question 3

Enumerated data type

Answer 3

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

Question 4

Pointer data type

Answer 4

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

Question 5

Set

Answer 5

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

Question 6

Serial File Organization

Answer 6

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.

Question 7

Sequential File Organization

Answer 7

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

Question 8

Random File Organization

Answer 8

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.

Question 9

Hashing Algorithm (File Access)

Answer 9

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

Question 10

File Access

Answer 10

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

Question 11

Sequential Access

Answer 11

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.

Question 12

Direct Access

Answer 12

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