Outline and explain the three essential functions of economic policy.

b) Illustrate diagrammatically stabilization versus allocation policies.

c) With the aid of appropriate diagrams explain the supply and demand shocks in an aggregate supply-aggregate demand framework.

An infinitely long line of charge has a linear charge density of 5.00×10⁻¹² C/m . A proton is at distance 16.0 cm from the line and is moving directly toward the line with speed 1000 m/s .

How close does the proton get to the line of charge?

Is there a risk of negatively impacting the revenue for the company by creating tighter credit standards? Why or why not?

1. Consider the stock XYZ, which pays no dividends. It is currently trading at $15.025 per share. The following questions refer to options and futures on this stock that expire on 9/24/2020. You may assume that this is exactly 6 months or .5 years from now in calculations.

a. Zero-coupon T-bills expiring on 9/24/2020 are currently selling for 98.5222. What is the risk-free spot interest rate?

b. What is the futures price of XYZ?

c. You want to mimic the payoff of a short future with a contract price of $16/share. How can you do this using only puts and calls? You may assume any strike is available.

Employees at the People’s Bank do not trust management and there is a shared perception that information is not shared and communication within the organization is inadequate. On January 14th 2018, Roxanne Padmore was assigned the task of selecting and implementing an investment management software at the People’s Bank. The software was intended to eradicate the need for paper and enhance the execution of transaction between various departments. Some of the eventual users of the software included the compliance, audit, investment execution and wealth management departments. The team selected for implementing the software comprised primarily of personnel from the wealth management department. The software selected by Ms. Padmore and her project team is now being used by the organization. At the end of the implementation process employees complained that the software selected was not user friendly and the software previously used was more effective. Employees also indicated that although Ms. Padmore surveyed the organization on the preferred choice of software, the eventual choice was not the best and cost millions of dollars. The software chosen by Ms. Padmore and her team was the leading brand in many developed countries, used by many banks and the Journal of Investment Management Software stated “it was highly effective and lead to long run cost savings”. However, employees have indicated that the software was not user friendly and has many deficiencies. Furthermore, the use of the software prevents employees from fulfilling critical job functions. Moreover, John Smith an employee in the Compliance Department stated that “the software did not take into consideration the peculiarities of the Caribbean and assumed that one size fits all.” Ms. Padmore and the wealth management team that were responsible for implementation have all left the organization.

(f)Discuss three assessment tools that can be used at the People’s Bank.

I am just learning C++ and need to convert my previous code to a new linked list method. Please help.

My current LL program:

#include
#include
using namespace std;

struct LLnode{
string theData;
LLnode * fwdPtr;
};

