Brandon is an analyst at a wealth management firm. One of his clients holds a $5,000 portfolio that consists of four stocks. The investment allocation in the portfolio along with the contribution of risk from each stock is given in the following table:
Stock |
Investment Allocation |
Beta |
Standard Deviation |
---|---|---|---|
Atteric Inc. (AI) | 35% | 0.900 | 38.00% |
Arthur Trust Inc. (AT) | 20% | 1.500 | 42.00% |
Li Corp. (LC) | 15% | 1.300 | 45.00% |
Transfer Fuels Co. (TF) | 30% | 0.400 | 49.00% |
Brandon calculated the portfolio’s beta as 0.930 and the portfolio’s expected return as 9.1150%.
Brandon thinks it will be a good idea to reallocate the funds in his client’s portfolio. He recommends replacing Atteric Inc.’s shares with the same amount in additional shares of Transfer Fuels Co. The risk-free rate is 4%, and the market risk premium is 5.50%.
According to Brandon’s recommendation, assuming that the market is in equilibrium, how much will the portfolio’s required return change? (Note: Do not round your intermediate calculations.)
1.1935 percentage points
0.7508 percentage points
0.9625 percentage points
1.1069 percentage points
Analysts’ estimates on expected returns from equity investments are based on several factors. These estimations also often include subjective and judgmental factors, because different analysts interpret data in different ways.
Suppose, based on the earnings consensus of stock analysts, Brandon expects a return of 9.65% from the portfolio with the new weights. Does he think that the required return as compared to expected returns is undervalued, overvalued, or fairly valued?
Overvalued
Fairly valued
Undervalued
Suppose instead of replacing Atteric Inc.’s stock with Transfer Fuels Co.’s stock, Brandon considers replacing Atteric Inc.’s stock with the equal dollar allocation to shares of Company X’s stock that has a higher beta than Atteric Inc. If everything else remains constant, the portfolio’s risk would ----- .
In: Finance
3. Select Segmentation Variables, Targeting Strategy and Positioning - be sure to include a segmentation breakdown of your customer, target market, which targeting strategy you are using and why. Also include how your product will be positioned with their industry.
In: Operations Management
C#
What to submit:
One zip file named Ass3.zip
This zip must contain one VS 2017 solution named Ass3, which contains one C# Windows Forms App project also named Ass3 and the project contains a default form, Form1.cs and Program.cs.
No change should be made in Program.cs, but your Form1 must be designed and implemented to satisfy the following requirements.
**Do not submit only a single file of the solution or project. The whole solution folder of VS 2017 must be zipped and submitted for grading.
Requirements:
In: Computer Science
How does the information provided by the Accounting Profitability ratios differ from that of the measurements of Shareholder Value Creation?
What is the importance of each set of information?
In: Operations Management
Choose one of the following and write a sales letter addressed to an appropriate audience on why they should
a. major in the same subject you did
b. live in your neighborhood
c. be happy taking a vacation where you did last year
d. dine at a particular restaurant
e. shop at a store you have worked for
f. have their cars repaired at a specific garage
g. give their real-estate business to a particular agency h. visit your website
In: Psychology
Minutes parked |
Hrs*Fee=parking fee |
25 minutes (0 hour and 25 minutes) |
1*5.00 |
05 minutes (0 hour and 5 minutes) |
1*5.00 |
55 minutes (0 hours and 55 minutes) |
1*5.00 |
30 minutes (0 hour and 30 minutes) |
1*5.00 |
10 minutes (0 hour and 10 minutes) |
1*5.00 |
60 minutes (1 hour and 0 minutes) |
1*5.00 |
Minutes parked |
Hrs*Fee=parking fee |
65 minutes (1 hour and 5 minutes) |
2*4.00 |
95 minutes (1 hour and 35 minutes) |
2*4.00 |
120 minutes (2 hours) |
2*4.00 |
135 minutes (2 hour and 15 minutes) |
3*4.00 |
180 minutes (3 hour and 0 minutes) |
3*4.00 |
195 minutes (3 hour and 15 minutes) |
4*4.00 |
240 minutes (4 hours) |
4*4.00 |
260 minutes (4 hours 20 minutes ) |
5*4.00 |
300 minutes (5 hours) |
5*4.00 |
Minutes parked |
Hrs*Fee = parking fee |
320 minutes (5 hour and 20 minutes) |
6*2.00 |
400 minutes (6 hour and 40 minutes) |
7*2.00 |
800 minutes (13 hour and 20 minutes) |
14*2.00 |
825 minutes (13 hour and 45 minutes) |
14*2.00 |
600 minutes (10 hours) |
10*2.0 |
my work:
rate1=5 rate2=4 rate3=2 fees=0 minutes = int(input("Please Enter the number of minutes parked : ")) print(minutes) if minutes>=0 and minutes<=60: if minutes%60==0: hrs=int(minutes/60) fees=hrs*rate1 print("Parking Fees (in $) is ",fees ) else: hrs=int(minutes/60)+1 fees=hrs*rate1 print("Parking Fees (in $) is ",fees ) elif minutes>60 and minutes<=300: print("It Falls in Table 2") if minutes%60==0: hrs=int(minutes/60) fees=hrs*rate2 print("Parking Fees (in $) is ",fees ) else: hrs=int(minutes/60)+1 fees=hrs*rate2 print("Parking Fees (in $) is ",fees ) elif minutes>300: print("It Falls in Table 3") if minutes%60==0: hrs=int(minutes/60) fees=hrs*rate3 print("Parking Fees (in $) is ",fees ) else: hrs=int(minutes/60)+1 fees=hrs*rate3 print("Parking Fees (in $) is ", fees) else: print("Invalid Minutes")
getting error line 36
else:
^
SyntaxError: invalid syntax please help.
In: Computer Science
Stack Variations-JAVA-self implemented
As discussed in the section, instead of having our stack methods throw exceptions in the case of "erroneous" invocations, we could have the stack methods handle the situation themselves. We define the following three "safe" methods:
-boolean safePush (T element) - pushes element onto the stack; returns true if element successfully pushed, false otherwise.
-boolean safePop () - removes the top element of the stack; returns true if element successfully popped, false otherwise.
- T safeTop() - if the stack is not empty returns the top element of the stack otherwise returns null.
a) Add these operations to the ArrayBoundedStack class.
//----------------------------------------------------------------
// ArrayBoundedStack.java by Dale/Joyce/Weems Chapter 2
//
// Implements StackInterface using an array to hold the
// stack elements.
//
// Two constructors are provided: one that creates an array of
a
// default size and one that allows the calling program to
// specify the size.
//----------------------------------------------------------------
package ch02.stacks;
public class ArrayBoundedStack<T> implements
StackInterface<T>
{
protected final int DEFCAP = 100; // default capacity
protected T[] elements; // holds stack elements
protected int topIndex = -1; // index of top element in stack
public ArrayBoundedStack()
{
elements = (T[]) new Object[DEFCAP];
}
public ArrayBoundedStack(int maxSize)
{
elements = (T[]) new Object[maxSize];
}
public void push(T element)
// Throws StackOverflowException if this stack is full,
// otherwise places element at the top of this stack.
{
if (isFull())
throw new StackOverflowException("Push attempted on a full
stack.");
else
{
topIndex++;
elements[topIndex] = element;
}
}
public void pop()
// Throws StackUnderflowException if this stack is empty,
// otherwise removes top element from this stack.
{
if (isEmpty())
throw new StackUnderflowException("Pop attempted on an empty
stack.");
else
{
elements[topIndex] = null;
topIndex--;
}
}
public T top()
// Throws StackUnderflowException if this stack is empty,
// otherwise returns top element of this stack.
{
T topOfStack = null;
if (isEmpty())
throw new StackUnderflowException("Top attempted on an empty
stack.");
else
topOfStack = elements[topIndex];
return topOfStack;
}
public boolean isEmpty()
// Returns true if this stack is empty, otherwise returns
false.
{
return (topIndex == -1);
}
public boolean isFull()
// Returns true if this stack is full, otherwise returns
false.
{
return (topIndex == (elements.length - 1));
}
}
Create a test driver application to demonstrate that the added code works correctly.
b) Add these operations to the ArrayListStack class.
//----------------------------------------------------------------------
// ArrayListStack.java by Dale/Joyce/Weems Chapter 2
//
// Implements an unbounded stack using an ArrayList.
//----------------------------------------------------------------------
package ch02.stacks;
import java.util.ArrayList;
public class ArrayListStack<T> implements
StackInterface<T>
{
protected ArrayList<T> elements; // ArrayList that holds
stack elements
public ArrayListStack()
{
elements = new ArrayList<T>();
}
public void push(T element)
// Places element at the top of this stack.
{
elements.add(element);
}
public void pop()
// Throws StackUnderflowException if this stack is empty,
// otherwise removes top element from this stack.
{
if (isEmpty())
throw new StackUnderflowException("Pop attempted on an empty
stack.");
else
elements.remove(elements.size() - 1);
}
public T top()
// Throws StackUnderflowException if this stack is empty,
// otherwise returns top element of this stack.
{
T topOfStack = null;
if (isEmpty())
throw new StackUnderflowException("Top attempted on an empty
stack.");
else
topOfStack = elements.get(elements.size() - 1);
return topOfStack;
}
public boolean isEmpty()
// Returns true if this stack is empty, otherwise returns
false.
{
return (elements.size() == 0);
}
public boolean isFull()
// Returns false - an ArrayList stack is never full.
{
return false;
}
}
Create a test driver application to demonstrate that the added code works correctly.
c) Add these operations to the LinkedStack class.
//----------------------------------------------------------------------
// LinkedStack.java by Dale/Joyce/Weems Chapter 2
//
// Implements StackInterface using a linked list to hold the
elements.
//-----------------------------------------------------------------------
package ch02.stacks;
import support.LLNode;
public class LinkedStack<T> implements
StackInterface<T>
{
protected LLNode<T> top; // reference to the top of this
stack
public LinkedStack()
{
top = null;
}
public void push(T element)
// Places element at the top of this stack.
{
LLNode<T> newNode = new LLNode<T>(element);
newNode.setLink(top);
top = newNode;
}
public void pop()
// Throws StackUnderflowException if this stack is empty,
// otherwise removes top element from this stack.
{
if (isEmpty())
throw new StackUnderflowException("Pop attempted on an empty
stack.");
else
top = top.getLink();
}
public T top()
// Throws StackUnderflowException if this stack is empty,
// otherwise returns top element of this stack.
{
if (isEmpty())
throw new StackUnderflowException("Top attempted on an empty
stack.");
else
return top.getInfo();
}
public boolean isEmpty()
// Returns true if this stack is empty, otherwise returns
false.
{
return (top == null);
}
public boolean isFull()
// Returns false - a linked stack is never full
{
return false;
}
}
Create a test driver application to demonstrate that the added code works correctly.
In: Computer Science
In: Operations Management
2 Discuss foodborne illness. Research one of the pathogens that cause this type of illness. You can choose whatever pathogen you want to discuss as long as it is associated with foodborne illness, with references, Where the pathogen is found. How to maintain safety. Any special precautions.
In: Nursing
Create a C++ program which will accept an unlimited number of
scores
and calculates the average score. You will also need to prompt for
the
total points possible. Assume each test is worth 100 points.
Requirements.
• Enter the Student ID first, then prompt for grades. Keep
prompt-
ing for grades until the client enters ’calc’. That triggers final
pro-
cessing.
• Make your code as reliable as possible.
• Make your program output easy to read.
• You cannot use anything from the standard template library.
• Use functions whenever possible to modularize your code.
Use
function prototypes and code the functions under the main().
• Style guide elements apply comments, layout, Program
Greeting,
Source File Header, and variables, etc. etc.
1. // Specification A1 - OOP
Code this assignment using at least one class. Put this
comment
above the class declaration.
2. // Specification A2 - Sort Grades
Sort the grades before printing them under specification C2.
High
to low. Use any sort you wish, but code your own sort.
3. // Specification A3 - Logfile
Log the grades to a text file for archival purposes.
4. // Specification A3 - <Description>
Replace A3 with one feature of your own choosing. You can
code
A3 as it appears if you wish and skip this.
In: Computer Science
Provide a general conclusion of the current state of the corporation and its operating environment uncovered from the formal planning process.
In: Operations Management
Compare and contrast the classical and neoclassical schools of criminology. Do you believe that one school of criminology is more relevant than the other? Explain your answer.
In: Psychology
Organizations are made up of-interrelated sub-parts. If-any one of-these subparts performs poorly, it will negatively affect the performance of-the whole-system.?
In: Economics
User asks you to develop a program that calculates and then prints interest earned on a bank balance. Program should print interest earned for the same balance when interest is accumulated annually, semiannually and quarterly. I need the C++ code!
In: Computer Science
Describe the benefits of the formal planning process with supporting evidences. Illustrate how the value of formal planning benefit for strategic decisions benefits.
In: Operations Management