We are guaranteed that there will not be more than one transaction record for a particular Student.
The program must be able to detect two kinds of error;
Download Transfer.Dat and
save it to the same place.
|
|
|
|
Student Id |
|
|
|
Old Course Code |
|
|
|
New Course Code |
|
|
|
The students file is a sequential file ordered on ascending StudentId.
The records in the students file and the new file have the same description.
Records in these files have the following description;
|
|
|
|
Student Id |
|
|
|
Student Name |
|
|
|
Surname |
|
|
|
Initials |
|
|
|
DateOfBirth |
|
|
|
Year |
|
|
|
Month |
|
|
|
Day |
|
|
|
Course Code |
|
|
|
Grant |
|
|
|
Gender |
|
|
|
You need to work out what must to be done to solve the problem before you can write the program to solve it. One way of finding out what must be done is to solve the problem yourself on paper and note what you had to do. You can do this by running through some simple test data.
In the example test data which follows T represents the records in the transaction file and S represents the records in the student file. The numbers represent the StudentIds of the records. A "y" following the transaction number means the CourseCodes are ok, an "n" means that the CourseCodes do not match and an "x" means it is not relevant.
![]() |
![]() |
![]() |
|