Capital gain calculator, Programming Languages

This assignment is divided into two parts. The goal is to write a Java program that calculates capital gain on a stock market, see Lab 7.

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. 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 × (30-20) + 20 × (30-24) + 30 × (30-36) = 100 × 10 + 20 × 6 + 30 × (-6),

or $940.

  1. Write a Linked Implementation of a queue described in Lecture 21. The Queue should use generics, so any type can be stored as the value. Save the definition of the class as LinkedQueue.java.
  2. Write a program that takes as input a sequence of transactions of the form

3.  "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. Make use of the LinkedQueue class described above.

Posted Date: 2/20/2013 1:50:40 AM | Location : United States







Related Discussions:- Capital gain calculator, Assignment Help, Ask Question on Capital gain calculator, Get Answer, Expert's Help, Capital gain calculator Discussions

Write discussion on Capital gain calculator
Your posts are moderated
Related Questions
BACKGROUND: This assignment illustrates the power of mobile applications. OBJECTIVES: 1. Mobile applications DESCRIBED TASK: This is a single part assignment.

Define a Prolog predicate flatten(List, FlattenedList) that asserts List is any nested list of atoms and FlattenedList is the same list with the nesting removed. The atom [] should

i have a=[0 1 1 2 2 3 6 7 0 4 ] i want to delent elemet but keep its position i.e a(4)=[] it gives me 0 1 1 2 3 6 7 0 4 but i need 0 1 1 [] 2 3 6 7 0 4

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Use recursion to de ne a function position which has as input an integer, a character and a string and returns the result of inserting the character in the string at the position s

W.A.S.S to find the factorial of a given number. Program # W.A.S.S to find the factorial of a given number.    echo -e "enter number:\c"            #  \c Suppress trailing n

Define a higher order version of the insertion sort algortihm. That is define functions insertBy :: Ord b => (a->b) -> a -> [a] -> [a] inssortBy :: Ord b => (a->b) -> [a] ->

A traveler wants to purchase a number of traveler''s checks, each having a set amount for four different currencies: Mexican pesos, Euro dollars, Swiss francs, and US dollars. A t

Create a DTD which describes the structure of the document which you prepared in Question 1. Make sure that you use all appropriate DTD ingredients to constrain valid documents as

Dynamic Binding: - Binding refers to the linking of a procedure call to the code to be executed in response to the call. Dynamic binding (late binding) means that the code associa