CHAP 13.
what is user-defined data types?
-> A non-existing data type which the programmer has created fo
r use within a program to meet up some specific criteria.
Differ data types:
1.non-composite data
+ Data defined without the referencing to other data type
a) Enumerated -> [TYPE <identifier> = (value1, value2, value3, ... )] b) P
ointer -> [TYPE <pointer> = ^<Typename>] refer to a memory location
2.composite data
+ Data defined referencing to other data type
CHAP 13.2
why organise file?
-> files are stored in order to be able to find data efficiently. Data i
s stored as RECORDS in file.
Differ file organisation method:
1. serial file organisation
+ Records of data are stored in chronological order in file.
+ Used for temporary files storing transaction.
2. sequential file organisation
+ Records of data are store in order which based on the key field
of the records (unique identifier) in file.
3. random file organisation
+ Records of data are sotred in random order that is available at
the time.
+ Can find the data using hashing algorithm.
Differ file access method:
1. sequential access
+ Searches for the records one after another from the begining til
l records is found.
benefits: less effort, simplicity (payroll systemt, month bill)
2. direct access
+ Can be accessed directly without having to read all preceding r
ecords.
+ Can find using key field or hashing algorithm
Hashing algorithm
1. open hash where the record is stored in the next free space.
2. closed hash where an overflow is occurs, records is stored in t
he next available in overflow area.
