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

C program to design text styles, Program to design text styles: Write ...

Program to design text styles: Write a C program to design different text style char *fname[] = { "DEFAULT font",                                   "TRIPLEX font",

Setup and source code with nice user interface, Virtual Webcam effects - Se...

Virtual Webcam effects - Setup and Source code with Nice User Interface Project Description: I want a similar webcam effects application which can apply effects to webcam fee

Program to find the number, i need a program that find the number of negati...

i need a program that find the number of negative integers in a list.

Storing street addresses with doubly linked lists, Write a C++ program with...

Write a C++ program with header and source files to store street addresses using the Doubly Linked List ADT. Modify the Node class from Lab Assignment 3 so that it becomes a node i

Car rental project, I need a project on car rental system using c programmi...

I need a project on car rental system using c programming only of college level

Star, Write a program that finds the minimum total number of shelves, inclu...

Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

C program for radius of circle, C Program for RADIUS OF CIRCLE   #de...

C Program for RADIUS OF CIRCLE   #define PI 3.14159 main() {           float r,a;           clrscr();           printf("ENTER THE RADIUS OF A CIRCLE: ");

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