Carol must use any software which supports retail management. A software which he choose should be able to bill for the goods purchased, Handle the stock entries, maintains a reorder level, an alert system to order next set of goods, ability to find fast moving products, able to modify code on need, provide appropriate warning and error messages which are user-friendly etc. There are many such software in the market viz. “ShopKeep, Epos Now, Light speed Retail, Fattmerchant, Square for Retail”, etc.
Answer:
#include <iostream>
using namespace std;
int main()
{
int input = 0;
int count = 0;
int sum = 0;
int sumNegative = 0;
while (true) {
cout << "Enter a number: ";
cin >> input;
if (input == 0) break;
count++;
sum += input;
if (input < 0) {
sumNegative += input;
}
}
cout << "Count of the numbers: " << count << endl;
cout << "Sum of all the numbers: " << sum << endl;
cout << "Sum of the negative numbers: " << sumNegative << endl;
}
Explanation:
Your requirements regarding the sum and the negative numbers was a bit vague so I just did something you can probably adjust easily to your liking.
Answer:
D: A single direct connection is established between any two devices connected to the Internet.
Explanation:
The internet is a complex network system made of protocols, packets, and other things. For a network to be connected, it requires the use of multiple pathways. It is unnecessary for a single direct connection because of most of the networks in this real-world travel in multiple direct connections. For example, if you want to go to Brainly.com. It first needs your IP address and then the protocols like HTTP and TCP to send it. Networks are just like traffic. If one section or a part gets blocked, they go on a different path and reach their destination. It is the same here for networks. Networks go into multiple directions to get to their destination. Therefore, a single direct connection is not required or necessary to make it possible.
Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>
