d) What is the big-oh of Algorithm 3? Algorithm 3: result = 0 for r in range (n): for c in range (n) : result = result + c # end for # end for e) What is the big-oh of Algorithm 4? Algorithm 4: result = 0 for r in range (n): for c in range (n): for d in range (n*n*n): result result + d %3D # end for # end for # end for f) What is the big-oh of Algorithm 5? Algorithm 5: result = 0 %3D i = 0 while i < 2**n: result = result + i i += 1 # end while

d) What is the big-oh of Algorithm 3? Algorithm 3: result = 0 for r in range (n): for c in range (n) : result = result + c # end for # end for e) What is the big-oh of Algorithm 4? Algorithm 4: result = 0 for r in range (n): for c in range (n): for d in range (nnn): result result + d %3D # end for # end for # end for f) What is the big-oh of Algorithm 5? Algorithm 5: result = 0 %3D i = 0 while i < 2**n: result = result + i i += 1 # end while

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

Exercise 2. Give a recursive definition for the factorial operation k! n! for n ≥ 1. (remember that 1! = 0! = 1) Provide an algorithm in pseudo code to evaluate k! n! as one function Provide an algorithm in pseudo code to evaluate k! n! as three functions Evaluate the complexity of the algorithm at point 2 Evaluate the complexity of the algorithm at point 3
Following are the various algorithms time complexities expressions. Find the dominant terms and specify the Big-Oh complexity of each algorithm. S. No. Expression Dominant term(s) O (. . .) 1. 75 + 0.001n1.3 + 0.025n + (1000)4 2. 500n + 100n + 50n log10 n 3. (10n1.5)4 + 0.3n + 5n6.5 + 2.5 · n2.75 4. 150n3 + n2 log2 n + n(log2 n)4 5. 3 log10 n + log2 log2 n 6. 100n4 + 0.01n2 + 200(log2 n)4 7. n3 + 0.01n + 100n2 + 5n3 8. 2n0.5 + n0.35 + 0.5n0.25 9. 0.01n2 log2 n + n(log2 n) 10. 50n3 log3 n + n5 log3 n + 100n4
Computer Science Consider the following simple algorithm: Algorithm SimpleSum(n) //Input: A positive integer n //Output: ? result = 0 for i = 1 to n do result = result + n; end for return result What is the final result? What is the range for the number of additions (result + n) performed overall? Answer ASAP..
List the first six terms of the following sequences: a. the sequence whose nth term is n! − 10 for the first n positive integers b. the sequence whose nth term is 2n − n-1 for the first n positive integers, answers must be exact rational numbers, NOT decimal approximations c. the sequence whose nth term is (-3)n + 2n for the first n positive integers d. the sequence whose nth term is ⌊nn/2⌋ for the first n positive integers, only consider positive roots e. the sequence whose first two terms are 1 and 2 and each succeeding term is the product of the two previous terms
Consider the following algorithm segment. for i := 1 to 9 for j := 1 to i [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next i How many times will the inner loop be iterated when i = 2? How many times will the inner loop be iterated when i = 3? How many times will the inner loop be iterated when the algorithm is implemented and run?
Explain Algorithm: To sequentially search for the first occurring even number in the list of numbers given.Input 1: –1, 3, 5, 7, –5, 7, 11, –13, 17, 71, 21, 9, 3, 1, 5, –23, –29, 33, 35, 37, 40.Input 2: 6, 17, 71, 21, 9, 3, 1, 5, –23, 3, 64, 7, –5, 7, 11, 33, 35, 37, –3, –7, 11.Input 3: 71, 21, 9, 3, 1, 5, –23, 3, 11, 33, 36, 37, –3, –7, 11, –5, 7, 11, –13, 17, 22.
Assume that each of the following expressions indicates the number of operations performed by an algorithm for a problem size of n. Point out the dominant term of each algorithm and use big-O notation to classify it. 2n – 4n2 + 5n 3n2 + 6 n3 + n2 – n
Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
You are now the professor. Which of the steps to develop an iterative algorithm did the student fail to do correctly in the following code? How? How would you fix it?algorithm Eg(I) pre-cond: I is an integer. post-cond: Outputs Ij=1 j .begins = 0i = 1while( i ≤ I )loop-invariant: Each iteration adds the nextterm giving that s = ij=1 j .s = s +ii = i + 1end loopreturn(s )end algorithm
Design an algorithm for testing if a given number belongs to the following sequence or not, compute its time complexity. u(0)=1, u(1)=1, u(N)=u(N-1)+N.u(N-2)+N
This problem compares the running times of the following two algorithms for multiplying:algorithm KindergartenAdd(a, b) pre-cond: a and b are integers. post-cond: Outputs a × b.
Python: Big O a) What is the big-oh of Algorithm 0?Algorithm 0: result = 0 for i in range(10000000): result = result + i b) What is the big-oh of Algorithm 1?Algorithm 1: result = 0 for i in range(n): result = result + I # end for c) What is the big-oh of Algorithm 2?Algorithm 2: result = 0 for r in range(n): c = n while c > 1: result = result + c c = c // 2 # end while # end for d) What is the big-oh of Algorithm 3?Algorithm 3: result = 0 for r in range(n): for c in range(n): result = result + c # end for # end for e) What is the big-oh of Algorithm 4?Algorithm 4: result = 0 for r in range(n): for c in range(n): for d in range(n*n*n): result = result + d # end for # end for # end for f) What is the big-oh of Algorithm 5?Algorithm 5: result = 0 i = 0 while i < 2**n: result = result + I…