Design an algorithm that will produce a reorder list of products from a product inventory file. Each input product record contains the item number, the quantity on hand for the item, the quantity on order, the minimum inventory level for that item, and an obsolete code (‘X’ if the item is obsolete, blank if it is not). Your program is to read the product file and determine which items are to be reordered. An item is to be reordered if it is not obsolete and if the quantity of the item currently on hand, plus the amount on order, is less than its minimum inventory level. Print a detail line for each item to be reordered, listing the item number, quantity on hand, quantity on order and minimum inventory level. Print headings and column headings at the top of each page, allowing for 45 detail lines per page, and at the end of the report, print the total number of items to be reordered. A/ Defining table B/ Hierarchy chart C/ Solution algorithm D/ desk checks
Design an
obsolete code (‘X’ if the item is obsolete, blank if it is not).
Your program is to read the product file and determine which items are to be reordered. An item is to be reordered if it is not obsolete and if the quantity of the item currently on hand, plus the amount on order, is less than its minimum inventory level. Print a detail line for each item to be reordered, listing the item number,
quantity on hand, quantity on order and minimum inventory level. Print headings and column headings at the top of each page, allowing for 45 detail lines per page, and at the end of the report, print the total number of items to be reordered.
A/ Defining table
B/ Hierarchy chart
C/ Solution algorithm
D/ desk checks
Simple Program and Design A Step by step Approach 5th edition
ISBN 1423901320
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
