New Jersey Institute of Technology (NJIT)
Computer and Information Science Department (CIS)
CIS365-001: File Structures and Management, Fall 1999
Professor: Michael Bieber

Homework 6: Traditional File Update

Due

Wednesday, October 20, 1999 at the start of class
(but don't skip class to finish this assignment!)

Goal

To understand a very common application with sequential files.

Reading

Read Stern & Stern, chapters 6 and 8; Uckan Chapter 2,

Assignment

Implement the revised traditional file update algorithm I gave out in class and posted on the class Web site. (Do not implement the text's version, and do not do in situ update.)

Very Important: I revised the algorithm to help you:

• avoid any "go to" commands (use only PERFORM UNTIL loops)
• avoid any recursion (no procedure should perform itself directly or indirectly).

Note that your transaction file has multiple record types in a single input file, as described in Chapter 2 of the Uckan text Volume 2 (or Chapter 11 of the Uckan text combined). Be sure that you code this as a multi-record file with fixed length records, as the text in Chapter 11 describes. This means that the transaction file will have multiple 01 declarations for a single FD. Chapter 2 (i.e., in Volume 2 of the Uckan text) also covers declaring multi-record files.

You will have 2 input files (old master and transaction) and two output files (new master and error) in this program. Give each a different file name and ASSIGN TO value. Each input file will need a separate end-of-file-flag, as described in the traditional file update algorithm.

Test your program on the master and transaction files you created in homework #2b.

What to Turn In

Turn in listings of:

• your program
• your old master file
• your transaction file
• your new master file
• your error file

---> Staple these together. Put your name on every page.

This page: http://www.cis.njit.edu/~bieber/CIS365F99/hw6.html