Implement a binomial tree class, C/C++ Programming

a) Implement a binomial tree class with a method that calculates the value of an option passed in to the class. The binomial tree should not rely on specific features of the different types of options. That is, the binomial tree should be shielded from specific knowledge of the options it is pricing. You may, e.g., have a method, valueOption() that handles any type of equity option passed to it.

Tip: The vector template class is useful in implementing the binomial tree solver.  
Tip: You may find it useful to implement a getPayout(S,t) method for your option classes that return exercise payout (if any) for stock spot value S and time t.

b) Find the tree depth (i.e., the number of steps in the tree) needed to value an (at-the-money) European call with strike and spot of $90, sigma of 25%, risk-free rate of 9% and time to maturity of 6 months to within one penny of the BlackScholes() price.

c) Compare the values of European and American puts by varying the strike price from $80 to $110 in increments of $1 for a spot of $100, sigma of 0.3, risk-free rate of 8% and T = 2 years. 

Write the European and American put values to a comma-separated value (csv) file.  Each line should contain Strike, European price and American price. When is the difference in value between the two options the largest?  Challenge question: *Can you figure out why?

d) When analyzing an asset, we are often interested in a security's sensitivities. That is, how the value of a security changes when the value of something else changes.  For equity options, we speak in terms of the so-called "Greeks" which define sensitivities to the underlying stock price, volatility, interest rates and so on.  The most important Greek is Delta, the option's sensitivity (first derivative) to changes in the underlying stock price.

Posted Date: 4/19/2013 12:49:49 AM | Location : United States

Related Discussions:- Implement a binomial tree class, Assignment Help, Ask Question on Implement a binomial tree class, Get Answer, Expert's Help, Implement a binomial tree class Discussions

Write discussion on Implement a binomial tree class
Your posts are moderated
Related Questions
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes

What is Structure? An Array is a data structure whose elements are all of the similar data type. The structure is a data structure whose individual elements are able to differ

Should one design a classes from the outside (interfaces first) or inside (data first)? A: From the outside. A superior interface provides a simplified view which is express

The size of () operator This is a pseudo-operator given by the language, which returns the number of bytes taken up by a variable or data type. The value returned by this opera

What is the purpose of return values? Can you not return any values from a function? If you could what would he function look like?

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Class Definition The following is the general format of defining a class template: class tag_name                  {                    public  :               // Must

FUNCTIONS It refers to a subprogram that is meant to do a certain task. It is basically used to execute a set of operations and return information to the main or calling functio

Draw a circle in c program: void main() { clrscr(); int i,r=50,t,j,x,y; int gd,gm; gd =DETECT; initgraph(&gd,&gm,""); for(x=50;x for(y=50;y {   i

Consider the following example: int max(int x, int y)                  {                                 return ( x > y) ? x : y ;                  }   float max