Give a big-O estimate for the number of times a gets updated in the inner loop of the following pseudocode fragment: a := 0 for i:= 1 to n for j:= n downto 1 a:= a + i +j O(n) a. O(nlog(n)) b. o(n/n) O c. O(n²) O d.

Give a big-O estimate for the number of times a gets updated in the inner loop of the following pseudocode fragment: a := 0 for i:= 1 to n for j:= n downto 1 a:= a + i +j O(n) a. O(nlog(n)) b. o(n/n) O c. O(n²) O d.

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

Related questions

Q: Another advantage of compilation over interpretation is that a compilercan optimize code more…

A: Given data:- Another advantage of compilation over interpretation is that a compilercan optimize…

Q: Science

A: The code is given as,

Q: A-1D-9 Given the code segment below, what will be the sum of ALL elements of dCData after running…

A: Please upvote. I am providing you the correct answer below. Please please please.

Q: cci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum…

A: Start Now declare variables i, b, c, fib we will initialize the variables b=0, c=1 and fib=0 Enter…

Q: What is the step count of the pseudocode below: for i=-n to n do S = s +i if (i % 2 == 0) then p = p…

A: I am considering that each statement as step according to that I will count those steps. Please…

Q: Consider the following program: Fib[n] if(n==0) then return 0 else if(n==1) then return 1 else…

A: Given program: Fib[n] If(n==0) then return 0 else if(n==1) then return 1 else return…

Q: Number Sequence A3 main.c Test Case 1-input 3, expected output 19 27 35 Test Case 2-input 6,…

A: C code

Q: If V is a vector, fill in the missing code so the for loop copies V into R in reverse order: n=…

A: R(n-1) = V(k+1)

Q: The time complexity of the following pseudocode is O(n^2). In C++, confirm the time complexity by…

A: Here we have 2 while loops. First while loop will run n times. second while loop will run whenever…

Q: multiply_up (int n), which will multiple up from 1 to n, like 1*2*3*4*5....*n, and return the…

A: Answer : #include <iostream>#include <cmath>using namespace std;int add_up(int n){…

Q: Use a pseudo programming language to find the largest number (Maximum element) among a1,…

A: Pseudo Programming Language or Pseudo code can be defined as a method that helps the programmer in…

Q: def recRT (c1, c2, n, indent):

A: # python program to implement method recRT, which prints half of the indent hourgs pattern.# using…

Q: Q.No.2. Consider 3 , 5 , 8 , 10 , 5 , 2 , 1 ,7, 3, 13 as an input to the list of n integers. Dry run…

