1- How many times is Step 4 executed in the following algorithm? What is the time complexity of the algorithm? 1. count←02. fori←1ton3. forj←1to⌊logn⌋4. count←count+15. end for 6. end for 2-How many times is Step 6 executed in the following algorithm? What is the time complexity of the algorithm?

1- How many times is Step 4 executed in the following algorithm? What is the time complexity of the algorithm? 1. count←02. fori←1ton3. forj←1to⌊logn⌋4. count←count+15. end for 6. end for 2-How many times is Step 6 executed in the following algorithm? What is the time complexity of the algorithm?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.4: Arithmetic Operations

Problem 6E

See similar textbooks

Similar questions

1. We are given the following algorithm segment as below: for j := 1 to 2n for k:=1 to 2n a[j] = 2 * k + j - 1; next j next k a. What is the number of elementary operations per loop iteration? b. What is the total number of loop iterations? c. What is the total number of elementary operations? d. What is the order of the algorithm segment (0)?
I. Compute for the running time for each algorithm 1. for i = 1 to n do Statement B 2. for(j=1; js n*n*n;j++) for (k=1; ksn) Statement f; for(m=1;m
What does the above Algorithm computes? Is it a memorized algorithm? Justify your answer. Execute the given algorithm when n=4 and k=2.
Question 5 : Consider the following algorithm 1. count := 0 2. for i := 1 to n 3. for j:=i to i+5 4. for k := 1 to i? 5. count := count +1 a) How many times step 5 is executed? (You must show your steps) b) What is the time complexity of the algorithm in O-notation?
1. Write the running time of given algorithm: Procedure fun (N, Q, M) while N> 0 do for j = 1 to Q do %3D print ("Hello World!") endfor for k = 1 to M/3 do %3D print ("Hello Again!") endfor N = N-2 Enddo endProcedure
Determine how many times the innermost loop will be iterated when the following algorithm segment is implemented and run. (Assume that m, n, and p are positive integers.) for i:=1 to m for j :=1 to n for k = 1 to p [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next k next j next i
4. Consider the following algorithm. ALGORITHM Mystery(n) /Input: A nonnegative integer n S+ 0 for i +1 to n do S+S+i *i return S a. What does this algorithm compute? b. What is its basic operation? c. How many times is the basic operation executed? d. What is the efficiency class of this algorithm?
What is the time complexity for the following algorithm? Select one: a. Θ(n3) b. Θ(n2) c. Θ(log n) d. Θ(n)
Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7. Note that 3, 5, and 7 do not have to be factors, but it should not have any other prime factors. For example, the first several multiples would be (in order) 1, 3, 5, 7, 9, 15, 21.
What is the execution time and time complexity of the algorithm below?
A certain computer algorithm executes twice as many operations when it is run with an input of size k as when it is run with an input of size k - 1 (where k is an integer that is greater than 1). When the algorithm is run with an input of size 1, it executes seven operations. How many operations does it execute when it is run with an input of size 24? For each integernz 1, let s,-1 be the number of operations the algorithm executes when it is run with an input of size n. Then for each integer 2 1. Therefore, So, S3. Sz. is -Select- and s,= with constant Select- ,which is . So, for every integer n 2 0, s, = It follows that for an input of size 24, the number of operations executed by the algorithm is s -Select-v which equals Need Heln? Desd
What is the time complexity for the following algorithm? Select one: a. Θ(n) b. Θ(1) c. Θ(n2) d. Θ(log n)