Approximate the value of sum after the following code fragment, in terms of variable n in Big-Oh notation. int sum = 0; for (int i = 1; i <= n - 3; i++) { for (int j = 1; j <= n + 4; j += 5) { for (int k = 1; k <= n + 4; k += 5) { sum += 2; } } sum++; } for (int i = 1; i <= 100; i++) { sum++; }

Approximate the value of sum after the following code fragment, in terms of variable n in Big-Oh notation. int sum = 0; for (int i = 1; i <= n - 3; i++) { for (int j = 1; j <= n + 4; j += 5) { for (int k = 1; k <= n + 4; k += 5) { sum += 2; } } sum++; } for (int i = 1; i <= 100; i++) { sum++; }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Related questions

Q: sum = 0; for (int i = 1; i<n; i = sum++ 2*i)

A: Algorithm for the given code Declare a variable n and take the input for the value n. Declare sum…

Q: void test() { int i; int a[5]; void f(int x) { a[i] = 4 i = i + 1; i = 2 * x;

A: Call by copy-in-copy-out : As we know call by Copy-in-Copy-Out is also called a Call by…

Q: iii. 111. int sum = 0; for ( int i = 0; i<n; ++i ) { for ( int j= 0; j<n; ++j) { sum += f( j, 10 );…

A: Time complexity of whole code will be given by multiplying complexities of for loops and function…

Q: Given the following piece of code : int i=5,sum = 0; while (i<10) { sum-=i; i++; } What is the value…

A: Given code is: int i = 5, sum = 0;while (i < 10){ sum -= i; i++;}

Q: Determine the growth function and order of the following code fragment: for (int count=0; count < n;…

A: the growth function and order of the following code fragment:for (int count=0; count < n;…

Q: What would be the missing part of the following C program to make following calculation? y[n] = );…

A: Here in the given question, we need to complete the function foo(), such that each index holds the…

Q: Describe the execution of the following program segment. 1. int c[2] [3]; 2. int a[2] [3] ={ {5},…

A: Here the content of array a is 5 0 0 1 2 0 Content of array b is 2 4 6 8 0 0

Q: int n = 1; int k - 2; int r = n; if (k < n) { r -

A: The value of each variable after if is

Q: Compute f(6) for the recursive function below. def f(n): if n == 0: return 1 if n == 1: return 2…

A: def f(n): # the user define function if n == 0: # if n = 0 return 1 #…

Q: ode in java pls Summary: Given integer values for red, green, and blue, subtract the gray from…

A: Given: Computers represent color by combining the sub-colors red, green, and blue (rgb). Each…

Q: Identify and fix the errors in the following code: 1 int main() 2 { 3 double[100] r; 4 5 for (int i…

A: Line no. 3: invalid declaration Line no. 5 : semicolon in the end Line no. 6 : () instead of []…

Q: (a) sum= 0; for (int i = 0; i 1) { sum++; i= 1/2; } = 2*log2 (n) We denote by Ta(n), Tb (n), Te(n)…

A: Fragment: A fragment is a portion of code that is incomplete or lacks the necessary syntax to be…

Q: Problem: 2D random walk. A two dimensional random walk simulates the behavior of a particle moving…

A: Import stdioImport randomImport sysn = int(sys.argv[1]) # should be the amount of steps taken to…

Q: Consider the following function fun: int fun(int n) { int s = 0; while(n > 1) { n= n/2; s+t; }…

A: Given :

Q: int i = 3; int j = 5; sum += ((--i)+(j++)) 5 7 O

A: GIVEN:

Q: Explain the functionality of below recursive functions. static void fun1(int n) { int i = 0; if…

A: Recursion : => Recursion happens when something is described in terms of itself or of its type.…

Q: What is the value of sum? int w = 5; int sum = 0; for (int r = 1; r <= w; r++) for (int s = r; s <=…

A: int w = 5;int sum = 0;for (int r = 1; r <= w; r++)for (int s = r; s <= w; s++)sum = sum + s;…

Q: Which is the base case of the following recursion function: def mult3(n): if n == 1:…

A: Answer : option a

Q: int functionC (int n) { int i, j, sumC = 0; for (i=n; i > 0; i=i-5) for (j=1; j 0) { if (functionC…

A: The solution of the above question is:

Q: #include int main() { int a[5]; for (int i = 0; i = a) { a[i]+= a[j]; 0; j = 1) { n = n / 2;…

A: Code :

Q: I Evaluate the time complexity of following code: int a-0; for (i-0; i< N; i++){ aati;) for (i- 0;…

A: COMPLEXITY OF GIVEN CODE - int a = 0 ; for ( i = 0 ; i < N ; i ++ ) { a = a + i ; } for ( i = 0…

Q: intinclude Rsing namespace std; int maxResult() int maxVal = for (int i { for (int j { float z = 0;…

A: The problem is based on the basics of syntax of C++ programming language.

Q: 8. A() { Int I, j, k, n; For (I = 1; 1<= n; I++) { For (j = 1; jsi²;j++) { For (k =1, k< =, k+) {…

A: Given : In questions 4-10 estimate the Big 0 value by analyzing the code. Note the algorithms are…

Q: (b) The Fibonacci numbers for n-0, 1,.. are defined as follows. fib (0)-0 fib (1)-1: fib (n)-fib (n-…

A: Fibonacci series: fib(n) = fib(n-1) + fib(n-2) → for n > 1fib(n) = 1→ for n = 0, 1 Fibonacci can…

Q: using namespace std; int main() int i, m=0,n=4; float arr[100] (55,66,88,1); for(i=0; i<n; ++i) {…

A: The above is a cpp program. This program is finding the smallest element in array by continuously…

Q: int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; imx) mx=arr[i]; returnmx; } Can u give…

A: Thе algorithm for the gеtMax() function is as follows:Initializе thе maximum valuе to thе first…

Q: int sum, k, i, j; int x[4][4]={1,2,3,4},{5,6,7,8},{9,8,7,3},{2,1,7,1}; sum=x[0][0]; for (k=1;…

A: Objective: A code segment is provided containing a matrix and a loop accessing some elements of the…

Q: For each of the following program fragments: Give an analysis of the running time (Big-Oh). Justify…

A: Let's consider the program A given above . As mentioned in the comments we can see that the program…

Q: QS. Find the time complexity of the following code int b = 0; for (j = 0; jj; i--){ b =b +j+i; }

A: Task : In the given question, an algorithm is given that involves the for loop with one nested for…

Question

Approximate the value of sum after the following code fragment, in terms of variable n in Big-Oh notation.

int sum = 0;

for (int i = 1; i <= n - 3; i++) {

for (int j = 1; j <= n + 4; j += 5) {

for (int k = 1; k <= n + 4; k += 5) {

sum += 2;

}

sum++;

}

for (int i = 1; i <= 100; i++) {

sum++;

}

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Problem Analysis :

VIEW

Solution :

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

sum = 0; for (int i = 1; i< n; i = sum++ || 2*i)
code in java pls Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.
11 - The code segment below has time complexity? for (int i=0; i
Python ques
b) Find the errors and correct them: 1) int sum-0;x; do{ cin<
Answer in Java Tim while preparing for his CAT exam, was studying the topic Number Systems. He encountered a loving da question: Given a number N, find the number of pairs (cy) where both x and y are less than N and Highent Common Factor(HCF) of x and y is 1. You have to solve the question for him. Note: 0 can be included within the pairs Input Specification: Input: The number N from which the pairs (x,y) should be obtained Output Specification: Return the total number of pairs Example 1: input1: 4 Output: 9 Explanation: The pairs can be (1,0) ,(0,1) (1,1) (1,2) (2,1) (0, 3) (3,1) (2,3) (0,2) So, a total of 9 pairs
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.
Solution needed in java
10
Q5. Find the time complexity of the following code int b = 0; for (j = 0; jj; i--) { b=b+j+i;
Answer in JavaScript Tim while preparing for his CAT exam, was studying the topic Number Systems. He encountered a loving da question: Given a number N, find the number of pairs (cy) where both x and y are less than N and Highent Common Factor(HCF) of x and y is 1. You have to solve the question for him. Note: 0 can be included within the pairs Input Specification: Input: The number N from which the pairs (x,y) should be obtained Output Specification: Return the total number of pairs Example 1: input1: 4 Output: 9 Explanation: The pairs can be (1,0) ,(0,1) (1,1) (1,2) (2,1) (0, 3) (3,1) (2,3) (0,2) So, a total of 9 pairs
Determine the growth function and order of the following codefragment:for (int count=0; count < n; count++){ for (int count2=0; count2 < n; count2=count2+2) { System.out.println(count + ", " + count2); }}