1. Determine the running time of the following algorithm. Write summations to represent loops and solve using bounding. Be sure to show work on both the upper bound and lower bound, justify the split, and check that the bounds differ by only a constant factor. Use asymptotic notation to write the answer. Func1(n) 1 2 3 4 5 6 7 8 9 10 11 S← 0; for i ←n to n² do for j← 1 to i do for k9n to 10n² do for mi to k end end end return (s); end s+s + i- j + k −m;

1. Determine the running time of the following algorithm. Write summations to represent loops and solve using bounding. Be sure to show work on both the upper bound and lower bound, justify the split, and check that the bounds differ by only a constant factor. Use asymptotic notation to write the answer. Func1(n) 1 2 3 4 5 6 7 8 9 10 11 S← 0; for i ←n to n² do for j← 1 to i do for k9n to 10n² do for mi to k end end end return (s); end s+s + i- j + k −m;

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

course: Introduction to Algorithms Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n ≤ 10. Make your bounds as tight as possible, and justify your answers. a. T (n) = 2T (n) + n log n
What is the difference between Transform and Conquer & Divide and Conquer? Justify your answer by providing at one example for each algorithm in solving a problem.
Assume that n is a power of 2. How many timeswill the body of the for-mloop be executed?Do not use the asymptotic notations to simplify your answer.
Consider a divide-and-conquer algorithm that calculates the sum of all elements in a set of n numbers by dividing the set into two sets of n/2 numbers each, finding the sum of each of the two subsets recursively, and then adding the result. What is the recurrence relation for the number of operations required for this algorithm? Answer is f(n) = 2 f(n/2) + 1. Please show why this is the case.
Design a divide-and-conquer algorithm for the problem of finding the longest sequence of consecutive negative numbers in a list of negative and positive numbers. Find the time complexity of your algorithm (type recurrence relation first). Example input: [2, 5, 0, -3, -5, 0, -1, -2, -1, 2]; Output: [-1, -2, -1] assum : In this example there are two consecutive sequences of negative numbers. [-3, -5] and [-1, -2, -1]. Since the second one is longer, that is the output.
The asymptotic complexity of this algorithm is O(nlogn). If we change the algorithm so that tin each phase: if the number of rows is more than the number of columns, choose the middle row instead of the middle column, find the max and remove half the rows as we did for columns. Then what is the asymptotic complexity of the new algorithm? How does new algorithm work?(Prove)
Lets say an algorithm has 2 base cases. PsuedoCode: if n == 1 return 0 if n == 2 return 1 return A[n..............n-1]solve the recurrence relation for the above simple recursive algorithm?
Solve as soon as possible will give u a postive rating but answer must be correct Compute and analyse the Time Complexity of T-Coffee Algorithm and State your observations that how it can be optimized.
If we want to prove P = NP, we only need to pick up any one NPC problem and design a polynomial-time algorithm for the problem. If you want to prove P = NP, select one NPC problem based on your preference and describe your idea of a polynomial-time algorithm that solves the problem. It does not have to be a formal algorithm or pseudo-code, a description of your idea of designing such an algorithm would be fine.
For the 8-queens problem, define a heuristic function, design a Best First Search algorithm in which the search process is guided by f(n) = g(n) + h(n), where g(n) is the depth of node n and h(n) is the heuristic function you define, and give the pseudo code description.
Given algorithm to count least common multiplicator (LCM) from two real numbers a and b. For example, lcm(10,12) will return 60. lcm(a, b): result = a; while(result mod b != 0):result = result + a;endwhile return result Show that the algorithm is correct using loop invariant. What is the loop invariant? Determine correctness in initialization, maintenance and its effects on termination.
Please explain Solve the recurrence: T(n)=2T(2/3 n)+n^2. first by directly adding up the work done in each iteration and then using the Master theorem. Note that this question has two parts (a) Solving IN RECURSION TREE the problem by adding up all the work done (step by step) and (b) using Master Theorem