1. Give a big-0 estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm. 1:=0 for i := 1 to 3 for j :=1 to 4 1:=1+ij 2. Give a big-0 estimate for the number additions used in this segment of an algorithm. t:=0 for i := 1 to n for j:= 1 to n t:=t+i+j

1. Give a big-0 estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm. 1:=0 for i := 1 to 3 for j :=1 to 4 1:=1+ij 2. Give a big-0 estimate for the number additions used in this segment of an algorithm. t:=0 for i := 1 to n for j:= 1 to n t:=t+i+j

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

If the efficiency of the algorithm doIt can be expressed as 0(n) = n², analyze and calculate the efficiency of the following program segment: 1=1 loop (in) 4 JHA loop (j
9. Give a big-O estimate for the number of operations, where an operation is an addition or a multiplication, used in this segment of an algorithm.
Consider the following algorithm. Algorithm Loops(n): S =0 for i = 1 to 2.n do for k = 1 to 4.n do S =s +k.k. k return s a. What is its basic operation? b. How many times is the basic operation executed? c. What is the efficiency class of this algorithm?
plz send correct answer asap
Determine the order of growth of the following snippet of code:
Indicate the run time complexity: for i +0 to 99: for j = 0 to n - 1: y++; O O(n lg n) O(n?) O O(n²) O O(n) O Ollg n) O None of the choices
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?
Give the exact number of multiplications performed in the following segment of an algorithm assuming a1, a2, ..., a, are positive real numbers and n=50. for i = 1 to n for j= i+1 to n tij = ia;
Consider the following algorithm segment. Assume that n is a positive integer. for i:=1 to 4n S := 0 for i:=1 to i - 1 s := s + j(i- j + 1) next j r:= s² next i (a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if-then statements, and ignore those implied by for-next loops. Express your answer in terms of n. (Hint: See Example 11.3.3 and exercises 11.3.11a and 11.3.14a in the "Read It" link.) The number of operations is (b) Apply the theorem on polynomial orders to the expression in part (a) to find that an order for the algorithm segment is n
Consider the following algorithm: sum = 0 for j in range(1,15): sum = sum + (5*j - 1) print(sum) What is printed as a result of executing this algorithm?
Question 9 Evaluate and calculate the worst case running time for the following algorithm, show the steps Full explain this question
Computer science