Algorithm problem solving,how to step-by-step solve these? 3|x2|<|3x2 + 17x + 5| for all x>1express this statement using Q-notation(a) Consider the following algorithm segment:for i := 1 to nfor j := 1 to ix := 5 · i +8. j13x2 + 17x + 5|<25 |x리 for all x > 1express this statement using O-notationnext jnext i(b) How many additions and multiplications are performed when the inner loop of this algo-rithm segment is executed? How many additions and multiplications are performed whenthe entire algorithm segment is executed?3]x리 < |3x리 < |3x2+ 17x + 5|< 25 |x레 for all x > 1(c) Find an order for this algorithm segment from among the following: log, n, n, n · log, n,n2, n3, and n', Give a reason for your answer.Express this statement using 0-notationExpress the following statement using N-notation.:| 12z*(3r + 4)for all real numbers r> 2.I+2Consider the statement:3 [교리 < |3r2 + 17x +5| < 25 |교기|for all r> 1.Express this statement using 0-notation.Express the following statement using O-notation:| 12r(3r + 4)|S 36 |z |for all real numbers r> 2.z+2(a) Find the total number of additions and multiplications that must be performed when thefollowing algorithm is executed. Show your work carefully.for i := 1 to nfor j = i tona := 2 · (5 - i+j+1)next jnext i(b) Find an order for the algorithm segment of part (a) from among the following: log, n, n,n · log, n, n?, n³, and n*. Give a reason for your answer.

According to our policy if the questions contains many subparts we are allowed to attempt 3 of them.…

(a) Find the total number of additions and multiplications that must be performed when the following algorithm is executed. Show your work carefully. for i :=1 to n for j = i to n a:= 2 - (5 -i+j+1) next j next i (b) Find an order for the algorithm segment of part (a) from among the following: log2 n, n, n - logą n, n², nº, and n*. Give a reason for your answer.

(a) Find the total number of additions and multiplications that must be performed when the following algorithm is executed. Show your work carefully. for i :=1 to n for j = i to n a:= 2 - (5 -i+j+1) next j next i (b) Find an order for the algorithm segment of part (a) from among the following: log2 n, n, n - logą n, n², nº, and n*. Give a reason for your answer.

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

Q2: Explain each step in the following algorithm, and then compare it with DDA Start X=X1 AL IRAQIA UNIVERSITY Y=Y1 DX=X2-X1 DY=Y2-Y1 E= (DY / DX) - 0.5 For I=1 to DX الغراقي Begin Plot (X,Y) While (E 20) Y=Y+1 E=E-1 End While X=X+1 E=E + ( DY / Dx) End Finish 1
CPE 300 - Optimization Techniques Topic: GA Implementation Scenario: Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight genes. Each gene can be any digit between 0 and 9. Let the fitness of individual x be calculated as: f(x) = (a + b) − (c + d) + (e + f) − (g + h) and let the initial population consist of four individuals with the followingchromosomes: x1 = 6 5 4 1 3 5 3 2x2 = 8 7 1 2 6 6 0 1x3 = 2 3 9 2 1 2 8 5x4 = 4 1 8 5 2 0 9 4 Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest first and the least fit last. Perform the following crossover operations: One–point crossover, Two–point crossover, and uniform crossover.
Q1. GCD-Euclidean Algorithm Execute the Euclidean Algorithm to compute the greatest common divisor of the numbers: 1050 317 Show the steps of the algorithm. For numbers X and Y (X> Y), each step should be in the form Answer: x=qxY+r (0≤r
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); }
Task 1: Consider the following pseudocode function that describes the R0 Search algorithm: function R0(key,A1,A2,N)for 0 <= i < ceiling(N/2) if(A1[i] == key): return 2*i for 0 <= i < floor(N/2) if(A2[i] == key): return 2*i + 1 return -1 In this pseudocode floor(x) and ceiling(x) are the mathematical functions that, respectively, give the largest integer smaller than or equal to x and give the smallest integer larger than or equal to x. You may assume that calculating the floor(x) and ceiling(x) takes constant time. For this algorithm address the following: Identify, and describe very briefly in words, the best-case inputs and the worst-case inputs. Recall that there are four inputs to R0.
5. Consider the algorithm that takes an input n and runs the following pseudocode: for i := 1 to 5 for j := 1 to n k := 7.i+1 next j k := k + 3 – 2 - i next i
Consider the following algorithm segment. if x · y > 0 then do y := 4 · x X:=x + 1 end do z := x• y Find the value of z if prior to execution x and y have the values given below. (a) x = 3, y = 4 z = (b) x = 1, y = 1 z =
2. Consider the following algorithm ALGORITHM Do_Something(int n) //Input: An integer n> 0 if n > 1 do Do_Somehting (n - 1) print n² if n > 1 do Do_Somehting (n 1) Analysis the time complexity of this algorithm by applying the analysis framework
Exercise 1.1 4. Design an algorithm for computing Vn for any positive integer n. Besides assignment and comparison, your algorithm may only use the four basic arithmetical operations.
1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?
1) Given the following list: 90 8 7 56 123 235 9 1 653 Can you guess the name of the sorting algorithm? 8 90 7 56 123 235 9 1 653 7 8 90 56 123 235 9 1 6537 8 56 90 123 235 9 1 6537 8 9 56 90 123 235 1 6531 7 8 9 56 90 123 235 653 Question 1 - Given the following list: 90 8 7 56 123 235 9 1 653 Can you guess the name of the sorting algorithm? 8 90 7 56 123 235 9 1 653 7 8 90 56 123 235 9 1 6537 8 56 90 123 235 9 1 6537 8 9 56 90 123 235 1 6531 7 8 9 56 90 123 235 653 Merge Sort Insertion Sort Selection Sort Quick Sort 2) What is the recursive part in recursive factorial function? Question 2 - What is the recursive part in recursive factorial function? if (n=0) return 1; if (n==0) return 0; if…
15. A sequential algorithm is broken into three stages Sequential Algorithm Time Download stage: 1 minute Sorting stage: 6 minutes Upload stage 1 minute A parallel version of the algorithm completes the sorting stage in parallel leading to a new set of times Parallel Algorithm Time Download stage: 1 minute Sorting stage: 2 minutes Upload stage: 1 minute What is the speedup of the parallel solution? A. 6 minutes B. 4 minutes C. 2 D. 3 0000