![(b) Consider the following algorithm for (i = n; i >-1; i i/2) for j in range [1, i] Constant Number of Operations Derive the run time of the above algorithm (as a function of n). You must formally derive the run-times (merely stating run times or high level explanation of run time do not suffice)](http://img.homeworklib.com/questions/49371060-346c-11eb-81d8-a1086fb10e9b.png?x-oss-process=image/resize,w_560)
Homework Answers
Hi, Please find my answer.
Please let me know in case of any issue.
Add Answer to:
(b) Consider the following algorithm for (i = n; i >-1; i i/2) for j in...
consider this segment of an algorithm: for i := 1 ton n for j:=1 to n...
consider this segment of an algorithm: for i := 1 ton n for j:=1 to n top:=ij+j+10 a. find a function f(n) that counts the number of multiplication and additions performed in this segment. b. Give a big O estimate for the number of additions and multiplications used in the segment
Consider the following algorithm. ALGORITHM Enigma(A[0.n - 1]) //Input: An array A[0.n - 1] of integer...
Consider the following algorithm. ALGORITHM Enigma(A[0.n - 1]) //Input: An array A[0.n - 1] of integer numbers for i leftarrow 0 to n - 2 do for j leftarrow i +1 to n - 1 do if A[i] = = A[j] return false return true a) What does this algorithm do? b) Compute the running time of this algorithm.
Analyze the running time of the following algorithms asymptotically. (a) Algorithm for-loop(n): P = 1 for...
Analyze the running time of the following algorithms asymptotically. (a) Algorithm for-loop(n): P = 1 for i = 1 to 5n^2 do p = p times i return p (b) Algorithm for-loop(n): s = 0 for i = 1 to n do for j = I to n do s = s + i return s (c) Algorithm WhileLoop(n): x = 0; j = 2; while (j = n){x = x+ 1; j =j times 2;}
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1...
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a and b are integers while (a>0) B- a/2 A a-2 end while return b; i. What is the time complexity of the IterativeFunction pseudocode shown above? ii. What is the space complexity of the IterativeFunction pseudocode shown above? 2. What is the time complexity of the following algorithm (Note that n(n+1) 2,2 n(n+1)(2n+1) 2 and ): Provide both T(n) and order, e(f(n)). int A=0;...
fundamental algorithm AllLessThan1 (int C A, B) return bool for (i-1 to |AI) for (j-1 to B if (A[1] >=B[j]) ret...
fundamental algorithm
AllLessThan1 (int C A, B) return bool for (i-1 to |AI) for (j-1 to B if (A[1] >=B[j]) return FALSE ; return TRUE; AllLessThan2 (int[] A,B) return bool largeAA[1] for (i 2 to |AI) if (A[i] > largeA) largeA A[i]; for (j = 1 to IBD if (largeA >= B[j]) return FALSE; return TRUE; C. For any particular arrays A, B, let ti(A, B) and t2(A, B) be the running times of the two algo- rithms for inputs...
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a...
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a list of n integers) for i = 2 to n do c= j=i-1 while (j > 0) do if ra; then break end if 4j+1 = a; j= j-1 end while j+1 = 1 end for 14: return 0.02. 1, 15: end procedure Answer the following questions: (1) Run the algorithm with input (41, 02, 03, 04) = (3, 0, 1,6). Record the values...
Suppose that d ≥ 2 is an integer constant. In a d-ary tree, each node has...
Suppose that d ≥ 2 is an integer constant. In a d-ary tree, each node has at most d nonempty subtrees. For example, the trees discussed along with heaps had d = 2. We can represent a nearly complete d-ary tree with n nodes using an array whose indexes range from 0 to n−1. (This is different from Cormen’s arrays, whose indexes range from 1 to n.) Suppose that i is the index of a node in the array....
Let A = [A[1], A[2],…..,A[n]] be an array of n distinct integers. For 1 <= j...
Let A = [A[1], A[2],…..,A[n]] be an array of n distinct integers. For 1 <= j <= n, the index j is a happy index if A[i] < A[j] for all 1 <= i < j. Describe an O(n)- time algorithm that finds all the happy indices in the array A. Partial credit will be given for an O(n log(n))-time algorithm and a minimal credit will be given for an O(n^2) –time algorithm. What is the running time of your...
Question 2 Consider the following algorithm Fun that takes array A and key Kas Fun(AO,...,n -...
Question 2 Consider the following algorithm Fun that takes array A and key Kas Fun(AO,...,n - 1], K) count = 0 for i = 0 ton - 1 do for j = i +1 to n - 1 do if A[i] + A[j] == K then count = count +1 end if end for end for return count What is the best case time complexity of the above algorithm?! (log(n)) O(1) (n) (na) Previous o H H 9
Consider the following algorithm. ALGORITHM Enigma(A[0.n - 1]) //Input: An array A[0.n - 1] of integer numbers for i leftarrow 0 to n - 2 do for j leftarrow i +1 to n - 1 do if A[i] = = A[j] return false return true a) What does this algorithm do? b) Compute the running time of this algorithm.
Analyze the running time of the following algorithms asymptotically. (a) Algorithm for-loop(n): P = 1 for i = 1 to 5n^2 do p = p times i return p (b) Algorithm for-loop(n): s = 0 for i = 1 to n do for j = I to n do s = s + i return s (c) Algorithm WhileLoop(n): x = 0; j = 2; while (j = n){x = x+ 1; j =j times 2;}
Consider the following pseudocode: Algorithm RecursiveFunction (a, b) // a and b are integers if (as1 ) return b; else return RecursiveFunction (a-2, a/2); endif a. What is the time complexity of the RecursiveFunction pseudocode shown above? b What is the space complexity of the RecursiveFunction pseudocode shown above? n(n+1) C. What is the time complexity of the following algorithm (Note that 21-, i = n(n+1)(2n+1). and Σ.,1 ): Provide both T(n) and order, Ofn)). int A=0; for (int i=0;i<n;i++)...
Question No.1 [CLO 1][7 marks] 1. Consider the following pseudocode: Algorithm IterativeFunction (a, b) // a and b are integers while (a>0) B- a/2 A a-2 end while return b; i. What is the time complexity of the IterativeFunction pseudocode shown above? ii. What is the space complexity of the IterativeFunction pseudocode shown above? 2. What is the time complexity of the following algorithm (Note that n(n+1) 2,2 n(n+1)(2n+1) 2 and ): Provide both T(n) and order, e(f(n)). int A=0;...
fundamental algorithm
AllLessThan1 (int C A, B) return bool for (i-1 to |AI) for (j-1 to B if (A[1] >=B[j]) return FALSE ; return TRUE; AllLessThan2 (int[] A,B) return bool largeAA[1] for (i 2 to |AI) if (A[i] > largeA) largeA A[i]; for (j = 1 to IBD if (largeA >= B[j]) return FALSE; return TRUE; C. For any particular arrays A, B, let ti(A, B) and t2(A, B) be the running times of the two algo- rithms for inputs...
(V). Given the following algorithm, answer relevant questions. Algorithm 1 An algorithm 1: procedure WHATISTHIS(21,22,...,n: a list of n integers) for i = 2 to n do c= j=i-1 while (j > 0) do if ra; then break end if 4j+1 = a; j= j-1 end while j+1 = 1 end for 14: return 0.02. 1, 15: end procedure Answer the following questions: (1) Run the algorithm with input (41, 02, 03, 04) = (3, 0, 1,6). Record the values...
Question 2 Consider the following algorithm Fun that takes array A and key Kas Fun(AO,...,n - 1], K) count = 0 for i = 0 ton - 1 do for j = i +1 to n - 1 do if A[i] + A[j] == K then count = count +1 end if end for end for return count What is the best case time complexity of the above algorithm?! (log(n)) O(1) (n) (na) Previous o H H 9
Most questions answered within 3 hours.
-
A resistor and the capacitor are used to control the timing in
the RC circuit of...
asked 8 minutes ago -
Five moles of monatomic ideal gas have initial pressure 2.50 ×
103 Pa and initial volume...
asked 8 minutes ago -
Living in a group could bring several disadvantages to an
individual. What are some of the...
asked 25 minutes ago -
Complete and balance the following reactions. In case of no
reaction occurring write NR.
Mix #1:...
asked 31 minutes ago -
If an economy consumes 75% of any increase in income, then an
increase in autonomous investment...
asked 34 minutes ago -
A shotputter throws the shot with an initial speed of 15.8 m/s
at a 38.0 ∘...
asked 50 minutes ago -
Debra and Merina sell electronic equipment and supplies through
their partnership. They wish to expand their...
asked 51 minutes ago -
How does a linear regression allow you to better estimate
trends, costs, and other factors in...
asked 59 minutes ago -
1. (15%) Describe the difference between a pull (Kanban), push
and CONWIP production systems.
asked 55 minutes ago -
QUESTION 5
The total area under the Z distribution curve is equal to:
a.
10
b....
asked 1 hour ago -
Using Python
The variables x and y refer to numbers. Write a code segment
that prompts...
asked 1 hour ago -
If
the coefficient of static friction between a box and the floor is
0.35 with what...
asked 1 hour ago