Solved

# HOW TO USE 2 STACKS

Posted on 2004-10-19
1,138 Views
Here is the problem I am trying to solve.

When a share of common stock of some company is sold, the capital gain (or, sometimes, loss) is the difference between the share's selling price and the price originally paid to buy it. This rule is easy to understand for a single share, but if we sell multiple shares of stock bought over a long period of time, then we must identify the shares actually being sold. A standard accounting principle for identifying which shares of a stock were sold in such a case is to use a FIFO protocol-the shares sold are the ones that have been held the longest (indeed, this is the default method built into several personal finance software packages). For example, suppose we buy 100 shares at \$20 each on day 1, 20 shares at \$24 on day 2, 200 shares at \$36 on day 3, and then sell 150 shares on day 4 at \$30 each. Then applying the FIFO protocol means that of the 150 shares sold, 100 were bought on day 1, 20 were bought on day 2, and 30 were bought on day 3. The capital gain in this case would therefore be 100.10+20.6+30.(&#8722;6), or \$940.

Write a program that takes as input a sequence of transactions of the form

* buy x share(s) at \$y each

or

* sell x share(s) at \$y each,

assuming that the transactions occur on consecutive days and the values x and y are integers. Given this input sequence, the output should be the total capital gain (or loss) for the entire sequence, using the FIFO protocol to identify shares.

My question is how would I define two stacks(or queues)  to match sell orders with buy orders?

Thanks.
0
Question by:kaushalshah
• 2
• 2

LVL 7

Accepted Solution

JugglerW earned 500 total points
Sounds like homework?

But to give you an idea:

You have to use one queue. At one end feed in the shares you've bought. The objects you feed in should keep track of share count and prices.
If you want to sell get objects from the other end of queue until you have enough shares from the selling price and the price stored in the object you can calc your gain/loss.

Because normally not all shares from the last object will be used use a queue which allows to peek (instead of remove it) to the last object and subtract as much shares you need from this object.

0

Author Comment

Venabili, I am not asking for code, just ideas.

K
0

Author Comment

JugglerW, I did not understand your last comment.

K
0

LVL 7

Expert Comment

I meant:

If you want to sell 50 shares but the last object in your queue represents 100 shares you can't remove the whole object from the queue but only have to subtract the 50 you need and leave the object in the queue. So you need an operation which allows you to inspect / manipulate the last object without removing it from the queue.

0

Expert Comment

I Need Code For this Assignment Please
0

## Featured Post

Java Flight Recorder and Java Mission Control together create a complete tool chain to continuously collect low level and detailed runtime information enabling after-the-fact incident analysis. Java Flight Recorder is a profiling and event collectio…
Introduction This article is the first of three articles that explain why and how the Experts Exchange QA Team does test automation for our web site. This article explains our test automation goals. Then rationale is given for the tools we use to a…
Viewers learn about the scanner class in this video and are introduced to receiving user input for their programs. Additionally, objects, conditional statements, and loops are used to help reinforce the concepts. Introduce Scanner class: Importing…
Viewers will learn about basic arrays, how to declare them, and how to use them. Introduction and definition: Declare an array and cover the syntax of declaring them: Initialize every index in the created array: Example/Features of a basic arr…