QUESTION 21 The algorithm shown below can be used to compute the sum 1 Ex =1+. x2. + + 4! ... i=0 This sum is called Taylor's partial sum. 1: input n, x 2: y+ 1- 3: fac + 1 4: sum e 1 5: for i = 1 to n do 5.1: y y xx 5.2: fac + fac xi 5.3: sum + sum + y + fac 6: output sum You must answer the following questions in detail Find the time-complexity function of the algorithm a. b. Find the big-O of the algorithm

QUESTION 21 The algorithm shown below can be used to compute the sum 1 Ex =1+. x2. + + 4! ... i=0 This sum is called Taylor's partial sum. 1: input n, x 2: y+ 1- 3: fac + 1 4: sum e 1 5: for i = 1 to n do 5.1: y y xx 5.2: fac + fac xi 5.3: sum + sum + y + fac 6: output sum You must answer the following questions in detail Find the time-complexity function of the algorithm a. b. Find the big-O of 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

For each of the following statements indicate whether it is true or false and correct the false statements: o. 10+n+n² = N (n) p. 10+n+n² = 0 (n) q. 10+n+logn= (n) %3D
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 ***"
Practice using recursive definitions 14. For an n digit positive integer with digits did2d3...dn-1dn, give an informal recursive algorithm to find the sum of the digits. As an example, 247 would have d₁ = 2, d2 = 4, d3 = 7 Rubric: Correct recursion Correct calculation to get digit Correct sum calculation
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!')
Question 4# Read the following algorithm: Algorithm for converting a fraction r into binary with p binary places. Inputs: fraction EQ, 0 < x <1 and number of places pЄN. Outputs: bits b1, b2b, such that (0.bb.bp)2 is the best approximation to r using p binary places. Method: Initialise: j1, b1, b2,, bp 0 Loop: if jp+ 1 stop. jj+1 If ≥1 [b, 1, -1] Repeat loop (a) Verify that the algorithm converts to 0.11010, when p= 5. Can you spot how to express exactly in repeating binary? (b) Express 0.8510 as accurately as possible with 8 binary places.
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); }
QUESTION 15 The following algorithm finds the same character in two strings: string, =x,xX, and string2=yıy2-Yn How many times would Step 4.1.1. be performed for the following inputs: string = 6632176980 string, = 8703125409 1. input n 2. input the n-character long string x1x2x3 Xn 3. input the n-character long string yıY2y3 **Yn 4. for i = 1 ton do 4.1. for j = 1 to n do 4.1.1. if x, = y, then 4.1.1.1. return "A common character has been found; it is x," 5. return "There is no common character in the given two strings"
rt 2 (Efficiency a) In the following pseudocode, what is the number of operations the algorithmperformsi". .........) (............ I def sum0fN (n): 2 the Sum = 0 3 4 5 for i in range (1, n+1): the Sum= the Sum + i) return the Sum 126