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
A: BinarySearchTree.h ---------------------- #ifndef BINARY_SEARCH_TREE_H_ #define BINARY_SEARCH_TREE_H_ #include "dsexceptions.h" #include // For NULL // Binary

Relational Operators A relational operator is used to make comparison among two values. All these operators are binary and needs two operands. There are the following relationa

Purpose This assignment is an exercise in implementing the queue ADT using a singly-linked list. This assignment also introduces the concept of templates. Assignment Th

obtain two numbers from thekey board,and determain and display(if either)is the larger of two numbers.

Program to find a Greatest String: C - Program: Write a program find largest string by c program. int main( int argc, char *argv[] ) {     if( argc         {

Reverse a string - C ++ program: Write a program in c to reverse a string. int main() {     Stack theStack;     String reverse("reverse");       cout

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concate

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books

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

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.