1 Theoretical Literature Contends That Whether The Expectations Augmented Phillips C 3182711

1. Theoretical literature contends that whether the expectations-augmented Phillips curve fits the databetter. In doing this it assumes that next period’s expected inflation rate is given by the inflation rateobserved today (pt+1 = pt). In this exercise you are asked to investigate whether the fit improves if oneuses economic forecaster’s measures of inflation expectations.a. Go to http://research.stlouisfed.org/fred2 and click on “Consumer Price Index (CPI)” and then select“Consumer Price Index for All Urban Consumers: All Items.” Click on “Download Data” and change theunit to “Percent Change from Year Ago” to obtain inflation rates. You will have to take the averages inEXCEL to get annual rates. Work on the data between 1978 and 2018. Also download annualunemployment rate (µt) data for the same period on www.bls.gov/cps. Scroll down to “CPS Database”and click on “Top Picks” next to “Labor Force Statistics including the National Unemployment Rate.”Then, download “Unemployment Rate— LNS14000000.” You will have to take the averages in EXCEL toget annual rates.b. Now do a search for “University of Michigan Inflation Expectation.” (Transform the monthly data intoannual by using the option “Last Month of Year” or You will have to take the averages in EXCEL to getannual rates.) Copy the annual data into your EXCEL file.c. Compute the difference between inflation and expected inflation (pt-pe
t). In computing the differencebe careful about the dating of the variables. The University of Michigan inflation expectation variablesgives the expected inflation over the following year. For example, the 1978 observation is equal to 7.3.This means that inflation during 1979 is expected to be equal to 7.3 percent.d. Create a scatter plot that has the difference between inflation and expected inflation on the Y axisand the unemployment rate on the X axis. Visually compare the graph you obtained with Figure 6-6 inthe chapter. Which one looks more like a Phillips curve?* e. If you have taken a statistics class use EXCEL or a statistical program in order to run the followingregression:pt-pe
t=?+ßxµt+et
What is the implied slope of the Phillips curve? Is it statistically significant? Interpret your results.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 Think Of Two Firms Colluding To Earn Monopoly Profits By Each Agreeing To Enjoy Ha 3618165

1. Think of two firms colluding to earn monopoly profits by each agreeing to enjoy half the market share. (a). If each firm honors this agreement, calculate each firm’s level of output and the resulting profit enjoyed by each firm. (b). In general, when can such an arrangement be feasible, that is, when will each firm have an incentive to honor such an agreement? 2. What can you say, in general, about the Cournot-Nash equilibrium quantities and prices as the number of sellers (n) competing in the industry rises?

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Various Rates Of Financial Products Are Gold 735 Oz Gold Rs 13000 10gms Re Usd 1551940

1. The various rates of financial products are:

Gold – $735/Oz; Gold – Rs. 13000/10gms; Re/USD – Rs. 48; Oil – $148

Analyze the rate fluctuation in the price of above products & prepare a report for data between Feb 2008 to 31 march 2009.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Various Rates Of Financial Products Are Gold 735 Oz Gold Rs 13000 10gms Re Usd 1591383

1. The various rates of financial products are:

Gold – $735/Oz; Gold – Rs. 13000/10gms; Re/USD – Rs. 48; Oil – $148

Analyze the rate fluctuation in the price of above products & prepare a report for data between Feb 2008 to 31 march 2009.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Various Rates Of Financial Products Are Gold 735 Oz Gold Rs 13000 10gms Re Usd 1549140

1. The various rates of financial products are:

Gold – $735/Oz; Gold – Rs. 13000/10gms; Re/USD – Rs. 48; Oil – $148

Analyze the rate fluctuation in the price of above products & prepare a report for data between Feb 2008 to 31 march 2009.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Various Rates Of Financial Products Are Gold 735 Oz Gold Rs 13000 10gms Re Usd 1551927

1. The various rates of financial products are:

Gold – $735/Oz; Gold – Rs. 13000/10gms; Re/USD – Rs. 48; Oil – $148