A: CODE: /******************************************************************************…

Q: eady complete, the next integer in the sequence will be returned. For example: Input: nums =…

A: The code provides two functions: find_missing_number and find_missing_number2, both of which achieve…

Q: Complete the following sorting program with bubble sort algorithm. #include using namespace std;…

A: Here is the c++ Code: See below steps:

Q: Analyze the time complexity of the code segment and find their Big-O. int myfunction4 (int n, int…

A: myfunction4 is the function and here we check condition and value of n decides when to exit from…

Q: Write a recursive program to implement the randomized quick sort by considering the input as an…

A: package test; import java.util.Arrays; public class QuickSort{ public static void main(String…

Q: Given: 2 A = 7 -5 1 ... B 4 -5 -4 -3 C = -2 c =[. E Find CD. 13 I. ... 13 II. 13 II. -1 131 IV. -7 B…

A: Correct answer is

Q: Code Tracing: What is the output of the code below if nums resb 3 have values (in order): 7,9,8 and…

A: According to the question , we have to write the output of the given assembly language program. In…

Q: How is it possible for a single computer to do several tasks?

A: Multiple programs can be performed on a computer using a background system, in which the computer…

Q: If n has the value 3, then the statement a [++n] = n++ ; A. assigns 3 to a [5] B. assigns 4 to…

A: post increment:- value is incremented later ,first assignment is done. Pre increment:- First value…

Q: 1. Prof. Nigma at the Portland Institute of Technology (which still doesn't exist) was thrilled with…

A: Here we have given complete solution for the given task. You can find the solution in step 2.

Q: def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0:…

A: def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0:…

Q: in range [0..n] in O(n) time and space. The difference between consecutive integers cannot be…

A: code step by step:The find_missing_number() function takes a list of numbers nums as input.Two…

Q: The MPI program 'Standard-Deviation.c' computes the standard deviation for an array of…

A: Source Code : //main classclass Person { //a)//member variablesString firstName;String…

Q: Consider the Given Loop: for (int i-0;i<n;i++){ 1...Constant work../ Taking two different values of…

A: To verify the complexity of the loop let us take two values of n as n=15, n=45. We are multiplying…

Q: Give Big O estimate of the number of operation used in this segment of code. t=0 for i := 1 to 3…

A: Given terms are t=0 , for i:=1 to 3 ,for j:=1 to n , and the given code is t:= t+i*j The code…

Q: 1. Consider the following two loops: / Loop A for (i - 1; i n; i+4) for (j - 1; j« 10000; j++) sum -…

A: 1. In the Loop A, outer for loop is executing n times and each time the inner for loop is executing…

Q: Find the average-case number of < comparisons performed by the following pseudocode segment. Assume…

A: - We have to get the number of comparisons for the list and loop.

Q: i=i+1 Start Declare name,scores each with 100 elements Initilize i=0,sum=0,n=100 i<=100 True 101…

A: Your algorithm of above flowchart is given below.

Q: 2. Give at least two loop invariants for the following code: While (j<n) if (amax <aj+1), then max…

A: Loop invariants are the lines of code which must be true before starting another iteration. These…

Q: 6- Using g(p) =p³ + p² + 1, find the output codeword for [D]=[0011] and [D]=[0010]

A: 1) Convert the polynomial into binary form. g(p) =p3+p2+1 [G] = [1101] 2) Add r 0's as LSB to data…

Q: What advantages does bytecode compilation over machine code have?

A: In this question we have to understand what advantages does bytecode compilation over machine code…

Q: In N-version programming which is the independent generation of N, the value of N is a) greater…

A: Question. In N-version programming which is the independent generation of N, the value of N is a)…

Q: nd sum as int; Read number n ; for i upto n increment i by 1 and i=1 {

A: Pseudocode: Declare a variable n, i and sum as int;Read number n ;for i upto n increment i by 1 and…

Q: function multiply(x, y) Input: Positive integers x and y, in binary Output: Their product n =…

A: Below is the complete solution with explanation in detail for the given question in Python…

Q: Assign sub_lyric by slicing rhyme_lyric from start_index to end_index which are given as inputs.…

A: Step 1 : STARTStep 2 : declare all variablesStep 3 : Give input stringStep 4 : Give start indexStep…

Q: Rewrite the following function, replacing the for loop with a while oop: def myhash(string,…

A: def myhash(string, maxlen=4): if len(string) > maxlen: return False result = 0…

Q: 5. State g(n)'s runtime complexity: int f(int n){ if(n <= 1){ return 1; } return 1 + f(n/2); } int…

A: In the given for function g() we have one for loop with other function f(i) for(int…

Q: What is the running time of the piece of code below i =n |3| While(i > 1): i = i – yn A) O(n) B)…

A: The problem is based on the basics of time complexity calculation in computer systems.

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

Give a big-O estimate for the number of times a gets updated in the inner loop of the following pseudocode fragment:
a := 0
for i:= 1 ton
for j:= n downto 1
a := a + i +j
O(n)
a.
O(nlog(n)
Ob.
o(nVn)
c.
O(n?)
d.

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

Explanation

VIEW

Answer

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

Write programs using QtSpim to do the following 1) int x=1; x=x+2; 2) x=5; if (x>0) x=x+1; else x=x-1; 3) int sum=0; int[] a={1,2,3,4,5}; for (int i=0;i<5;i++) sum=sum+a[i];
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
What will the final values of count1 and count2 be in terms of n? assume that n is a power of 2 of the form 2^r.
func3 will give thumbs up if correct
Assume n is the number of inputs and that the log function is base 2. Treat this piece of code as a pseudocode. Give the big-Oh characterization, in terms of n for the following algorithm: for i in range(n*logn): for j in range(i): for k range(1000): print('I did it!')
The following code segment is taken (modified) from the open source Barcode system. int Barcode_128b_verify(unsigned char *text) { // if character string length = 0, error if (text[0] == ‘\0’) return -1; // check the last element in the character string is \0 while (*text && *text>=32 && !(*text&0x80)) { text++; } if (*text != 0) { return_code = -1; } else { return_code = 0; } return return_code; } i) Draw a flowgraph for the code segment. ii) Calculate the Cyclomatic complexity metric for this code segment, showing how you calculated the value.
a) You are given two different codes for finding the n-th Fibonacci number. Find the time complexity of both implementations and compare the two. Implementation 1 def fibonacci_1 (n) : if n < 0: print ("Invalid input!") elif n <= 1: return n else: return fibonacci_1 (n-1) +fibonacci_1 (n-2) n = int (input ("Enter a number: ")) nth_fib= fibonacci_1 (n) print("The {}th fibonacci number is {}.". format (n, nth_fib)) Implementation 2 def fibonacci_2 (n) : if n<0: return "Invalid Input" if n<=1: return n fib [0] (n+1) fib[0] = 0 fib[1] = 1 for i in range (2, n+1): fib[i] = fib[i-1]+ fib[i-2] return fib[n] n = int(input ("Enter a number: ")) nth_fib = fibonacci_2 (n) print("The {} th fibonacci number is {}.". format (n, nth_fib))
Evaluate the performance per line
def hailstone(n): h.append(int(n)) if n == 1: return h while n != 1: if n % 2 == 0: return hailstone(int(n/2)) else: return hailstone(int(3*n + 1))y=int(input("N: "))if y <= 0: print("N must be positive!")else: print("Hailstone sequences for 1 to " + str(y) + ":") m=0; i=1 for x in range(1, y+1): n = i h = [] h = hailstone(n) print(h) s=len(h) if s > m: m=s flag=n i=i+1 print("First longest sequence found in n =", + flag ) If i don't one the output have the square braket? How can I fix this code? Can you pleasw help me?
calculate number of operations in this algorithm void my_dgemv(int n, double* A, double* x, double* y) { double alpha=1.0, beta=1.0; int lda=n, incx=1, incy=1; cblas_dgemv(CblasRowMajor, CblasNoTrans, n, n, alpha, A, lda, x, incx, beta, y, incy); }
Q- tracing the following code and correct the error if you found the find the output x = [4 -2 3 -7 5 -1] ; %3D for k = 1:6 y(k) = 0; for n = 1:6 y(k) = y(k)+x(n)*exp(-11*2*pi* (k-1)*(n-1)/N); end end subplot(3, 1, 1); stem(y); title('FFT'); for n = 1:5 x1(n) = 0; for k = 1: 5 x1(n) =x1(n)+(1/N)*y(k)*exp(1i*2 pi (k-1) (n-1)/N); end end subplot(3,1,2); stem(x1); title('IFFT');
write a C program