The sale policy of the company depends on many factors according to the following. • if item in stock more than 8 months and item profit is more than average profit of all items o yes - if customer reviews low quality • yes - sale 50% • no - if customer reviews medium quality o yes - sale 30% o no – sale 15% o no- if item profit more than 8% of the item price • Yes - if in stock more than 1 year o yes- sale 40% o no- not on sale • No - not on sale Write a C++ program that reads the information from "data.txt" input file into 5 arrays, then processes these arrays to produce three arrays, first array holds the items on sale, second array holds percentage of sale , and the third one holds the items without sale. Print these arrays on the screen

The sale policy of the company depends on many factors according to the following. • if item in stock more than 8 months and item profit is more than average profit of all items o yes - if customer reviews low quality • yes - sale 50% • no - if customer reviews medium quality o yes - sale 30% o no – sale 15% o no- if item profit more than 8% of the item price • Yes - if in stock more than 1 year o yes- sale 40% o no- not on sale • No - not on sale Write a C++ program that reads the information from "data.txt" input file into 5 arrays, then processes these arrays to produce three arrays, first array holds the items on sale, second array holds percentage of sale , and the third one holds the items without sale. Print these arrays on the screen

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Write a pseudocode for an algorithm for finding real roots of equation ax2 + bx + c = 0 for…

A: Pseudo code is the artificial and informal language which helps the programmers to develop the…

Q: Gildong has a square board comprising of n lines and n sections of square cells, each comprising of…

A: Here have to determine about the Triangles programming problem statement.

Q: Problem 8. Use the Principle of Mathematical Induction to prove that 2" < n! if n is an integer…

A: hand written solution to the induction hypothesis of 2n < n! is proved in step 2.

Q: Can you also solve it using the Master's theorem?

A: It is not possible to solve this recurrence relation using masters theorem

Q: Max Z= x, +8x, Subject to X +3x, 56 2x, + x, = 8 X1, X, 20

A: Here is code in Python as follows for Linear optimization problem using Large M method. Code is as…

Q: algorithm to solve this problem.

A: A greedy approach to determining the optimal potential flow in a network or graph is the…

Q: John came up with an algorithm for some problem that runs in time O(nʻlog (n)), and Bill came up…

A: Given, in the algorithm, John came with big-omega notation and Bill came up with big-O notation.…

Q: You are explaining the problem of searching for a move in chess to your friend. Your friend notices…

A: The strategy wouldn't work since the differentiation is not guaranteed to give a maxima always,…

Q: Q1: Prove that: (X.Y.Z)+((X.Y). (X.Z)) = X + Y.Z?

A: Boolean algebra is the mathematical system with elements, operators and axioms. There are six basic…

Q: algorithm

A: Given Algorithm is mention as below : - Bubble-Sort(int A[], int n){ int i, j; boolean…

Q: Construct a Python program that implements the following: Create functions for each of the…

A: In the beloww code, the functions one_norm, infinity_norm, and frobenius_norm are defined to…

Q: On the Island of Knights and Knaves we have two people A and B. A says: Exactly one of us is a…

A: Given InformationOn the Island of Knights and Knaves, we have two people A and B.A says: Exactly one…

Q: Create a limit evaluation problem that requires substitution with an answer of 1. Please show the…

A: Problem : Evaluate the function which is sin ( x ) / x and here x approaches to 0 . The solution…

Q: 3) Show that the set of three-dimensional coordinates {(r,y, z)|x, y, z E Z} has size equal to N.

A: N stands for Natural numbers in number system.

Q: Use the python programming enviroment to write a code can solve a system of linear equations with n…

A: Here we write the python program which solve a linear equation with n variable by Guass jordon…

Q: Could we use the ideas of the Closest Pair of Points Algorithm to solve the following problem?…

A: The idea of closest pair of points algorithm can be used here, closest pair of points involves…

Q: How can numerical methods find solutions to systems of equations? Give your own explanation of the…

A: Mathematical analysis: In contrast to symbolic manipulation, numerical analysis is the study of…

Q: Could a solution be given without using vectors? Thank you.

A: Previous code is wrong #include <iostream> using namespace std; struct ContactInfo{…

Q: 1. Newton Raphson Find the root of the equation from the equation f(x) below by using Newton Raphson…

A: Step 1: Define function f(x) that determines the value of 2×x4+3×x3+1. Step 2: Define function…

Q: You have 8 circlesof equal size and you want to pack them inside a square. You want to minimize the…

