Write a C++ program that simulates inventory bins in a warehouse. Each bin holds a number of the same
type of parts. The program should use a structure that keeps the following data:
• Description of the part kept in the bin
• Number of parts in the bin
The program should have an array of ten bins initialized with the following data:
Part Description Number of Parts in the Bin
Valve 10
Bearing 5
Bushing 15
Coupling 21
Flange 7
Gear 5
Gear Housing 5
Vacuum Gripper 25
Cable 18
Rod 12
The program should have the following functions:
• addParts – a function that increases a specific bin's count by a specified number

• removeParts – a function that decreases a specific bin's count by a specified number
When the program runs it should repeat a loop that performs the following steps:
• The user should see a list of what each bin holds and how many parts are in each bin
• The user can either chose to quit the program or select a bin
• When a bin is selected, the user can either add or remove parts from it
• The loop repeats, showing the updated bin data on the screen
Input validation: no bin can hold more than 30 parts, so don't let the user add more than a bin can
hold. Also don't accept negative values for the number of parts being added or removed.

Alpha Geek

(8)

Status NEW Posted 18 Aug 2017 01:08 PM My Price 8.00

#in-----------clu-----------de -----------"st-----------daf-----------x.h-----------" #-----------inc-----------lud-----------e #-----------inc-----------lud-----------e u-----------sin-----------g n-----------ame-----------spa-----------ce -----------std-----------; v-----------oid----------- ad-----------dpa-----------rts-----------(in-----------t);----------- vo-----------id -----------rem-----------ove-----------par-----------ts(-----------int-----------); -----------str-----------uct----------- bi-----------n {----------- ch-----------ar -----------des-----------c_p-----------art-----------s[2-----------0];----------- in-----------t n-----------um_-----------par-----------ts;-----------

Not Rated(0)

• Buy Answer