Analyze the rate fluctuation in the price of above products & prepare a report for data between Feb 2008 to 31 march 2009.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Traveling Salesman Problem Tsp Is A Famous Problem For Which There Is No Known 2835377

1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known,

tractable solution (though efficient, approximate solutions exist). Given a list of cities and the

distances in between, the task is to find the shortest possible tour (a closed walk in which all

edges are distinct) that visits each city exactly once.

Consider the following algorithm for solving the TSP:

n = number of cities

m = n x n matrix of distances between cities

min = (infinity)

for all possible tours, do:

find the length of the tour

if length

min = length

store tour

a) What is the worst-case (big-O) complexity of this algorithm in terms of n (number of

cities)? You may assume that matrix lookup is O(1), and that the body of the ifstatement

is also O(1). You need not count the if-statement or the for-loop conditional

(i.e., testing to see when the for-loop is done), or any of the initializations at the start of

the algorithm. Clearly show the justification for your answer.

b) Given your complexity analysis, assume that the time required for the algorithm to run

when n = 10 is 1 second. Calculate the time required for n = 20 and show your work.

2. Suppose an algorithm solves a problem of size x in at most the number of steps listed in each

question below. Calculate the asymptotic time complexity (big-T or big-theta) for each example

below. Show your work, including values for c and x0along the way.

a) T(x) = 1

b) T(x) = 5x – 2

c) T(x) =3x^3+ 2 + x2

d) T(x) = log (x * 2x!)

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Traveling Salesman Problem Tsp Is A Famous Problem For Which There Is No Known 2835379

1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known,

tractable solution (though efficient, approximate solutions exist). Given a list of cities and the

distances in between, the task is to find the shortest possible tour (a closed walk in which all

edges are distinct) that visits each city exactly once.

Consider the following algorithm for solving the TSP:

n = number of cities

m = n x n matrix of distances between cities

min = (infinity)

for all possible tours, do:

find the length of the tour

if length

min = length

store tour

a) What is the worst-case (big-O) complexity of this algorithm in terms of n (number of

cities)? You may assume that matrix lookup is O(1), and that the body of the ifstatement

is also O(1). You need not count the if-statement or the for-loop conditional

(i.e., testing to see when the for-loop is done), or any of the initializations at the start of

the algorithm. Clearly show the justification for your answer.

b) Given your complexity analysis, assume that the time required for the algorithm to run

when n = 10 is 1 second. Calculate the time required for n = 20 and show your work.

2. Suppose an algorithm solves a problem of size x in at most the number of steps listed in each

question below. Calculate the asymptotic time complexity (big-T or big-theta) for each example

below. Show your work, including values for c and x0along the way.

a) T(x) = 1

b) T(x) = 5x – 2

c) T(x) =3x^3 + 2 + x^2

d) T(x) = log (x * 2x!)

Document Preview:

ECS 32B: Fall 2018 Homework Assignment 1 Due Date: No later than Saturday, October 13, 9:00pm 0. Make sure to clearly identify your name, student number, and your discussion section on the work you submit. Submit only one pdf file via Canvas…do not submit a separate file for each problem. 1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known, tractable solution (though efficient, approximate solutions exist). Given a list of cities and the distances in between, the task is to find the shortest possible tour (a closed walk in which all edges are distinct) that visits each city exactly once. Consider the following algorithm for solving the TSP: n = number of cities m = n x n matrix of distances between cities min = (infinity) for all possible tours, do: find the length of the tour if length

Attachments:

ECS-32B-homew….pdf

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Value Of F B Ds Along Closed Path In A Magnetic Field Is Given By 6 28 X 10 T 203860

The value of F B. ds along closed path in a magnetic field is given by 6.28 X 10 T.m. What is the total current that passes througn this closed path?

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW

1 The Task Of Any Business Is To Deliver At A Profit 775678

1. The task of any business is to deliver ________ at a profit.

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
ORDER NOW