Question 1. What is the time complexity for the following code/program? 1.1 for (int i = 1; i <= n; i++){ for (int j = 1; j <= n; j++){ 1.2 int a = 0; for (int k = n; k >= 1; k--){ sum = i + j+k; cout << sum << endl;}}} for (i = 0; i < N; i++) { for (j=N; j>i; j--) { a = a +i+j;}} 1.3 for (int i = 1; i <= n; i++){ for (int j = 1; j <= 100; j++){ sum = i + j + k;}}

Question 1. What is the time complexity for the following code/program? 1.1 for (int i = 1; i <= n; i++){ for (int j = 1; j <= n; j++){ 1.2 int a = 0; for (int k = n; k >= 1; k--){ sum = i + j+k; cout << sum << endl;}}} for (i = 0; i < N; i++) { for (j=N; j>i; j--) { a = a +i+j;}} 1.3 for (int i = 1; i <= n; i++){ for (int j = 1; j <= 100; j++){ sum = i + j + k;}}

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

int functionC (int n) { int i, j, sumC = 0; for (i=n; i > 0; i=i-5) for (j=1; j 0) { if (functionC(n) % 2 == 0) { for (i=m; i > 0; i=i/3) sumE++; } else (10) Asymptotic runtime of functionE { for (i=m; i > 0; i=i-3) sumE--; } n--; } return sumE;
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.
sum= 0; for (int i = 0; i 1) { sum++; i= 1/2; } = 2*log2 (n) We denote by Ta(n), Tb (n), Te(n) the running time of the three fragments. 1. Give evaluations for Ta(n), Tb (n), Te(n). 2. Is T(n) = O(Ta(n)) ? Answer YES or NO and justify your answer. 3. Is Te(n) = (Ta(n)) ? Answer YES or NO and justify your answer.
Q5. Find the time complexity of the following code int b = 0; for (j = 0; jj; i--) { b=b+j+i;
Question 8 Consider the following code where n and m can be any number of more than 20. Select the correct time complexity. int iter_count = 0; for (int i = 0; i < n; i *= 2) { for (int j = 0; j < m; j++){ iter_count += 1; } for (int i = }) 0; i
What is the time complexity for the following code/program?int a = 0; for (i = 0; i < N; i++) { for (j = N; j > i; j--) { a = a + i + j;}}
For each of the following program fragments: Give an analysis of the running time (Big-Oh). Justify your answer? A. public class GFG { // Linearly search x in att[]. if x is present then //return the index, otherwise return -1 static int search (int arr[], int n, intx) { int i; for (i = 0: i
1. Analyze the time complexity of the code segment and find their Big-O.void myfunction1(int n){for(int i=0; i < n; i++) {for(int j=0; j < n; j++) {for(int k=0; k < n; k++) {for(int m=0; m < n; m++) {printf("Hello!");} } } }}
What is the time complexity for the following code/program? for (int i = 1; i <= n; i++){ for (int j = 1; j <= n; j++){ for (int k = n; k >= 1; k--){ sum = i + j + k; cout << sum << endl;}}}
What is the time complexity for the following code/program? for (int i = 1; i <= n; i++){ for (int j = 1; j <= 100; j++){ sum = i + j + k;}}
Q5. What is the time complexity of following code? int a for (i = 0; ii; j--) { a = a + i + j; } 0; } Q6. What is the time complexity of following code? int i, j, k = 0; for (i = n/2; i <= n; i++) { for (j = 2; j <= n; j = j * 2) { k=k+n/2; } }
Explain the functionality of below recursive functions. static void fun1(int n) { int i = 0; if (n > 1) fun1(n - 1); for (i = 0; i<n; i++) System.out.print(" *"); } 2. int LIMIT = 1000; void fun2(int n) { if (n<=0)return; if (n>LIMIT)return; System.out.print( String.format("%d", n)); fun2(2*n); System.out.print( String.format("%d", n)) }