A: Is to pack 8 circles of same size inside the square.

Q: whatever point a robot arrives at a divider, it pivots right away and proceeds with his ride the…

A: Here have to determine about point a robot problem statement.

Q: Mr. Naughty loves to play with balls. So, his friend, Mr. Nice, gave him n balls to play the game.…

A: Process for the code The first line contains a single integer n - the number of balls. Thefollowing…

Q: Integer Linear Programming Exercise Please solve the following real-world problem: A businesswoman…

A: Python: Python is a high level, general purpose programming language. It has simple syntax and…

Q: You are given a puzzle consists of an m x n grid of squares, where each square can be empty,…

A: To prove that the Puzzle problem is NP-complete, we need to show that it belongs to the NP…

Concept explainers

Recurrence relation

A recurrence relation or recursive relation is an equation that represents a function in terms of the values of its smaller inputs. Every recurrence relation T(n) is a recursive function of integer n and consists of a base case and a recursive case.

Question

100%

Can you solve this problem

A company has stock of many goods, and they want to filter the stock so
that some of the materials can go on sale. The stock information recorded
in a file"data.txt" as shown in the sample. (in the following sequence)
(item name, price_perunit, profit, months_of_stocking, customer_reviews )
hwt.cpp
data.bxt x
chair
round_tablel
square_table
stand lamp1
pillow cover1
BLUE chair
low
medium
low
medium
10
9
17
15
low
high
low
15
X_chair
round table2
10
4.
medium
low
square_table
stand lamp2
pillow cover2
2
medium
low
high
17
15
round lamp
13
The sale policy of the company depends on many factors according to the
following.
• if item in stock more than 8 months and item profit is more
than average profit of all items o
low quality
yes - if customer reviews
• yes - sale 50%
no - if customer reviews medium quality o
yes - sale 30% o no – sale 15%
no- if item profit more than 8% of the item price
Yes - if in stock more than 1 year o yes-
sale 40% o no- not on sale
• No - not on sale
Write a C++ program that reads the information from "data.txt" input file
into 5 arrays, then processes these arrays to produce three arrays, first
array holds the items on sale, second array holds percentage of sale , and
the third one holds the items without sale. Print these arrays on the screen

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

How does java solve the diamond problem? Also provide the dry run of solution.
please write in python code
Please solve this in Python. DO NOT use spicy library. Expected outcome is: FalseTrue
i need the solve of this basic math qoustion
Find the false coin among n coins using the Decrease-by-Constant-Factor false-Coin puzzle technique, which may be written in Java or C++. Consider that the counterfeit coin weighs less. Place the fake coin among the other coins in a manner determined by chance. Submit results photos and code files.
Can you solve for x and type the correct code? Please remember to type in ALL CAPS with no spaces.
Discrete Mathematics! Solve the following problems on a piece of clean paper. Show your Solution and Box your final answer.
This problem is taken from the delightful book "Problems for Mathematicians, Young and Old" by Paul R. Halmos. Suppose that 931 tennis players want to play an elimination tournament. That means: they pair up, at random, for each round; if the number of players before the round begins is odd, one of them, chosen at random, sits out that round. The winners of each round, and the odd one who sat it out (if there was an odd one), play in the next round, till, finally, there is only one winner, the champion. What is the total number of matches to be played altogether, in all the rounds of the tournament? Your answer: Hint: This is much simpler than you think. When you see the answer you will say "of course".
Please solve in Python. DO NOT use spicy library. The expected output is: True
Discrete math problem: Is the set of odd negative integers finite, countably infinite, or uncountable? If it is countably infinite, exhibit a one-to-one correspondence between the set of positive integers and that set.
You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 2 3 4 5 6 7 8 9 1 0 10 9 999 999 17 999 999 999 2 3 69 10 0 14 4 2 999 999 13 999 14 0 7 999 999 999 999 999 4 999 4 7 0 999 2 8 999 999 5 999 2 999 999 0 6 999 1 999 6 17 999 999 2 6 0 999 7 999 7 999 999 999 8 999 999 0 11 4 8 999 13 999 999 1 7 11 9 999 999 999 999 999 999 4 80 8 0 1. We started from the vertex vl, so initially we have Y = {v1}: initial 1 2 3 4 5 6 7 8 9 nearest 1 1 1 1 1 1 1 1 1 distance -1 10 9 999 999 17 999 999 999 Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y Hint: use (copy) the table above to record your answer.
02. Find a solution to the following recrce egation T(n)