void push_front(LLnode * &llh, string newData{
if(!llh){
LLnode * newNode = new LLnode;
newNode -> theData = newData;
newNode -> fwdPtr = nullptr;
llh = newNode;
}
else{
LLnode * trav = new LLnode;
trav = llh;
LLnode * newNode = new LLnode;
newNode -> theData = newData;
newNode -> fwdPtr = trav;
llh = newNode;

}
}

void push_back(LLnode * &llh, string newData){
LLnode * trav = new LLnode;
if(!llh){
llh = new LLnode;
llh -> theData = newData;
llh -> fwdPtr = nullptr;
}
else{
LLnode * newNode = new LLnode;
newNode -> theData = newData;
newNode -> fwdPtr = nullptr;

trav = llh;
while(trav -> fwdPtr){
trav = trav -> fwdPtr;
}
trav -> fwdPtr = newNode;
}
}

int list_length(LLnode * &llh){
int count = 0;
LLnode * trav = new LLnode;
trav = llh;
if(!llh){
return 0;
}
else{
while(trav){
count ++;
trav = trav -> fwdPtr;
}
return count;
}

}

string retrieve_front (LLnode * &llh){
if(!llh)
throw string ("Exception at retrieve back");
return (llh -> theData);
}

string retrieve_back (LLnode * &llh){
LLnode * trav = new LLnode;
trav = llh;
if(!llh)
throw string ("Exception at retrieve back");
while(trav -> fwdPtr){
trav = trav -> fwdPtr;
}
return trav -> theData;
}

void display_nodes(LLnode * &llh) {
LLnode * trav = new LLnode;
trav = llh;
if(!llh){
cout << "No nodes to display " << endl;
}
else{
cout << "Displaying nodes: " << endl;
while(trav){
cout << trav -> theData << ", ";
trav = trav -> fwdPtr;
}
}
cout << endl;
}

int main(){
LLnode * theLLHeader1 = nullptr;
cout << "Main: number of nodes in empty list " << list_length(theLLHeader1) << endl;
display_nodes(theLLHeader1);
push_front(theLLHeader1, "aaaaa");
push_back(theLLHeader1, "bbbbb");
push_front(theLLHeader1, "before aaaaa");
push_back(theLLHeader1, "after bbbbb");
cout << "Main: number of nodes after 4 pushed: " << list_length(theLLHeader1) << endl;
display_nodes(theLLHeader1);
cout << "Main: retrieve front: " << retrieve_front (theLLHeader1) << endl;
cout << "Main: retrieve back: " << retrieve_back (theLLHeader1) << endl;
cout << endl;

LLnode * theLLHeader2 = nullptr;

push_front(theLLHeader2, "33333");
push_front(theLLHeader2, "22222");
push_front(theLLHeader2, "11111");
push_back(theLLHeader2, "44444");
push_back(theLLHeader2, "55555");
push_back(theLLHeader2, "66666");
display_nodes (theLLHeader2);

return 0;
}

What I need to do:

Step 1

Convert LLnode struct into a header file. Any code module that refers to LLnode will need to contain a #include for this header file.

Create a linked list class named LL. Put into the same header file as struct. It will contain private data member: a linked list header, which is just a pointer variable of type LLnode for LLnode variables

I have already coded six linked list processing functions – push_front, push_back, list_length, retrieve_front, retrieve_back, and display_list. I need to convert these functions into public member functions of the class. The constructor for the LL class should set the linked list header to nullptr. There is no destructor. I also need to Templatize the class, and a requirement for templatized class functions is that they be coded in-line in the class definition. So, code the member functions in-line within the header file. You’ll have only two course files: the header file, and the .cpp for main.

I would like evidence of Couts so I can better understand the program. This would be much appreciated.

Step 2

Using a class template, I need to change struct and class to use any variable type. Main # 2 has been set up for debugging this step.

Step 3

Add member functions that perform the following functions:

void destroy_list ()
deletes each node in the list, and resets the header to nullptr

bool search_list (key value)
searches the list for a node with the given key. Returns true if found, false if not.

bool delete_node (key value)
deletes the node which contains the given key. If there is more than one node with the same key, delete_node deletes the first occurrence. Returns true if delete successful, false if the node was not found.

Main # 3 contains a test program for testing step 3.

Here are the main classes (1,2,3)::

//MAIN 1

int main() {

LL ll1;
cout << "length of empty list - " << ll1.list_length() << endl;
ll1.display_list();
ll1.push_front("aaaaa");
ll1.push_back("bbbbb");
ll1.push_front("before aaaaa");
ll1.push_back("after bbbbb");
cout << "length of list after 4 pushes - " << ll1.list_length() << endl;
ll1.display_list();
cout << endl;

LL ll2;
ll2.push_front("33333");
ll2.push_front("22222");
ll2.push_front("11111");
ll2.push_back("44444");
ll2.push_back("55555");
ll2.push_back("66666");
ll2.display_list();

return 0;
}

//MAIN 2

int main() {

LL ll1;
cout << "main: length of empty list - " << ll1.list_length() << endl;
cout << "main: trying to display empty list 1" << endl;
ll1.display_list();
cout << "main: trying to display initial size of ll1 - " << ll1.list_length() << endl;
ll1.push_front("aaaaa");
ll1.push_back("bbbbb");
ll1.push_front("before aaaaa");
ll1.push_back("after bbbbb");
cout << "main: length of ll1 after 4 pushes - " << ll1.list_length() << endl;
cout << "main: now trying to display ll1 after 4 push's" << endl;
ll1.display_list();
cout << "main: displaying final size of ll1 - " << ll1.list_length() << endl;
cout << endl;

LL ll2;
ll2.push_front("33333");
ll2.push_front("22222");
ll2.push_front("11111");
ll2.push_back("44444");
ll2.push_back("55555");
ll2.push_back("66666");
cout << "main: now trying to display ll2 after 6 push's" << endl;
ll2.display_list();

return 0;
}

//MAIN 3

int main() {

LL ll1;
cout << "main: length of empty list - " << ll1.list_length() << endl;
cout << "main: trying to display empty list 1" << endl;
ll1.display_list();
cout << "main: trying to display initial size of ll1 - " << ll1.list_length() << endl;
ll1.push_front("aaaaa");
ll1.push_back("bbbbb");
ll1.push_front("before aaaaa");
ll1.push_back("after bbbbb");
cout << "main: length of ll1 after 4 pushes - " << ll1.list_length() << endl;
cout << "main: now trying to display ll1 after 4 push's" << endl;
ll1.display_list();
cout << "main: displaying final size of ll1 - " << ll1.list_length() << endl;
ll1.destroy_list();
cout << "main: displaying size of list 1 after destroy - " << ll1.list_length() << endl;
cout << endl;

LL ll2;

ll2.push_front("33333");
ll2.push_front("22222");
ll2.push_front("11111");
ll2.push_back("44444");
ll2.push_back("55555");
ll2.push_back("66666");
cout << "main: now trying to display ll2 after 6 push's" << endl;
ll2.display_list();
cout << "main: now searching for node 44444" << endl;
if (ll2.search_list("44444"))
{
cout <<"main: found node 44444" << endl;
}
else
{
cout << "main: did not find node 44444" << endl;
}
cout << "main: now searching for node 44445" << endl;
if (ll2.search_list("44445"))
{
cout <<"main: found node 44445" << endl;
}
else
{
cout << "main: did not find node 44445" << endl;
}
cout << "main: now trying to delete node 44444" << endl;
if (ll2.delete_node("44444"))
{
cout <<"main: node 44444 deleted" << endl;
}
else
{
cout << "main: did not find 44444 for delete" << endl;
}
if (ll2.search_list("44444"))
{
cout <<"main: searched for 44444 after delete, found" << endl;
}
else
{
cout << "main: searched for 44444 after delete, not found" << endl;
}
cout << "main: displaying whole list after delete 44444" << endl;
ll2.display_list();
cout << "main: now trying to delete node 11111" << endl;
if (ll2.delete_node("11111"))
{
cout <<"main: node 11111 deleted" << endl;
}
else
{
cout << "main: did not find node 11111 for delete" << endl;
}
cout << "main displaying whole list after delete 11111" << endl;
ll2.display_list();
ll2.destroy_list();

return 0;
}

I will much appreciate any help. Thank you.

1. Wayne’s favourite donut at Tim Hortons is the sour cream glazed donut. Tim Hortons claims that each of these donuts contains 320 calories. Suppose that the actual number of calories in a sour cream glazed donut varies according to a normal distribution with a mean of 317 calories and a standard deviation of 22 calories. Let X represent the number of calories in a randomly selected sour cream glazed donut from Tim Hortons.

(a) What is the probability that the next sour cream glazed donut Wayne consumes will contain at least 300 calories?

(b) What proportion of all sour cream glazed donuts contain between 310 and 330 calories?

(c) Tim Hortons can guarantee that only 1.5% of all sour cream glazed donuts contain more than how many calories?

In Fig, take E0 = 12 V, R1 = 4.0 W, R2 = 8.0 W, R3 = 2.0 W, and L = 2.0 H. What is the current I2 (a) immediately after the switch is first closed and (b) a long time after the switch is closed? (c) After a long time the switch is again opened. Now what is I2?

The Problem with the picture is on Problem 36 in the website below

https://www-physics.ucsd.edu/students/courses/winter2010/physics2b/hw/hw9.pdf

JAVA:

Write a program that converts a binary number to decimal (integer)

Based on user input: Ask user to input a binary number

Conditions:

Check that the binary number starts with a 1 and only has 0s and 1s

If condition is not met, ask for user to reenter a number

Conver the binary to decimal (integer)

Ask user if they want to input another number if not then the program will exit

*Please do not use built-in java functions when converting binary to decimal

Write the program with language C++ ( THE PROGRAM SHOULD CONTAIN DECISION MAKING , LOOPING AND A FUNCTION ) to design a menu for a shop . When the user makes a choice , ask for quantity, then display the total charge with sale taxes . If the user enters a choice that is unavailable ,display an error message and ask him to re-enter.

In one typed page, discuss an instance (from real life) of a government (the US government or a foreign one) taking action to promote competition / break-up monopolies. Explain the government’s motivation in this.

Please provide reference if available

A 73.0 kg ice hockey goalie, originally at rest, catches a 0.150 kg hockey puck slapped at him at a velocity of 39.0 m/s. Suppose the goalie and the ice puck have an elastic collision and the puck is reflected back in the direction from which it came. What would their final velocities (in m/s) be in this case? (Assume the original direction of the ice puck toward the goalie is in the positive direction. Indicate the direction with the sign of your answer.)

Puck: ____

Goalie: ____