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

Define the object-oriented terms, Question : (a) Define the following O...

Question : (a) Define the following Object-Oriented terms: (i) Encapsulation (ii) Inheritance (iii) Abstraction (iv) Polymorphism. (b) What are objects in Lingo progra

What is an incomplete type in c++, Incomplete types refer to pointers in wh...

Incomplete types refer to pointers in which there is no availability of the execution of the referenced location or it points to some location whose value is not available for modi

Minimum shelves, write a program to find the minimum number of shelves

write a program to find the minimum number of shelves

DECODE, Smugglers are becoming very smart day by day. Now they have develop...

Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send

How to use turbo c, Sir i want to know all the basic knowledge of turbo c.

Sir i want to know all the basic knowledge of turbo c.

Binary search tree is constructed by repeatedly, Assume that a Binary Searc...

Assume that a Binary Search Tree is constructed by repeatedly inserting exact values in to the tree. Argue that the number of nodes examined in searching for a value in the tree is

Padovan string, find the occurence of zy in the final string

find the occurence of zy in the final string

Bitcoin alternative – deployment and modification, I started preparing an a...

I started preparing an alternative cryptocurrency and I am way over my head. I would like help in making modifications to the open source files and then help with deployment. I wil

StACK, Q. Explain that how do we implement two stacks in one array A[1..n] ...

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

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