Question: Historical Relationship between South African Rand, US dollar and currencies of the BRIC Countrie...

(1 bookmark)

Historical Relationship between South African Rand, US dollar and currencies of the BRIC Countries I BRICS is an acronym for the association of the economies of Brazil, Russia, India, China and South Africa and BRIC is a similar acronym excluding South Africa. Mweleco FX Pty LTD, a foreign exchange trading company based in Johannesburg, has been contracted by a hypothetical Namibian Stock Exchange (NSE) to examine the historical relationship between the Rand(as a proxy for the Namibian Dollar- N$), currencies of the BRIC countries and the US Dollar from April 9, 2006 to March 27, 2011. Issues of interest to the NSE are: • The historical volatility (risk) between the currencies of the BRIC currencies, South African Rand and the US dollar during the period; Project Historical Relationship between South African Rand, US dollar and currencies of the BRIC Countries II • The relationship between BRICS currencies. You are required to provide a brief report (Minimum 4 pages and maximum 8 pages (including tables, figures, references etc.) to the NSE covering the following:

(a). A brief introduction of the study;

(b). Brief literature review on general issues around currency volatility (risk) and returns;

(c). Relationship(s) between the South African Rand, US Dollar and the sampled currencies of BRIC countries and whether the relationship(s) can be, predictably, explored;

(d). Brief discussion of the empirical findings from the study;

(e). Conclusion and some recommendations to the NSE.

1. A videogame player has to play five opponents in consecutive order. She has an 80% probability of defeating each of them. Assume the results from opponents are independent and that when the player is defeated the game ends.

a. Describe the outcomes of 1 random process, and then build a probability tree showing what happens if the player defeats the first, second, third, fourth opponent.

b. What is the probability that the player defeats all opponents?

c. What is the probability that the player defeats at least two opponents in a game?

2. A national survey of couples showed that 30% of wives watched “America’s Next Top Model”. For husbands in the sample, this percentage was 50%. Also, if the wife watched, the probability that the husband watched increased to 60%. For a couple drawn at random, what is the probability that:

a. Both watch
b. At least one watches
c. Neither watches
d. If the husband watches, the wife watches
e. If the husband does not watch, the wife watches

case 47:THE TIMKEN COMPANY

5. If Timken decides to go forward with the acquisition, how should Timken offer to structure the deal? Is Ingersoll-Rand likely to want a cash deal or a stock-for-stock deal?

6. What are the risks for Ingersoll-Rand of accepting Timken shares for some or all of the consideration?

Galactosemia is a recessive human disease that is treatable by restricting lactose and glucose in the diet. Susan Smithers and her husband are both heterozygous for the galactosemia gene. If Susan and her husband have four children, what is the probability that: (1 point each)

a. none of the four will have galactosemia?

b. at least one child will have galactosemia?

c. only one child will have galactosemia?

d. the first two will have galactosemia and the second two will not?

e. two will have galactosemia and two will not, regardless of order?

Please provide an explanation! This is my second time posting this so if you aren't sure please don't answer!! TY!

Suppose that the demand for a monopolist's product is estimated to be Qd = 100 − 2P and its total costs are C = 10Q.

a. How does the number of units sold with first-degree price discrimination compare to the number sold if the firm charged its optimal single price?

b. How do the profits earned with first-degree price discrimination compare to profits earned if the firm charged its optimal single price?

c. How does consumer surplus with first-degree price

Careforall, The mayor of sickcity, claimed that his residents are very elastic and highly sensitive when the price of preventative care changes but not so sensitive when the price of inpatient care changes. To prove her point she referred back to the RAND studies. She claimed that the results of a replicated study in her town are shown below

Plan Average # of preventative care visits Average # of inpatient visits

Free 3.2 0.126

25% 2.54 0.122

50% 2.10 0.118

Find the price elasticity of demand for preventative care in Sickcity. round to 3 digits after the decimal

The price of a call option with a strike of $100 is $10. The price of a put option with a strike of $100 is $5. Interest rates are 0 and the current price of the underlying is $100. Can you make an arbitrage profit? If so how? Describe the trade and your pay offs in detail.

Part 2: The price of a call option with a strike of $100 is $10. The price of a put option with a strike of $100 is $15. Interest rates are 0 and the current price of the underlying is $105. Can you make an arbitrage profit? If so how? Describe the trade and your pay offs in detail.

For this computer assignment, you are to write a C++ program to implement a class for binary trees. To deal with variety of data types, implement this class as a template.

Most of the public member functions of the BinaryTree class call private member functions of the class (with the same name). These private member functions can be implemented as either recursive or non-recursive, but clearly, recursive versions of these functions are preferable because of their short and simple implementations in code. However, they require more memory and usually slower than their non-recursive versions in execution, especially for a large amount of input data.

BINARYTREE.H

#include

#include "node.h"

using namespace std;

#ifndef H_BINARYTREE

#define H_BINARYTREE

template class BinaryTree{

public:

    BinaryTree();                                      // default constructor

    unsigned     getSize() const;                      // returns size of tree

    unsigned     getHeight() const;                    // returns height of tree

    virtual void Insert(const T&);                     // inserts node in tree

    void         Inorder(void (*)(const T&));          // inorder traversal of tree

protected:

    Node *root;                                      // root of tree

private:

    unsigned _getSize(Node *) const;                 // private version of getSize()

    unsigned _getHeight(Node *) const;               // private version of getHeight()

    void     _Insert(Node *&, const T&);             // private version of Insert()

    void     _Inorder(Node *, void (*)(const T&));   // private version of Inorder()

};

#endif // End of H_BINARYTREE

Because of information hiding, a client is not permitted to access the binary tree directly, so the root of the tree is kept protected (not private because of future implementations of derived classes from the base class of the BinaryTree), so it cannot be passed as an argument to any of the public functions of the tree. It is essential to have private utility functions, which act as interface between a client and the tree. The Insert() function of the BinaryTree class is described as follows:

• Insert(const T &x) This virtual function can be used to insert a node with the data value x in a binary tree, applying the following technique: if the tree is empty, then the new node will be the root of the tree with the value x; otherwise, the left or the right subtree is randomly selected and the value x is inserted in that side. To implement the random selection, you can use the following RNG.

typedef enum {left_side, right_side } SIDE;

SIDE rnd(){ 
    return rand()%2 ? right_side : left_side;
}// End of rnd()

Put the implementation of your BinaryTree class in the header file binarytree.h. Definition of the class Node, which represents the nodes in a binary tree, can be found in the header file node.h. To use the class Node in your program, include the header file node.h, inserting #include "node.h" at the top of your header file.

The source file binarytreeDriver.cc contains the driver program. In addition to the main() routine, it has the implementations of the following routines (as templates) and the definitions of the two RNGs used in the main() routine.

• template void print(const T &x):
• template void printValues(BinaryTree &tree, const string &name);

The unary function print() can be used as an argument to the member functions Inorder() to print the value of its argument x. The function printValues() does the followings:

• it prints name, which is the name of the tree, and it also prints the height of the tree.
• it calls the member function Inorder() to print the data values in the tree in inorder.

The class RND1 can be used to generate random integers in the range [LOW1 = –999, HIGH1 = 999] and the class RND2 can be used to generate random floating-point numbers in the range [LOW2 = –999.99, HIGH2 = 999.99]. The function objects RND1() and RND2(), generated from these classes, are used to fill in the random values in vector containers vector A(N1) and vector B(N2) by using the generate() function in the STL, where N1 = 100 and N2 = 50 are the sizes of these two vectors.

The main() routine copies the random values from vectors A and B and inserts them in the binary trees first and second, respectively. At the end, the data values in the binary trees first and second are printed out on stdout with LSIZE = 12 numbers in a single line.

Put the implementation of your BinaryTree class in the header file binarytree.h. Definition of the class Node, which represents the nodes in a binary tree, can be found in the header file node.h. To use the class Node in your program, include the header file node.h, inserting #include "node.h" at the top of your header file.

The source file binarytreeDriver.cc contains the driver program. In addition to the main() routine, it has the implementations of the following routines (as templates) and the definitions of the two RNGs used in the main() routine.

• template void print(const T &x):
• template void printValues(BinaryTree &tree, const string &name);

The unary function print() can be used as an argument to the member functions Inorder() to print the value of its argument x. The function printValues() does the followings:

• it prints name, which is the name of the tree, and it also prints the height of the tree.
• it calls the member function Inorder() to print the data values in the tree in inorder.

The class RND1 can be used to generate random integers in the range [LOW1 = –999, HIGH1 = 999] and the class RND2 can be used to generate random floating-point numbers in the range [LOW2 = –999.99, HIGH2 = 999.99]. The function objects RND1() and RND2(), generated from these classes, are used to fill in the random values in vector containers vector A(N1) and vector B(N2) by using the generate() function in the STL, where N1 = 100 and N2 = 50 are the sizes of these two vectors.

The main() routine copies the random values from vectors A and B and inserts them in the binary trees first and second, respectively. At the end, the data values in the binary trees first and second are printed out on stdout with LSIZE = 12 numbers in a single line.

BINARYTREE.CC

#include

#include

#include

#include

#include

using namespace std;

#include "binarytree.h"

#define SEED 1  // seed for RNGs

#define N1    100   // size of 1st vector container

#define LOW1  -999  // low val for rand integer

#define HIGH1 999   // high val for rand integer

#define N2    50      // size of 2nd vector container

#define LOW2  -99999  // low val for rand float

#define HIGH2 99999   // high val for rand float

#define PREC  2       // no of digits after dec pt

#define LSIZE  12  // no of vals printed on line

#define ITEM_W 7   // no of spaces for each item

// prints single val

template

void print(const T&);

// prints data vals in tree

template

void print_vals(BinaryTree&, const string&);

// class to generate rand ints

class RND1 {

private:

  int low, high;

public:

  RND1(const int& l = 0, const int& h = 1) : low(l), high(h) {}

  int operator()() const { return rand() % (high - low + 1) + low; }

};

// class to generate rand floats

class RND2 {

private:

  int low, high, prec;

public:

  RND2(const int& l = 0, const int& h = 1, const int& p = 0) : low(l), high(h), prec(p) {}

  float operator()() const { return (static_cast(rand() % (high - low + 1) + low)) / pow(10, prec); }

};

// prints val passed as argument

template

void print(const T& x) {

  static unsigned cnt = 0;

  cout << setw(ITEM_W) << x << ' ';

  cnt++;

  if (cnt % LSIZE == 0) cout << endl;

}

// prints size and height of bin tree and data val in

// each node in inorder

template

void print_vals(BinaryTree& tree, const string& name) {

  cout << name << ": ";  // print name of tree

  // print size and height of tree

  cout << "size = " << tree.getSize() << ", ";

  cout << "height = " << tree.getHeight() << endl << endl;

  // print data values of tree in inorder

  cout << "Data values in '" << name << "' inorder:\n\n";

  tree.Inorder(print);

  cout << endl;

}

// driver program: to test several member functions of BinaryTree class

int main() {

  srand(SEED);  // set seed for RNGs

  // create 1st vector and fill it with rand ints

  vector A(N1);

  generate(A.begin(), A.end(), RND1(LOW1, HIGH1));

  // create binary tree with int vals in vector A,

  // and print all vals of tree

  BinaryTree first;

  for (unsigned i = 0; i < A.size(); i++) first.Insert(A[i]);

  print_vals(first, "first");

  cout << endl;

  // create 2nd vector and fill it with rand floats

  vector B(N2);

  generate(B.begin(), B.end(), RND2(LOW2, HIGH2, PREC));

  // create binary tree with float vals in vector B,

  // and print all vals of tree

  BinaryTree second;

  for (unsigned i = 0; i < B.size(); i++) second.Insert(B[i]);

  print_vals(second, "second");

  cout << endl;

  return 0;

}

NODE.H

#ifndef H_NODE

#define H_NODE

// definition of node in bin tree

template

class BinaryTree;  // forward declaration

template

class Node {

  friend class BinaryTree;  // BinaryTree is friend

public:

  Node(const T& = T(), Node* = nullptr, Node* = nullptr);  // default constructor

private:

  T        data;   // data component

  Node* left;   // left pointer

  Node* right;  // right pointer

};

// default constructor

template

Node::Node(const T& x, Node* l, Node* r) : data(x), left(l), right(r) {}

#endif  // End of H_NODE

An insurance company has written two life insurance policies for a husband and wife. Policy 1 pays $10,000 to their children if both husband and wife die during this year. Policy 2 pays $100,000 to the surviving spouse if either husband or wife dies during this year. The probability that the husband will die this year is .011. The probability that the wife will die this year is .008. Find the probability that each policy will pay a benefit this year. Assume that the deaths of husband and wife are independent

Complete the following program so that C = A*B where A and B are the matrices defined below.

N=4;

M=3;

A=rand(M,N);

B=rand(N,M);

C = ?

for m = 1: M

   for n = 1 : ?

for p = 1 : ?

C (m,n) = ?      

end

   end

end

You may upload a script