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

Q1: Fill the empty spaces regarding RSA key generation: Algorithm: RSA Key Generation Output: public key: kpub=(n, e) and private key kpr = d 1. Choose two large primes p, q 2. Compute n = 3. Compute (n) ********* ****** 4. Select the public exponent e exponent e E (1, 2,.... (n)-1} such that gcd(e, (n)) = . 5. Compute the private key d such that d*e = 1 mod 6. RETURN Kpub=(n, e), kpr = d 1
Code this using python with visualizations and results #2
Pseudocode this for me please #input the number of blocks in s s=int(input()) #initialize summ=0 and i =1 summ=0 i=1 #repeat a loop while summ<s while summ<s: #add i to the summ and increment i summ=summ+i i=i+1 #if summ=s then a complete pyramid is made so subtract 1 from i if summ==s: i=i-1 #else subtract 2 from i else: i=i-2 #print the i print("The height of the pyramid: ",i) Subject: Python Programming
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!')
9. Give a big-O estimate for the number of operations, where an operation is an addition or a multiplication, used in this segment of an algorithm.
Construct an algorithm for above Flow Chart Hint: You can find a loop here b) Draw a trace table for the algorithm you have written (You can take any imaginary value for variable "number")
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.
The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17 # we want the square root of 17 for exampleg = 4 # our guess is 4 initiallyerror = 0.0000000001 # we want to stop when we are this closewhile abs(n - (g**2)) > error: g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!
What is printed by the algorithm above? set A to 3 set B to 5 set SUM to 1 while A <= 50 do A = A + B B = B + A SUM = SUM + B %3D end while print SUM stop 137 O 147 O 127 O 157
algorithm foo(a1, a2, ..., an) for i + 1 to n - 1 kei for jei+ 1 to n if a; < ak then k ej interchange ak and aj (Note: indentation is important) Bubble sort O Quicksort None of the choices Insert Sort Selection Sort
Q/ The main objective of implementing the following algorithm is to find ...... And ......... 00 Start I=1 S=0 N=0 Read x x>0? Yes S= S+x N= N + 1 1=20 Yes Print S, N ↓ Stop No No I= 1 + 1
The following code is used to derive Fibonacci algorithm with this sequence: (0, 1, 1, 2, 3, 5, 8, 13, 21, …) where each number is “add” of two previous ones. int fib(int n){ if (n==0) return 0; else if (n == 1) return 1; else return fib(n−1) + fib(n−2); } Explain why the following RISC-V assembly code works, you need to explain all the details using the comments as hints? # IMPORTANT! Stack pointer must remain a multiple of 16!!!! addi x10,x10,8 # fib(8), you can change it fib: beq x10, x0, done # If n==0, return 0 addi x5, x0, 1 beq x10, x5, done # If n==1, return 1 addi x2, x2, -16 # Allocate 2 words of stack space sd x1, 0(x2) # Save the return address sd x10, 8(x2) # Save the current n addi x10, x10, -1 # x10 = n-1 jal x1, fib # fib(n-1) ld x5, 8(x2) # Load old n from the stack sd x10, 8(x2) # Push fib(n-1) onto the stack addi x10, x5, -2 # x10 = n-2 jal x1, fib # Call fib(n-2)…