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.
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.
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.
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!)
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
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?
1. The task of any business is to deliver ________ at a profit.
1. The structural model of an economy is given as below
C=400+0.8Yd Consumption function
I=350 Investment
G=450 Government expenditure
T=200 Tax
i) Derive the savings function (2 marks)
ii) Derive the government expenditure and tax multiplier (4 marks)
iii) Compute equilibrium income and consumption (4 marks)
1. The Speedway Clinical Laboratory is a scientific blood-testing facility that receivessamples from local hospitals and clinics. The blood samples are passed through severalautomated tests, and the results are printed through a central computer that readsand stores the information about each sample that is tested.
Management is concerned about the quality of the service it provides and wants toestablish quality-control limits as a measure for the quality of its tests. Such managerialpractice is viewed as significant, because incorrect analysis of a sample can leadto a wrong diagnosis by the physician, which in turn might cost the life of a patient.
For this reason, 100 blood samples were collected at random each day after they hadgone through testing. After retesting was performed manually on this sample, theresults were:
Day
Incorrect Analysis
Day
Incorrect Analysis
Day
Incorrect Analysis
1
8
8
6
15
2
2
3
9
3
16
1
3
1
10
1
17
0
4
0
11
4
18
6
5
4
12
6
19
3
6
2
13
5
20
2
7
9
14
10
1) Title: initially this might be regarded as a working title, and ideally should mirror closely the content of the introduction. The title is particularly important as it will get people to stop and listen. 2) Introductory part: This informs the reader of the problem or situation and the context you are interested in. The goal is to give the viewers some basic academic information they can use to evaluate the significance of the research proposal. 3) Rationale for this study. – What is the research issue? – Why is it an issue? – Why is it an issue now? – What could this research shed light on? Document Preview:
1) Title: initially this might be regarded as a working title, and ideally should mirror closely the content of the introduction. The title is particularly important as it will get people to stop and listen. 2) Introductory part: This informs the reader of the problem or situation and the context you are interested in. The goal is to give the viewers some basic academic information they can use to evaluate the significance of the research proposal. 3) Rationale for this study. – What is the research issue?- Why is it an issue?- Why is it an issue now?- What could this research shed light on? You have to introduce the topic and clarify the significance of what you are trying to present. That is, you have to present research questions with a logical sequencing of facts. You have to give examples to illustrate your rationale. Be sure to have a conclusion that summarises your take-home message (why is it an issue now? what could this research shed light on?). Your introduction should be constructed so that it presents the desired information in a self- explanatory manner. You have to think of the introduction as a highly efficient, organised document upon which appear synopsis of the relevant information you want to convey (what is the research issue?), Just enough to get your point across. 4) Include references: You are required to identify previously conducted research in the area that you are focusing on. These sources need to be referred within your rationale section. Make it clear that you know what has been done in your area in the past and where your research will fit in. 5) Format: You have to make your introduction appealing. Simplify and include only relevant information. Be attentive to the structure and placement of your content. Write clearly. Make sure your introduction includes complete sentences and accurate spelling and punctuation. I hope it is clear now. I have attached a sample mark sheet as well so that you know how marks are…
Attachments:
proposal-a-te….docx
Hi there! Click one of our representatives below and we will get back to you as soon as possible.