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 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. Use the Peano kernel to determine the error of the trapezoidal sum rule.
2. Calculate the numerical convergence of (9.39) and (9.40) with the composite trapezoidal sum rule to show that the possession of derivatives does matter.
3. Show that Romberg integration with two levels of resolution h0 and h1 = h0/2 gives Simpson's rule, and with three levels of resolution (h2 = h0/4) gives Boole's rule.
1.To help software organizations analyze their current process, organize work tasks, control and monitor progress and manage technical quality, organization uses A.process framework designs B.process launch C.process framework scripts D.process technology tools 2. Software process are adopted by A.software engineers B.telecommunication engineers C.mechanical engineers D.civil engineers 3. In plan-do-check-act cycle, establishment of process objectives, activities and task necessary to achieve high quality software is accomplished by A.plan B.do C.check D.act 4. PSP process model defines framework activities that are A. 2 B.3 C.4 D.5 5. Sophisticated process management can be done by A.artificial Intelligence software B.web applications C.system software D.application software
Hi there! Click one of our representatives below and we will get back to you as soon as possible.