Answer:
Medium Grade Liquid Metal Polish. pls give me brainliest
Answer:
A floppy disk drive (FDD) is a small disk drive used in computers for data transfer, storage and backup of small amounts of data, as well as installation of programs and driver updates. A floppy disk drive accesses data recorded on small, removable diskettes known as floppy disks.
Answer:
Using C++, the generated from the algorithm created in the explanation box is here by attached to this answer.
Explanation:
To create the program, you need to analyse and design a solution before coding.
Problem Analyses:
- Input-The program requires the user to enter the part number to be searched and also a control number(sentinel) to allow user to continue searching. Therefor, 2 inputs are required.
- Output-The program will display at least the part number entered, the corresponding price and quantity as the final output.
- Process-The process that will convert the input to output will involve creating the 3 required array to store part numbers, price and quantity. There after, a search will be performed on the part number array to match and retrieve the corresponding price and quantity from their respective arrays.
Pseudo code
- Initialize variables and the 3 arrays:run,value,i,partnum[],price[],quantity[],size
- While run remains 'c'
- Get value
- Open for loop
- If value is same as array index i
- Print part number,price and quantity
- Break from for loop
- end if
- Else if at the end of the search there is no value matching any part number
- print not available
- Break
- End esle if
- Update run
- End while
- End program
Answer:
B. A feasible solution satisfies all constraints.
Explanation:
Linear programming can be explained as a simple technique where we depict complex relationships through linear functions then find the optimum points.
Linear programming is employed for obtaining the foremost optimal solution for a drag with given constraints. In applied mathematics,
real life problem are formulate into a mathematical model. It involves an objective function, linear inequalities with subject to constraints.
Constraints: The constraints are the restrictions or limitations on the decision variables. They usually limit the value of the decision variables.
Hence,
An infeasible solution violates all constraints.
A feasible solution point does not have to lie on the boundary of the feasible region.
An optimal solution satisfies all constraints.
