A firm with a 13% WACC is evaluating two projects for this year's capital budget. After-tax cash flows, including depreciation, are as follows:
0 1 2 3 4 5
Project M -$24,000 $8,000 $8,000 $8,000 $8,000 $8,000
Project N -$72,000 $22,400 $22,400 $22,400 $22,400 $22,400
Calculate NPV for each project. Round your answers to the
nearest cent. Do not round your intermediate calculations.
Project M $ ______
Project N $______
Calculate IRR for each project. Round your answers to two
decimal places. Do not round your intermediate calculations.
Project M ______ %
Project N ______ %
Calculate MIRR for each project. Round your answers to two
decimal places. Do not round your intermediate calculations.
Project M ______ %
Project N ______ %
Calculate payback for each project. Round your answers to two
decimal places. Do not round your intermediate calculations.
Project M ______ years
Project N ______ years
Calculate discounted payback for each project. Round your
answers to two decimal places. Do not round your intermediate
calculations.
Project M ______ years
Project N ______ years
Assuming the projects are independent, which one(s) would you recommen
If the projects are mutually exclusive, which would you recommend?
Notice that the projects have the same cash flow timing pattern.
Why is there a conflict between NPV and IRR?
In: Finance
The amount of water in a bottle is approximately normally distributed with a mean of 2.40 liters with a standard deviation of 0.045 liter. Complete parts (a) through (e) below. a).What is the probability that an individual bottle contains less than 2.36 liters? b). If a sample of 4 bottles is selected, what is the probability that the sample mean amount contained is less than 2.36 liters? c).If a sample of 25 bottles is selected, what is the probability that the sample mean amount contained is less than 2.36 liters? d.) Explain the difference in the results of (a) and (c). Part (a) refers to an individual bottle, which can be thought of as a sample with sample size .1875 nothing. Therefore, the standard error of the mean for an individual bottle is 01 nothing times the standard error of the sample in (c) with sample size 25. This leads to a probability in part (a) that is ▼ the probability in part (c).
In: Math
How to gather requirements and plan to identify unauthorized access attempts and block compromised systems from accessing the network without an antivirus scan.
In: Computer Science
1) Suppose that a certain population of 100 individuals possesses two alleles (A and B) at a certain locus, and initially consists of the following numbers of genotypes: AA = 9, AB = 42, BB= 49.
a) Calculate the initial frequencies of alleles A and B.
b) Now suppose that 16 individuals with genotype BB do not survive to reproduce. Calculate the new allele frequencies among the remaining individuals that do reproduce. Assuming that these remaining individuals mate randomly, calculate the new genotype frequencies in the next generation. Use the following headings to organize your calculations.
New Allele Frequencies
New Genotype Frequencies
In: Biology
Information from the American Institute of Insurance indicates the mean amount of life insurance per household in the United States is $130,000. This distribution follows the normal distribution with a standard deviation of $39,000.
a) If we select a random sample of 68 households, what is the standard error of the mean?
Standard Error of the Mean:
b) What is the expected shape of the distribution of the sample mean?
The distribution will be:
c) What is the likelihood of selecting a sample with a mean of at least $135,000?
Probability:
d) What is the likelihood of selecting a sample with a mean of more than $121,000?
Probability:
e) Find the likelihood of selecting a sample with a mean of more than $121,000 but less than $135,000.
Probability:
In: Math
The 7-year $1000 par bonds of Vail Inc. pay 9 percent interest. The market's required yield to maturity on a comparable-risk bond is 12 percent. The current market price for the bond is $ 940.
a.)Determine the yield to maturity.
b.)What is the value of the bonds to you given the yield to maturity on a comparable-risk bond?
c.)Should you purchase the bond at the current market price?
In: Finance
Question: 3
There are four witnesses to a theft crime and investigator found
out that if the witness 1 is telling
truth so is the witness 2, the witness 2 and the witness 3 can’t
both be telling the truth, the
witness 3 and witness 4 are not both lying. And lastly if witness 4
is speaking truth then witness 2 is not
speaking truth. Tell us who are telling truth and who lies.
In: Computer Science
take the LinkedStack structure from below( don't edit this structure) from below and make a main ( dont change the function in the main). Make a main where the user can input the amount of element they want to enter and then they can input the element. example: user choose 2 elements then he puts as$a and fa$f.
StackInterface.h
#pragma once
// Created by Frank M. Carrano and Tim Henry.
// Copyright (c) 2013 __Pearson Education__. All rights
reserved.
/** @file StackInterface.h */
#ifndef _STACK_INTERFACE
#define _STACK_INTERFACE
template<class ItemType>
class StackInterface
{
public:
/** Sees whether this stack is empty.
@return True if the stack is empty, or false if not.
*/
virtual bool isEmpty() const = 0;
/** Adds a new entry to the top of this
stack.
@post If the operation was successful, newEntry is at
the top of the stack.
@param newEntry The object to be added as a new
entry.
@return True if the addition is successful or false if
not. */
virtual bool push(const ItemType& newEntry) =
0;
/** Removes the top of this stack.
@post If the operation was successful, the top of the
stack
has been removed.
@return True if the removal is successful or false if
not. */
virtual bool pop() = 0;
/** Returns the top of this stack.
@pre The stack is not empty.
@post The top of the stack has been returned,
and
the stack is unchanged.
@return The top of the stack. */
virtual ItemType peek() const = 0;
}; // end StackInterface
#endif
Node.h
#pragma once
// Created by Frank M. Carrano and Tim Henry.
// Copyright (c) 2013 __Pearson Education__. All rights
reserved.
/** @file Node.h
Listing 4-1 */
#ifndef _NODE
#define _NODE
template<class ItemType>
class Node
{
private:
ItemType item; // A data item
Node<ItemType>* next; // Pointer to next
node
public:
Node();
Node(const ItemType& anItem);
Node(const ItemType& anItem, Node<ItemType>*
nextNodePtr);
void setItem(const ItemType& anItem);
void setNext(Node<ItemType>* nextNodePtr);
ItemType getItem() const;
Node<ItemType>* getNext() const;
}; // end Node
#include "Node.h"
#include <cstddef>
template<class ItemType>
Node<ItemType>::Node() : next(nullptr)
{
} // end default constructor
template<class ItemType>
Node<ItemType>::Node(const ItemType& anItem) :
item(anItem), next(nullptr)
{
} // end constructor
template<class ItemType>
Node<ItemType>::Node(const ItemType& anItem,
Node<ItemType>* nextNodePtr) :
item(anItem), next(nextNodePtr)
{
} // end constructor
template<class ItemType>
void Node<ItemType>::setItem(const ItemType&
anItem)
{
item = anItem;
} // end setItem
template<class ItemType>
void Node<ItemType>::setNext(Node<ItemType>*
nextNodePtr)
{
next = nextNodePtr;
} // end setNext
template<class ItemType>
ItemType Node<ItemType>::getItem() const
{
return item;
} // end getItem
template<class ItemType>
Node<ItemType>* Node<ItemType>::getNext() const
{
return next;
} // end getNext
#endif
LinkedStack.h
#pragma once
// Created by Frank M. Carrano and Tim Henry.
// Copyright (c) 2013 __Pearson Education__. All rights
reserved.
/** ADT stack: Link-based implementation.
Listing 7-3.
@file LinkedStack.h */
#ifndef _LINKED_STACK
#define _LINKED_STACK
#include "StackInterface.h"
#include "Node.h"
template<class ItemType>
class LinkedStack : public StackInterface<ItemType>
{
private:
Node<ItemType>* topPtr; // Pointer to first node
in the chain;
// this
node contains the stack's top
public:
// Constructors and destructor:
LinkedStack(); // Default constructor
LinkedStack(const LinkedStack<ItemType>&
aStack);// Copy constructor
virtual ~LinkedStack(); // Destructor
// Stack operations:
bool isEmpty() const;
bool push(const ItemType& newItem);
bool pop();
ItemType peek() const;
}; // end LinkedStack
#include <cassert> // For assert
#include "LinkedStack.h" // Header file
template<class ItemType>
LinkedStack<ItemType>::LinkedStack() : topPtr(nullptr)
{
} // end default constructor
template<class ItemType>
LinkedStack<ItemType>::LinkedStack(const
LinkedStack<ItemType>& aStack)
{
// Point to nodes in original chain
Node<ItemType>* origChainPtr =
aStack.topPtr;
if (origChainPtr == nullptr)
topPtr = nullptr; // Original stack
is empty
else
{
// Copy first node
topPtr = new
Node<ItemType>();
topPtr->setItem(origChainPtr->getItem());
// Point to last node in new
chain
Node<ItemType>* newChainPtr =
topPtr;
// Advance original-chain
pointer
origChainPtr =
origChainPtr->getNext();
// Copy remaining nodes
while (origChainPtr !=
nullptr)
{
// Get next item
from original chain
ItemType
nextItem = origChainPtr->getItem();
// Create a
new node containing the next item
Node<ItemType>* newNodePtr = new
Node<ItemType>(nextItem);
// Link new
node to end of new chain
newChainPtr->setNext(newNodePtr);
// Advance
pointer to new last node
newChainPtr =
newChainPtr->getNext();
// Advance
original-chain pointer
origChainPtr =
origChainPtr->getNext();
} // end while
newChainPtr->setNext(nullptr); // Flag end of chain
} // end if
} // end copy constructor
template<class ItemType>
LinkedStack<ItemType>::~LinkedStack()
{
// Pop until stack is empty
while (!isEmpty())
pop();
} // end destructor
template<class ItemType>
bool LinkedStack<ItemType>::isEmpty() const
{
return topPtr == nullptr;
} // end isEmpty
template<class ItemType>
bool LinkedStack<ItemType>::push(const ItemType&
newItem)
{
Node<ItemType>* newNodePtr = new
Node<ItemType>(newItem, topPtr);
topPtr = newNodePtr;
newNodePtr = nullptr;
return true;
} // end push
template<class ItemType>
bool LinkedStack<ItemType>::pop()
{
bool result = false;
if (!isEmpty())
{
// Stack is not empty; delete
top
Node<ItemType>*
nodeToDeletePtr = topPtr;
topPtr = topPtr->getNext();
// Return deleted node to
system
nodeToDeletePtr->setNext(nullptr);
delete nodeToDeletePtr;
nodeToDeletePtr = nullptr;
result = true;
} // end if
return result;
} // end pop
template<class ItemType>
ItemType LinkedStack<ItemType>::peek() const
{
assert(!isEmpty()); // Enforce precondition
// Stack is not empty; return top
return topPtr->getItem();
} // end getTop
// End of implementation file.
#endif
Main.cpp
#include <iostream>
#include <string>
#include "LinkedStack.h"
#include "Node.h"
#include "StackInterface.h"
using namespace std;
void backwards(string lang, LinkedStack<char>*
aStack)
{
int i = 0;
char ch;
ch = lang[i];
int l = lang.length();
while (lang[i] != '$')
{
aStack->push(lang[i]);
i++;
ch = lang[i];
}
// Skip the $
i++;
// Match the reverse of s
bool inLanguage = true; // Assume string is in
language
while (inLanguage && i < l)
{
if (!aStack->isEmpty())
{
int stackTop =
aStack->peek();
aStack->pop();
ch =
lang[i];
if (stackTop ==
ch)
i++; // Characters match
else
inLanguage = false;
}
else inLanguage = false;
}
if (inLanguage && aStack->isEmpty())
cout << lang << " is
in language." << endl;
else
cout << lang << " is
not in language." << endl;
}
int main()
{}
In: Computer Science
You have been hired as a capital budgeting analyst by Advent Sports, a sporting goods firm that manufactures athletic shoes. The firm believes it can generate another $10 million per year over the next 10 years by investing $10 million in a new distribution system (which will be depreciated over the system's 10-year life to a salvage value of zero). The firm will also need an initial increase of $1 million in net working capital to take on this project. The company expects its variable costs associated with these sales to be 40% of revenues, and additional advertising costs are anticipated to be $1 million per year. The firm is in the 40% tax bracket and has a hurdle rate of 8%. What is the project's NPV expected to be?
Select one:
A. $12,277,470
B. $14,556,754
C. $15,876,943
D. $17,834,221
In: Finance
Problem Description:
Write a method that returns the smallest element in a specified column in a matrix using the following header: public static double columnMin(double[][] m, int columnIndex)
Write a program that reads from the keyboard the number of rows and columns, and an array of double floating point numbers with the specified number of rows and columns.
The program will then invoke the columnMin method and displays the minimum value of all columns.
In: Computer Science
[Big Data concept] (10) Give one example of Big Data application you know. Use the detailed example to explain each of the five Big V’s. If you are required to design a database system for this application, what are the best data models (relational, XML, RDF, among others) you would use to represent the data and why?
In: Computer Science
Write a program of Binary Search in C++ by using function and arrays with the explanation.
In: Computer Science
Consider three jobs you know well, and explain the personality traits necessary for each job using the big five model of personality from the textbook. For example police officer: openness-moderate, contentiousness-high, extraversion-moderate, aggressive-low, neuroticism-low. After examining these three jobs, can you see why you may or may not have been a good fit?
Textbook: Career Development and Counseling: Putting Theory and Research to work chapters 11,12, and 17
In: Psychology
Steven has learned how stress affects his physical
health, so now he is trying to reduce stress and learn effective
ways of coping. Which of the following activities will help Steven
achieve these goals to manage stress?
a. Exercise
b. Taking counselling
c. Crying
d. Fighting
e. Yoga
f. Sprituality
g. Arguments
In: Psychology
You manage a risky portfolio with expected rate of return of 12% and a standard deviation of 24%. The T-bill rate is 3%.
In: Finance