(File Matching) Exercise 11.3 asked the reader to write a series of single statements. Actually, these statements form the core of an important type of file-processing
As transactions occur (i.e., sales are made and cash payments arrive in the mail), they’re entered into a file. At the end of each business period (i.e., a month for some companies, a week for others and a day in some cases) the file of transactions (called “trans.dat” in Exercise 11.3) is applied to the master file (called “oldmast.dat” in Exercise 11.3), thus updating each account’s record of purchases and payments. After each of these updates runs, the master file is rewritten as a new file (“newmast.dat”), which is then used at the end of the next business period to begin the updating process again.
File-matching programs must deal with certain problems that do not exist in single-file programs. For example, a match does not always occur. A customer on the master file might not have made any purchases or cash payments in the current business period, and therefore no record for this customer will appear on the transaction file. Similarly, a customer who did make some purchases or cash payments might have just moved to this community, and the company may not have had a chance to create a master record for this customer.
Use the statements written in Exercise 11.3 as the basis for a complete file-matching accounts receivable program. Use the account number on each file as the record key for matching purposes. Assume that each file is a sequential file with records stored in increasing account number order.
When a match occurs (i.e., records with the same account number appear on both the master file and the transaction file), add the dollar amount on the transaction file to the current balance on the master file and write the “newmast.dat” record. (Assume that purchases are indicated by positive amounts on the transaction file, and that payments are indicated by negative amounts.) When there’s a master record for a particular account but no corresponding transaction record, merely write the master record to “newraast.dat”. When there’s a transaction record but no corresponding master record, print the message “Unmatched transaction record for account number...“ (fill in the account number from the transaction record).
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
C How to Program (8th Edition)
Additional Engineering Textbook Solutions
C++ How to Program (10th Edition)
Starting Out with Java: From Control Structures through Objects (6th Edition)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
Computer Science: An Overview (12th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Java How To Program (Early Objects)
- In C Programming Language. - use user-defined functions.- use an array of arrays.- use file pointers- use string processing and character conversions.- use a dynamic memory function calloc() or malloc() - Demonstrate the ability to read a file and process the data. Problem: You are tasked to write a program that will perform a statistical analysis of student records. Your program will open a text file (provided) and store the values read into an array (2d). Your program will then close the input file and process the data. Your program will print out the records to screen and will then print out the average quiz scores per student.For each student in the provided text input file there is a name of up to 20 characters, an id number of five alphanumeric values (n1234), 4 exm grades in order: exm 1 – exm 4.You may use a fixed 2d array size of 80 characters for the input file name. You must use a dynamic array for at least one task in your program. You may declare your filename array using…arrow_forwardPlease solve the following in Java Sean can't remember where he put an important file on his computer. He desperately needs the file tonight to finish his homework, since he procrastinated all day by playing computer games. Unfortunately, his computer has gotten fried from all the gaming, and can no longer perform automatic searches for files. He therefore has to look for the file manually.Since he tends not to use subdirectories too much,he knows his best bet is to look for the file first in the root directory ("/"), and next in directories only one level deep (for example, "/Games/"), and so forth, checking the "deepest" directories last. His computer still has enough fire power to run some simple programs, so he has asked you to code for him a simple algorithm to sort all of the directories on his computer. ThealgorithmshouldtakeaString[]dirsasaninputand should sort dirs first by directory depth, and then lexicographically for each depth. So "/d/e/" comes before "/a/b/c/", but not…arrow_forwardINSTRUCTION: C++ Language Create a function that writes to a file named Inventy.txt the information of 8 items. Ask the user for the item's name, the item's quantity in storage, and the item's price and write it to the file. Create a function that reads the file and items' quantity and price to two different arrays. Create a function that computes the subtotal of each item. Implement all functions inside the main program and the computed value should be displayed with the item's name.arrow_forward
- Analyze the problems carefully. Create the programs of the following. 1. Ages and Stages (Fle name: Age_Lastname) Create a program that checks as to which stage an age is. Use the table below. Age 5-12 years Stage Grade-schooler 13-17 years Теen 18-21 years Young adult 2. LRT-2 Single Journey Fare Matrix (File name: LRT_Lastname) Create a program that displays the fare based on the entered destination. The starting station is Araneta-Cubao. Use the table below. Use the code destination to shorten the user's input. Destination Fare Recto (Re) J. Ruiz (Jr) Gilmore (Gi) PHP 20 PHP 15 PHP 10arrow_forwardSegmentation: Select all of the following statements that are true. In segmentation, a logical address always has a length of 32 bit. In order to translate logical into physical addresses, the memory management unit uses the segment part of the logical address to determine the start address in the segment table and adds the offset to this to get the physical address. In segmentation, the logical address consists of a segment part and an offset. The segment length is limited by the maximum possible segment number. When applying segmentation, processes are only allowed to access the memory within their segments. Segments can be assigned access rights and privilege levels.arrow_forwardC++ How do I read initial data in from a file, and then use class to store the data?arrow_forward
- I need a PSEUDOCODE for this problem: Phresh Ladies Makeup Line and We are Ladies Co. are merging their businesses and want to merge their product files. Each file contains a product number, name, quantity, and price, and each file is arranged by product number accordingly. Design the logic for a program using pseudocode that merges the two files into one file containing all products. Assume that all product numbers are unique.arrow_forwardProgramming language : C++ Note : you have to use file handling Question : you are asked to make a program in c ++ in which you have to Write a function to search for student details ( name and class ) from a file using the enrollment of student.arrow_forwardContiguous Memory Allocation Algorithms The program will read size of free memory partitions and size of processes from a text file and then will try to allocate a memory partition for each process using the first-fit, best-fit and worst-fit allocation algorithms. The implementation completed in Python programming language. The first line of the input file should contain the size of free memory partitions (in order) while the second line contains the size of processes (in order). Sample input file is shown below: 300,600,350,200,750,125 115,500,358,200,375 The program should read the name input file as command line input and produce a text file named “output.txt” with the following example output: First-Fit Memory Allocation ----------------------------------------------------------------------------------------------- start => 300 600 350 200 750 125 115 => 115* 185 600 350 200 750 125 500 => 115* 185 500* 100 350 200 750 125 358…arrow_forward
- Python: if possible answers in one line of code def name_sort(staff): ''' Question 2 You are given a list of Georgia Tech staff members- each with a first and last name separated by a space, and need to sort them alphabetically by last name for a directory. However, the person who provided you the list did not proofread the records and accidentally misspelled some of the names. You can identify which ones have typos just by looking at the first letter of the first name. - First, sort the list alphabetically by the last name. - Remove any members whose first name starts with "Q" or "X". - Return the resulting list. Args: staff (list) Returns: list >>> name_sort(['Damon Williams', 'Xngel Cabrera', 'George Burdell', 'Brett Key', 'David Joyner', 'Qon Lowe']) ['George Burdell', 'David Joyner', 'Brett Key', 'Damon Williams'] ''' # print(name_sort(['Damon Williams', 'Xngel Cabrera', 'George Burdell', 'Brett…arrow_forwardC++ You must create a header file for each task with implementation as the execute task. Together with the header and implementation, you create a test program whose main function demonstrates that your functions work as they should. (Main.cpp and main.h) Two files, A and B, are sorted. Based on the files, create a file that contains all the elements in sorted order. This operation is called a merge. Input files A and B are sorted Output: File C contains all values from A and B in sorted orderarrow_forwardFile Handling with Array: C++ Language: Write a c++ program to read the data from the file into array and do calculation. Note: Take a general word problem and write syntax which will use in all problems related to file handling with array.arrow_forward
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning