Practice Problem 5.5 (solution page 575)
Suppose we wish to write a function to evaluate I polynomial where a polynomial of degree n is defined to have a set of coefficients a0, a1 a2 ….an. For a value x. we evaluate the polynomial by computing
(5.2) a() + a1x + a2x2 + + anxn (5.2)
This evaluation can be implemented by the following function, having as arguments an array of coefficients a, a value x, and the polynomial degree degree (the value n in Equation 5.2). In this function, we compute both the successive terms of the equation and the successive powers of x within a single loop:
- A. For degree n, how many additions and how many multiplications does this code perform?
- B. On our reference machine, with arithmetic operations having the latencies shown in Figure 5.12, we measure the CPE for this function to be 5.00. Explain how this CPE arises based on the data dependencies formed between iterations due to the operations implementing lines 7-8 of the function.
Figure 5.12 Latency, issue time, and capacity characteristics of reference machine operations. Latency indicates the total number of clock cycles required to perform the actual operations, while issue time indicates the minimum number of cycles between two independent operations. The capacity indicates how many of these operations can be issued simultaneously. The times for division depend on the data values.
Want to see the full answer?
Check out a sample textbook solutionChapter 5 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Additional Engineering Textbook Solutions
Modern Database Management
Digital Fundamentals (11th Edition)
Concepts of Programming Languages (11th Edition)
Starting Out with C++: Early Objects
Database Concepts (7th Edition)
- 2. (a) In this problem consider Newton's method. Write a PYTHON function computing an approximation of the root p of the equation 0 using Newton's method. Specifically the code will compute the terms xn of the = f(x) sequence f(xn) f'(xn)' Xn+1 = Xn n = 0, 1, 2, ..., where xo is a given initial guess (or approximation) of the root p. For stopping criterion use the following: If |xn+1 − xn| ≤ TOL for the first time, then return xn+1 as approximation of the root p. Allow the code to do only NMAX iterations. At every step n, the code should print the values n, xn, f(xn) and n+1- xn. In case where the number of iterations reaches the maximum allowed number of iterations without satisfying the stopping criterion, then the code should print an error message, for example: "Failure: Algorithm fail to converge using only NMAX iterations".arrow_forward(b) Based on the function below, answer the following question. Assume that helper(n) runs in O(n) time. 1 void problem_2_2_b (int n) { 2 if (n(floor (sqrt (n))) 6 for (int i = 0; i < 281; ++i) { helper (m); 8 for (int j = m; jarrow_forwardA) Shanon Code B) Shanon-Fano Code for the following Set of massages: [P(X)] =x*.s*04 02 021 X 2 хз х 4 X5 0.05 0.15 0.4 0.2 0.2 Find the code efficiency ?arrow_forwardChapter 3: Practice Problems VIII. You are given the following C code to compute integer absolute value: int abs(int x) { } return x > (sizeof(int)*8-1); int comp = x mask; return comp; } A. What bit pattern does mask have, as a function of x? B. What numerical value does mask have, as a function of x? C. For what values of x do functions abs and opt abs return identical results? D. For the cases where they produce different results, how are the two results related? E. Show that with the addition of just one single arithmetic operation (any C operation is allowed) that you can fix opt abs. Show your modifications on the original code. (You can just provide the line that you will add). F. Are there any values of x such that abs returns a value that is not greater than 0? Which value(s)?arrow_forward(xiii) Determine all the permutations of the numbers less than or equal to some given number n. For example, if n = 123, then the permutations are: 123 321 231 132 213 312 (xiv) Find a series of five consecutive numbers, the sum of the squares of the first three of which is equal to the sum of the squares of the last two. For example, (– 2)2+ (– 1)2+ 02= 12+ 22 (xv) Limit the checking within 1000, to show all the triad numbers within 10,000. A number is said to be a triad number if the double and triple of the number contain all separate digits with no repetition of any one of them. (xvi) Identify and show the integer values of x, y, and z that satisfy the equation: Z²= X²+ y²arrow_forwardQuestion #1:: Write a MATLAB code that calculates the following equation: 4/x+y 2]y + cos-1(y2), z = 2 sin(x) Consider that the ( x ) and (y) are vector variables of length 100 elements with linear spacing.arrow_forward(e) Write a function montecarlo_accuracy (eps) which takes as an input some small float eps, and repeatedly performs the Monte Carlo procedure, until the approximation has an errorarrow_forward6. (а) Show that (p^q)vr= (pvr)^(qvr)? (b) Determine whether the following argument is valid? If it rains today, the university will close, The university is not closed today. Therefore, it did not rain today (c) Prove the following statement: For all integers n and m, if m is even and n is odd, then mn is evenarrow_forward4. Consider for what value of x are the following function defined? а) f(x) 3 Зх — 2 1 b) f(x) = 5-хarrow_forward4.25. Use the equations in the book or the computer program of this chapter. Find the radiation efficiency of resonant linear electric dipoles of length (a) I = 1./50 (b) I=1/4 (c)l=1/2 (d)1 =1 Assume that each dipole is made out of copper [o = 5.7 x 107 S/m], has a radius of 10-42, and is operating at f = 10 MHz. Use the computer program Dipole of this chapter to find the radiation resistances.arrow_forward12. (identities). Minimize the function F using algebraic modifications (w,x,y,z) Y(Z+WX (W+Z)) + (XY+(x+y) + Z) + z ((ZX +2X) A M+1) = 12²x²x²m)_]arrow_forward(x² If h(x) X 2 , then 2arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_iosRecommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSONC How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education