Discrete Mathematics With Applications
5th Edition
ISBN: 9781337694193
Author: EPP, Susanna S.
Publisher: Cengage Learning,
expand_more
expand_more
format_list_bulleted
Videos
Question
Chapter 11.3, Problem 14ES
To determine
(a)
To compute the actual number of elementary operations (addition, subtractions, multiplication, division and comparisons) that are performed when the algorithm segment is executed.
To determine
(b)
To find an order for the algorithm segment by using the theorem on polynomial orders.
for
for
Next
Next
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Q9A. Consider the following algorithm:
sum = 0
for j in range(1,12):
sum = sum + (9*j - 2)
print(sum)
What is printed as a result of executing this algorithm?
Use Euclidean algorithm to obtain x and y satisfying the equation of(5 036, 2 601) = 5 036x + 2 601y.
The author explains Why We Place Extra Zeros on Some Lines …. In the Standard Algorithm for 45 × 23, 45 times 2 is 90. Briefly explain why we place a 0 to make the 90 becomes 900.
Chapter 11 Solutions
Discrete Mathematics With Applications
Ch. 11.1 - If f is a real-valued function of a real variable,...Ch. 11.1 - Prob. 2TYCh. 11.1 - Prob. 3TYCh. 11.1 - Prob. 4TYCh. 11.1 - Prob. 5TYCh. 11.1 - Prob. 6TYCh. 11.1 - Prob. 1ESCh. 11.1 - The graph of a function g is shown below. a. Is...Ch. 11.1 - Prob. 3ESCh. 11.1 - Sketch the graphs of the power functions p3 and p4...
Ch. 11.1 - Prob. 5ESCh. 11.1 - Prob. 6ESCh. 11.1 - Prob. 7ESCh. 11.1 - Sketch a graph for each of the functions defined...Ch. 11.1 - Prob. 9ESCh. 11.1 - Prob. 10ESCh. 11.1 - Prob. 11ESCh. 11.1 - Prob. 12ESCh. 11.1 - Prob. 13ESCh. 11.1 - The graph of a function f is shown below. Find the...Ch. 11.1 - Prob. 15ESCh. 11.1 - Prob. 16ESCh. 11.1 - Prob. 17ESCh. 11.1 - Prob. 18ESCh. 11.1 - Prob. 19ESCh. 11.1 - Prob. 20ESCh. 11.1 - Prob. 21ESCh. 11.1 - Prob. 22ESCh. 11.1 - Prob. 23ESCh. 11.1 - Prob. 24ESCh. 11.1 - Prob. 25ESCh. 11.1 - Prob. 26ESCh. 11.1 - Prob. 27ESCh. 11.1 - Prob. 28ESCh. 11.2 - A sentence of the form Ag(n)f(n) for every na...Ch. 11.2 - Prob. 2TYCh. 11.2 - Prob. 3TYCh. 11.2 - When n1,n n2 and n2 n5__________.Ch. 11.2 - Prob. 5TYCh. 11.2 - Prob. 6TYCh. 11.2 - Prob. 1ESCh. 11.2 - Prob. 2ESCh. 11.2 - The following is a formal definition for ...Ch. 11.2 - In 4—9, express each statement using -, O-, or ...Ch. 11.2 - In 4—9, express each statement using -, O-, or ...Ch. 11.2 - Prob. 6ESCh. 11.2 - Prob. 7ESCh. 11.2 - Prob. 8ESCh. 11.2 - Prob. 9ESCh. 11.2 - Prob. 10ESCh. 11.2 - Prob. 11ESCh. 11.2 - Prob. 12ESCh. 11.2 - Prob. 13ESCh. 11.2 - Use the definition of -notation to show that...Ch. 11.2 - Prob. 15ESCh. 11.2 - Prob. 16ESCh. 11.2 - Prob. 17ESCh. 11.2 - Prob. 18ESCh. 11.2 - Prob. 19ESCh. 11.2 - Prob. 20ESCh. 11.2 - Prove Theorem 11.2.4: If f is a real-valued...Ch. 11.2 - Prob. 22ESCh. 11.2 - Prob. 23ESCh. 11.2 - a. Use one of the methods of Example 11.2.4 to...Ch. 11.2 - Suppose P(n)=amnm+am1nm1++a2n2+a1n+a0 , where all...Ch. 11.2 - Prob. 26ESCh. 11.2 - Prob. 27ESCh. 11.2 - Prob. 28ESCh. 11.2 - Use the theorem on polynomial orders to prove each...Ch. 11.2 - Prob. 30ESCh. 11.2 - Prob. 31ESCh. 11.2 - Prob. 32ESCh. 11.2 - Prove each of the statements in 32—39. Use the...Ch. 11.2 - Prob. 34ESCh. 11.2 - Prob. 35ESCh. 11.2 - Prob. 36ESCh. 11.2 - Prob. 37ESCh. 11.2 - Prob. 38ESCh. 11.2 - Prob. 39ESCh. 11.2 - Prob. 40ESCh. 11.2 - Prob. 41ESCh. 11.2 - Prob. 42ESCh. 11.2 - Prob. 43ESCh. 11.2 - Prob. 44ESCh. 11.2 - Prob. 45ESCh. 11.2 - Prob. 46ESCh. 11.2 - Prob. 47ESCh. 11.2 - Prob. 48ESCh. 11.2 - Prob. 49ESCh. 11.2 - Prob. 50ESCh. 11.2 - Prob. 51ESCh. 11.3 - When an algorithm segment contains a nested...Ch. 11.3 - Prob. 2TYCh. 11.3 - Prob. 3TYCh. 11.3 - Suppose a computer takes 1 nanosecond ( =109...Ch. 11.3 - Prob. 2ESCh. 11.3 - Prob. 3ESCh. 11.3 - Exercises 4—5 explore the fact that for relatively...Ch. 11.3 - Prob. 5ESCh. 11.3 - Prob. 6ESCh. 11.3 - Prob. 7ESCh. 11.3 - Prob. 8ESCh. 11.3 - Prob. 9ESCh. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - Prob. 13ESCh. 11.3 - Prob. 14ESCh. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - Prob. 16ESCh. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - Prob. 18ESCh. 11.3 - Prob. 19ESCh. 11.3 - Prob. 20ESCh. 11.3 - Prob. 21ESCh. 11.3 - Construct a trace table showing the action of...Ch. 11.3 - Construct a trace table showing the action of...Ch. 11.3 - Prob. 24ESCh. 11.3 - Prob. 25ESCh. 11.3 - Prob. 26ESCh. 11.3 - Consider the recurrence relation that arose in...Ch. 11.3 - Prob. 28ESCh. 11.3 - Prob. 29ESCh. 11.3 - Exercises 28—35 refer to selection sort, which is...Ch. 11.3 - Prob. 31ESCh. 11.3 - Prob. 32ESCh. 11.3 - Prob. 33ESCh. 11.3 - Prob. 34ESCh. 11.3 - Prob. 35ESCh. 11.3 - Prob. 36ESCh. 11.3 - Prob. 37ESCh. 11.3 - Prob. 38ESCh. 11.3 - Prob. 39ESCh. 11.3 - Prob. 40ESCh. 11.3 - Prob. 41ESCh. 11.3 - Exercises 40—43 refer to another algorithm, known...Ch. 11.3 - Prob. 43ESCh. 11.4 - The domain of any exponential function is , and...Ch. 11.4 - Prob. 2TYCh. 11.4 - Prob. 3TYCh. 11.4 - Prob. 4TYCh. 11.4 - Prob. 5TYCh. 11.4 - Graph each function defined in 1-8. 1. f(x)=3x for...Ch. 11.4 - Prob. 2ESCh. 11.4 - Prob. 3ESCh. 11.4 - Prob. 4ESCh. 11.4 - Prob. 5ESCh. 11.4 - Prob. 6ESCh. 11.4 - Prob. 7ESCh. 11.4 - Prob. 8ESCh. 11.4 - Prob. 9ESCh. 11.4 - Prob. 10ESCh. 11.4 - Prob. 11ESCh. 11.4 - Prob. 12ESCh. 11.4 - Prob. 13ESCh. 11.4 - Prob. 14ESCh. 11.4 - Prob. 15ESCh. 11.4 - Prob. 16ESCh. 11.4 - Prob. 17ESCh. 11.4 - Prob. 18ESCh. 11.4 - Prob. 19ESCh. 11.4 - Prob. 20ESCh. 11.4 - Prob. 21ESCh. 11.4 - Prob. 22ESCh. 11.4 - Prob. 23ESCh. 11.4 - Prob. 24ESCh. 11.4 - Prob. 25ESCh. 11.4 - Prob. 26ESCh. 11.4 - Prob. 27ESCh. 11.4 - Prob. 28ESCh. 11.4 - Prob. 29ESCh. 11.4 - Prob. 30ESCh. 11.4 - Prob. 31ESCh. 11.4 - Prob. 32ESCh. 11.4 - Prove each of the statements in 32—37, assuming n...Ch. 11.4 - Prob. 34ESCh. 11.4 - Prob. 35ESCh. 11.4 - Prob. 36ESCh. 11.4 - Prob. 37ESCh. 11.4 - Prob. 38ESCh. 11.4 - Prob. 39ESCh. 11.4 - Prob. 40ESCh. 11.4 - Show that log2n is (log2n) .Ch. 11.4 - Prob. 42ESCh. 11.4 - Prob. 43ESCh. 11.4 - Prob. 44ESCh. 11.4 - Prob. 45ESCh. 11.4 - Prob. 46ESCh. 11.4 - Prob. 47ESCh. 11.4 - Prob. 48ESCh. 11.4 - Prob. 49ESCh. 11.4 - Prob. 50ESCh. 11.4 - Prob. 51ESCh. 11.5 - Prob. 1TYCh. 11.5 - To search an array using the binary search...Ch. 11.5 - Prob. 3TYCh. 11.5 - Prob. 4TYCh. 11.5 - The worst-case order of the merge sort algorithm...Ch. 11.5 - Prob. 1ESCh. 11.5 - Prob. 2ESCh. 11.5 - Prob. 3ESCh. 11.5 - Prob. 4ESCh. 11.5 - In 5 and 6, trace the action of the binary search...Ch. 11.5 - Prob. 6ESCh. 11.5 - Prob. 7ESCh. 11.5 - Prob. 8ESCh. 11.5 - Prob. 9ESCh. 11.5 - Prob. 10ESCh. 11.5 - Prob. 11ESCh. 11.5 - Prob. 12ESCh. 11.5 - Prob. 13ESCh. 11.5 - Prob. 14ESCh. 11.5 - Prob. 15ESCh. 11.5 - Prob. 16ESCh. 11.5 - Trace the modified binary search algorithm for the...Ch. 11.5 - Prob. 18ESCh. 11.5 - Prob. 19ESCh. 11.5 - Prob. 20ESCh. 11.5 - Prob. 21ESCh. 11.5 - Prob. 22ESCh. 11.5 - Prob. 23ESCh. 11.5 - Show that given an array a[bot],a[bot+1],,a[top]of...Ch. 11.5 - Prob. 25ESCh. 11.5 - Prob. 26ES
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- (2) Let a = 218 and b =-115. Use the Euclidean Algorithm to find the gcd(a,b) and integers m and n such that gcd(a,b)=ma+nb .arrow_forwardDetermine which characteristics of an algorithm the following procedures have and which they lack. procedure divide(n: positive integer) while n begin m := 1 /n n:=n - 1 endarrow_forwardGiven f(x)= -x +2x$ -3x + x? -4x + 5. Use Horner's algorithm to compute a. f(-2) b. f(x)/(x+2) C. How many multiplications was involved at part (a)arrow_forward
- Use R X <- c(1.0, 6.4, NA, 16.5, 90.9, 0.1, 0.6, NA, 11.5, NA)X using EM Algorithm, impute the missing values, use while loop and find the number of iterations and the difference between old value and new valuearrow_forward➜ ☺ T 1. One algorithm for polynomial evaluation is the straight term-by-term evaluation which follows the order of operations. That is, all powers are done first, then all multiplications, then all additions and subtractions. For a polynomial of degree 5, how many operations are needed in the term-by-term algorithm? How many operations would be needed in a degree n polynomial? What is the order of this algorithm? Filters Add a caption... × (1 > My grouparrow_forward6. Let p(x) = 3x* + 7x² + 4x +1. (a) Write the polynomial p(x) in the telescoping form, showing each step of the factorisation. (b) Evaluate the polynomial p(r) when x = 8 by completing the following memory table for Horner's algorithm (add more rows if needed). Hint: first identify N, x and the coefficients A(0), A(1), ..., A(N). Instruction KN-K A(N-K) S 1. S+ A(N) 2. For K = 1 to N a. S+ x*S+ A(N-K)|1 (c) With no calculation, convert 307418 to base 10, and explain why your answer is correct.arrow_forward
- (1) Use Horner's algorithm to evaluate the following polynomial at the point indicated 2x¹ +9² +16x + 12, at -3.arrow_forwardSuppose you draw n lines in the plane so that every pair of lines cross (no lines are parallel) and no three lines cross at the same point. This will create some number of regions in the plane, including some unbounded regions. Call the number of regions Rn. Find a recursive formula for the number of regions created by n lines, and justify why your recursion is correct.arrow_forwardFind the GCD of 284 and 40 using the Euclidean Algorithm.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Algebraic Complexity with Less Relations; Author: The University of Chicago;https://www.youtube.com/watch?v=ZOKM1JPz650;License: Standard Youtube License
Strassen's Matrix Multiplication - Divide and Conquer - Analysis of Algorithm; Author: Ekeeda;https://www.youtube.com/watch?v=UnpySHwAJsQ;License: Standard YouTube License, CC-BY
Trigonometric Equations with Complex Numbers | Complex Analysis #6; Author: TheMathCoach;https://www.youtube.com/watch?v=zdD8Dab1T2Y;License: Standard YouTube License, CC-BY