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

What is the best fit algorithm, The Best fit algorithm: The best fit metho...

The Best fit algorithm: The best fit method occurs the smallest free block whose size is greater than or equivalent to n. An algorithm to get such a block by traversing the whole

Need help, how to make basics strong and best logic skills what are the bes...

how to make basics strong and best logic skills what are the best way to be a expert programmer ? what counts a lot knowledge or practice?

Lcm code, full coding for lcm in c++

full coding for lcm in c++

Ascii string related, A string S is said to be "Super ASCII", if it contain...

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the asci

A Padovan string P(n) for a natural number n, c program for padovan string ...

c program for padovan string   Padovan series are positive integers obtained by the following process: The Padovan series is the sequence of integers P(n) defined by the

Program of sorting algorithms , The program sorting.cpp contains a main f...

The program sorting.cpp contains a main function for testing the operation of several sort algorithms over various data sizes and data set organisations. The program understands

Doubt!, find the greater of the two variables, without using conditional lo...

find the greater of the two variables, without using conditional loops or ternary operators?

What is threaded binary tree, Threaded binary tree: Consider the linked il...

Threaded binary tree: Consider the linked illustration of a binary tree 'T.  Approximately half of the entries is the pointer fields 'LEFT' and 'RIGHT' will have null elements. Th

Explain high-order and low-order bytes., Explain high-order and low-order b...

Explain high-order and low-order bytes. - Numbers are written from left to right in decreasing order of significance. In the same way, bits in a byte of computer memory can be

Advantages to the use of functions, Question: (a) What is a function? A...

Question: (a) What is a function? Are functions needed when writing a C program? (b) State one of the advantages to the use of functions. (c) What do you meant by underst

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