Financial Mathematics I :Please answer full steps clearly Note : The teacher Nee

Question

Financial Mathematics I:Please answer full steps clearly

Note :The teacher Need matlap program or any program but do not use exel or VPA that inthe options futures and other dervivatives for john .c.hull book (Chapter 17,18, 20,21 and 27) and the question is clear

Q1) Design and implement a computer program to value options using a binomial/trinomial tree. You can use a programming language of your choice. Do not use Excel/VBA for this exercise. Implement appropriate switches so that the program can value European or American options, options on stocks (dividend or non-dividend paying), stock indices, currencies, and futures. Calculate the Greeks in your program. Test your program using many of the examples in the book and the assignments. Please make sure to include complete instructions for me to install the software and test your program. If I am not able to test your program I cannot grade it and give you marks.

Note :the subject is Financial Mathematics I: options, futures and other derivatives (9th edition) Chapter 17: Options on stock indices and currencies, Chapter 18: Futures options ,Chapter 21: Basic numerical procedures ,Chapter 27: More on models and numerical procedures

Hi Please I give you above the text book and chapters and i will repost now again

Text book is :options, futures and other derivatives (John C.Hull ,9th edition) Chapter 17: Options on stock indices and currencies, Chapter 18: Futures options ,Chapter 21: Basic numerical procedures ,Chapter 27: More on models and numerical procedures

The teacher Need matlap program or any program but do not use exel or VPA that inthe options futures and other dervivatives for john .c.hull book (Chapter 17,18, 20,21 and 27)

Explanation / Answer

Paste your text here and click on "Next" to observe this text redact do it's issue.

haven't any text to check? haven't any text to check? Click "Select Samples".public category List<E>
personal Node first;
personal Node last;
personal long length;
  
personal category Node
  

/**
* A generic inner ListIterator category that implements the
* ListIteratorAPI. it's used as a indicator to traverse the list.
*/
personal category ListIterator implements ListIteratorAPI<E>
personal Node position; // the node on the left of the iterator
personal Node previousPosition; // the previous iterator position
personal Boolean isAfterNext;
personal Boolean isAfterPrevious;
  
/**
* Constructs associate iterator that points to the front
* of the coupled list.
*/
public ListIterator()
  

/**
* Resets the iterator's previousPosition to its current position,
* resets the iterator's current position to the node on the proper of
* its current position (moves the iterator, within the forward direction,
* past the node on the right), and returns the knowledge worth in the node
* that the iterator simply omitted.
*/
public E next() throws ListException
methodology.
}
  
/**
* Returns true if there's a node on the proper of the iterator
* position; otherwise, returns false.
*/
public Boolean hasNext()
come back 1st != null;
else
come position.next != null;
}
  
/**
* Returns true if the iterator position isn't null;
* otherwise, returns false.
*/
public Boolean hasPrevious()
methodology.
}


  
/**
* Inserts a replacement node on the left of the iterator and resets
* the iterator position to the present inserted node.
*/
public void add(E data)
methodology.
}

/**
* Removes the last node omitted by the iterator during a decision to
* either next or previous.
* Throws associate exception if take away isn't known as directly once a
* decision to either next or previous.
*/
public void remove() throws ListException
methodology.
}

/**
* Replaces the info worth within the node on the left of the iterator
* with the input file worth.
*/
public void set(E data) throws ListException
  
else
  
length++;
}

/**
* Adds an element to the end of the linked list.
* @param data the data value to add
*/
public void addLast(E data)
  
  
/**
* Removes the first element in the linked list.
* @return the removed element
*/
public E removeFirst() throws ListException
  
length--;
return data;
}
  
/**
* Removes the last element in the linked list.
* @return the removed element
*/
public E removeLast() throws ListException
  
  
/**
* Returns the first element in the linked list.
* @return the first element in the linked list
*/
public E getFirst() throws ListException
  
  
/**
* The number of elements in this list.
* @return the length of this list.
*/
public long size()
  
  
/**
* @return a string representation of the elements of this list
* in the format [e0, e1, ..., en-2, en-1], where each ei is a data
* value in the list and e0 is the data value in the first node
* and en-1 is the data value in the last node. It returns [] if this
* stack is empty.
*/   
public String toString()
  
  
  
}


package list;

public interface ListIteratorAPI<E>
{
/**
* Resets the iterator's previousPosition to its current position,
* resets the iterator's current position to the node on the right of
* its current position (moves the iterator, in the forward direction,
* past the node on the right), and returns the info worth within the node
* that the iterator just passed over.
*/
E next() throws ListException;
  
/**
* Resets the iterator's previousPosition to its current position,
* resets the iterator's current position to the node on the
* left of its current position (moves the iterator, in the backward
* direction, past the node on the left), and returns the data value
* within the node that the iterator simply omitted.
*/
E previous() throws ListException;
  
/**
* Returns true if the iterator position isn't null;
* otherwise, returns false.
*/
Boolean hasNext();
  
/**
* Returns true if there's a node on the left of the iterator
* position; otherwise, returns false.
*/
Boolean hasPrevious();
  
/**
* Inserts a replacement node on the left of the iterator and resets
* the iterator position to the present inserted node.
*/
void add(E data);
  
/**
* Removes the last node omitted by the iterator during a decision to
* either next or previous.
* Throws associate exception if take away isn't known as directly once a
* decision to either next or previous.
*/
void remove() throws ListException;
  
/**
* Replaces the info worth within the node on the left of the iterator
* with the input file worth.
*/
void set(E data) throws ListException;
  
}



package list;

import java.util.NoSuchElementException;

public category ListException extends NoSuchElementException

}

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.