Create binomial tree, C/C++ Programming

Assignment Help:

Create a function ValueDelta(char inName[], char outName[]) that reads a text file with option specifications and writes the option values as well as Delta. The inName[] file contains the input file name. The outName file contains the output file name.

As before, each line of the input file will have the following formats:
 
, Strike, Spot, Sigma, T, r 
 
Each line of the output file should have the following format:
 
, Strike, Spot, Sigma, T, r, Price, Delta 
 
Run the function for the input file ValueDeltaInput.csv which has been included with the assignment.

What are the maximum Deltas you see for a call and for a put?  What are the minimums?  *Why do the Deltas not change sign for a given option?

Challenge question*: Gamma, the second derivative of the option value with respect to stock price can be similarly approximated using the three values of the second level of the binomial tree.  As an optional challenge (not required), try approximating Gamma as well.  There are online sources that will point you in the right direction if you get stuck. 

e) Add an ExerciseBoundary() method to your binomial tree class that returns the early exercise "boundary" for an American option.  For the purposes of the homework, the exercise boundary is the maximum (or possibly minimum) value of the underlying stock for which early exercise is warranted at each time t from 0 to time of maturity.  The boundary will typically take on different values for different t, i.e., in different parts of the tree.

Tip: It is easy to keep track of the exercise boundary while calculating the option price in the binomial tree. You may therefore want to extend your generic price calculating function to take care of the exercise boundary at the same time.

Calculate the exercise boundary, for an American put with spot $90, strike $100, sigma 0.25, risk-free rate 5%, and T = 1 year using a binomial tree with 100 time steps.

Calculate the exercise boundary for an American put with spot $90, strike $100, sigma 0.45, risk-free rate 5%, and T = 1 year using a binomial tree with 100 time steps.

The only difference between the two puts above is the underlying stock's volatility. For which put is the exercise boundary higher?


Related Discussions:- Create binomial tree

String function examples, 1. De ne a function chomp :: String -> String tha...

1. De ne a function chomp :: String -> String that selects a run of repeated characters from the start of a string with the run being as long as possible. For example ch

Explain quick sort and tree sort, Question 1 Explain Abstract data types w...

Question 1 Explain Abstract data types with its characteristics Question 2 Let us say your Learning Centre decides to store all the three types of student data Register

#titlbinary searching.., Ask question #Minimum 100 words awhat is the pre c...

Ask question #Minimum 100 words awhat is the pre condition for binary searching ccepted#

Areaundercurve.c, Write a program to find the area under the curve y = f(x)...

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 betw   Solution:

Derived data type, Derived Data Type: Array is derived data type to sto...

Derived Data Type: Array is derived data type to store large collection of data of only one data type. int mark[100]; char names[25]; Function: will be discussed early

Program that implements inference given a bayesian network, In this problem...

In this problem, you will write a program that implements two algorithms for performing exact inference given a Bayesian network, namely, enumeration and variable elimination. Your

Java code, Calculate the salary if the person work 8 hours/day and the sala...

Calculate the salary if the person work 8 hours/day and the salary/hour is RM5.20 - UML class diagaram -Class -Exception handling/assertion

Big o notation, The probabilistic Hough transform uses random sampling inst...

The probabilistic Hough transform uses random sampling instead of an accumulator array. In this approach the number of random samples r, is not specified in the OpenCV call, but is

Flow chart, flow chart for prime or not

flow chart for prime or not

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd