Given 5 input numbers, the algorithm below should calculatethe sum of all the even input numbers.a. Identify what is wrong with the following algorithm.b. How should we fix it?integer iinteger ainteger sumi = 0sum = 0while(i < 5)a = Get next inputif (a % 2 != 0)sum = sum + ai = i + 1Put sum to output

The problem is based on the algorithms in programming languages.

Answered: Given 5 input numbers, the algorithm…

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

You are given 3 algorithms A1, A2 and A3 solving the same problem. Youknow that in the the running times are T1(n) = n5n T2(n) = 210n2 + n3 T3(n) = 105log10(nn) For which problem sizes is A2 better than A1 ? Justify. For which problem sizes is A2 better than A3 ? Justify.
What is the output of the following algorithm if called as AlgorithmX(30,12) AlgorithmX(m,n) 1 while n ≠ 0 do 2 r ← m mod n 3 m← n 4 n ← r 5 return m
What is the growth rate of the following algorithm? y = 1; for (i=1; i<=n;i++) { for (j = 1; j<=n;j++) { x = A[i] + A[j]; x = x * y; } y = y + x; }
Suppose n is a positive integer (number of inputs in an arbitrary algorithm). Recall that we represent the worst case runtime of any algorithm using the big-oh (O()) notation. Select all options (comparison statements) given below that should return True for any n. Select 5 correct answer(s) Question 7 options: O(2^n) >= O(n^2) O(n!) >= O(n) O(log n) >= O(n) O(n log n) >= O(n^2) O(n log n) >= O(n) O(n) >= O(n log n) O(n) >= O(log n) O(1) >= O(n) O(n) >= O(1)
A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are?1(?) = 3 ? log ? and ?2(?) = ?6/5. a) Which algorithm is better? Why?b) If we run both algorithms at the same time with an input size of 105, which algorithm produces results faster than the other one? Why?
(i) Consider the following code: int myFunc(int A[], int n) { int i, j, max = 0; int msis[n]; for ( i = 0; i < n; i++ ) msis[i] = A[i]; for ( i = 1; i < n; i++ ) for ( j = 0; j < i; j++ ) if (A[i] > A[j] && msis[i] < msis[j] + A[i]) msis[i] = msis[j] + A[i]; for ( i = 0; i < n; i++ ) if ( max < msis[i] ) max = msis[i]; return max; } What is the time complexity of the algorithm? Consider the following array values and apply quick sort on it. Only dry run is required but you have to show all steps 10 3 8 5 12 2 15 4 1
Prove that the following algorithmfor computing Fibonacci numbers is correct. function fib(n) 1. comment Return Fn, the nth Fibonacci number 2. if n = 0 then return(0) else 3. last:=0; current:=1 4. for i := 2 to n do 5. temp:=last+current; last:=current; current:=temp 6. return(current)
Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do if n mod d = 0 then prime = T else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime 2 is n=17? Group of answer choices 7 4 None of these. 8 6
What is the growth rate of the following algorithm? Is the worst case different than the average case? Why? y = 1; for (i=1; i<=n; i++) { for (j=1; j<=n; j++) { x = A[i] + A[j]; x = x * y; } y = y + x; }
Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. Ex: If the input is 6, the output is: 011 (6 in binary is 110; the algorithm outputs the bits in reverse).
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
Recall the "better" algorithm to determine whether or not the input positive integer is a prime number that we discussed in the class. What is a running time of that algorithm with input ?n? Justify your answer.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS