Complete the function calculate, which computes and returns the value of the following sum for the given arguments, x and n.nΣ ( ² × ²¹) - ( ² × ²¹) + ( ² × ²²) + ( ³×²³) + - + (² × ²ª¹)2n=X2³i=1Assume n ≥ 1.Examples:Function Callcalculate (5,4)calculate (2,7)calculate (7,2)0.6122448979591837calculate (3,9) 22.196311537875324Return Value232.0256000000000003140.0[ ] 1 def calculate (x, n):return 0 # DELETE THIS LINE and start coding here.# Remember: end all of your functions with a return statement, not a print statement!45 # Test cases6 print (calculate (5, 4))7 print (calculate (2, 7))8 print (calculate (7, 2))9 print (calculate (3, 9))

function in python:- A chunk of code known as a function only executes when it is invoked. Data that…

Complete the function calculate, which computes and returns the value of the following sum for the given arguments, x and n. n Σ ( ² × ²¹) = ( ² × ²¹ ) + ( ²⁄² × ²² ) + ( ³³² × ²³) + - + ( ² × ²¹) ... i=1 Assume n ≥ 1. Examples: Function Call calculate (5,4) calculate (2,7) Return Value [ ] 2.0256000000000003 140.0 calculate (7,2) 0.6122448979591837 calculate (3,9) 22.196311537875324 1 def calculate (x, n): 2 3 4 5 # Test cases 6 print (calculate (5, 4)) 7 print (calculate (2, 7)) return 0 # DELETE THIS LINE and start coding here. # Remember: end all of your functions with a return statement, not a print statement! 8 print (calculate (7, 9 print (calculate (3, 2)) 9))

Complete the function calculate, which computes and returns the value of the following sum for the given arguments, x and n. n Σ ( ² × ²¹) = ( ² × ²¹ ) + ( ²⁄² × ²² ) + ( ³³² × ²³) + - + ( ² × ²¹) ... i=1 Assume n ≥ 1. Examples: Function Call calculate (5,4) calculate (2,7) Return Value [ ] 2.0256000000000003 140.0 calculate (7,2) 0.6122448979591837 calculate (3,9) 22.196311537875324 1 def calculate (x, n): 2 3 4 5 # Test cases 6 print (calculate (5, 4)) 7 print (calculate (2, 7)) return 0 # DELETE THIS LINE and start coding here. # Remember: end all of your functions with a return statement, not a print statement! 8 print (calculate (7, 9 print (calculate (3, 2)) 9))

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.2: Returning A Single Value

Problem 11E: (Numerical) a. The following is an extremely useful programming algorithm for rounding a real number...

See similar textbooks

Similar questions

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
(Numerical) a. The following is an extremely useful programming algorithm for rounding a real number to n decimal places: Step 1: Multiply the number by 10n Step 2: Add 0.5 Step 3: Delete the fractional part of the result Step 4: Divide by 10n For example, using this algorithm to round the number 78.374625 to three decimal places yields: Step1:78.374625103=78374.625 Step2:78374.625+0.5=78375.125 Step3:Retainingtheintegerpart=78375Step4:78375dividedby103=78.375 Using this algorithm, write a C++ function that accepts a user-entered value and returns the result rounded to two decimal places. b. Enter, compile, and run the program written for Exercise 11a.
Write the definition of a function that takes as input two decimal numbers and returns first number to the power of the second number plus second number to the power of the first number. (4)
(Statics) A beam’s second moment of inertia, also known as its area moment of inertia, is used to determine its resistance to bending and deflection. For a rectangular beam (see Figure 6.6), the second moment of inertia is given by this formula: Ibh3/12 I is the second moment of inertia (m4). b is the base (m). h is the height (m). a. Using this formula, write a function called beamMoment() that accepts two double- precision numbers as parameters (one for the base and one for the height), calculates the corresponding second moment of inertia, and displays the result. b. Include the function written in Exercise 4a in a working program. Make sure your function is called from main(). Test the function by passing various data to it.
Mark the following statements as true or false: a. To use a predefined function in a program, you need to know only the name of the function and how to use it. (1) b. A value-returning function returns only one value. (2, 3) c. Parameters allow you to use different values each time the function is called. (2, 7, 9) d. When a return statement executes in a user-defined function, the function immediately exits. (3, 4) e. A value-returning function returns only integer values. (4) f. A variable name cannot be passed to a value parameter. (3, 6) g. If a C++ function does not use parameters, parentheses around the empty parameter list are still required. (2, 3, 6) h. In C + + , the names of the corresponding formal and actual parameters must be the same. (3, 4, 6) i. A function that changes the value of a reference parameter also changes the value of the actual parameter. (7) j. Whenever the value of a reference parameter changes, the value of the actual parameter changes. (7) k. In C++, function definitions can be nested; that is, the definition of one function can be enclosed in the body of another function. (9) l. Using global variables in a program is a better programming style than using local variables, because extra variables can be avoided. (10) m. In a program, global constants are as dangerous as global variables. (10) n. The memory for a static variable remains allocated between function calls. (11)
Prompt: When someone calls you on the phone, he or she looks up your number in a phone book (a function from names to phone numbers). When Caller ID shows who is calling, it has performed the inverse function, finding the name corresponding to the number. Explain why this situation represents an application of inverse of a function in familiar situations.
Write two functions that implement the following conversions:a. Function celsius receives a Fahrenheit temperature and returns its Celsius equivalent.b. Function fahrenheit receives a Celsius temperature and returns its Fahrenheit equivalent.Write a test program (main function) that uses celsius and fahrenhiet to print the following table.Celsius Fahrenheit | Fahrenheit Celsius40.0 104.0 | 120.0 48.8939.0 102.2 | 110.0 43.33...232.0 89.6 | 40.0 4.4431.0 87.8 | 30.0 -1.11
Display the first N magic numbers, where N is a positive number that the user provides as input. Here, a magic number is a number whose sum of its digits eventually leads to 1. For example, 1234 is a magic number because 1 + 2 + 3 + 4 = 10 and 1 + 0 = 1, while 1235 is not (1 + 2 + 3 + 5 = 11 and 1 + 1 = 2). Write a program that prints out the first N magic numbers, seven on each line. You are required to use the following function prototype: bool isMagic(int value); // Returns true if value is a magic number The outline of this function will be as follows: Step 1: Calculate the sum of digits of the value Step 2: Repeat Step 1 until we get a single-digit Step 3: If the resulting sum is equal to 1 then it is a magic number, otherwise not Here is the sample output:
Write a function that implements the quadratic equation. Given three inputs (a, b, and c), calculate the roots (r1 (+) and r2 (-)) of the quadratic formula. Review 19 Write a function that implements the quadratic equation. Given three inputs (a, b, and c), calculate the roots (r1 and r2) of the quadratic formula. Call your function Roots a = 1 b = 2 c = -3 [r1,r2]=Roots(a,b,c)
(Single Digit) Complete the definition of the following function:singleDigit :: Int -> Int singleDigit takes a positive integer, num, as input and returns a digit between 0 and 9 as the output. The output is computed as follows: sum all the digits in num to obtain a result; if this result is less than 10 then result is the answer; otherwise take the result and apply the same procedure (i.e. sum its digits and compute a result, and so on). Here is a sample run:*Main> singleDigit 37425 3 *Main> singleDigit 9876543 6 Here is how the above answers are computed by hand:singleDigit 37425 => 3+7+4+2+5 = 21 => 2+1 = 3 singleDigit 9876543 => 9+8+7+6+5+4+3 = 42 => 4+2 = 6
To convert between Celsius and Fahrenheit, the following formula is used, where C = Celsius temperature and F = Fahrenheit temperature: C = 5/9 * (F-32) Write a C++ temperature conversion program which does the following: Write a function called toCelsuis which takes a Fahrenheit temperature as a parameter, and returns the equivalent Celsius temperature: float toCelsius(float) Demonstrate that your function works by writing a main() function that prints out a conversion table. It should have Fahrenheit values 60, 61, 62, ... through 80 (21 temperatures in total) and should also have the corresponding Celsius temperatures that your function calculated. So your output should look something like this (with 21 temperature conversions total, I used ... to save space here for most of them): Welcome to the temperature table!F C60 15.661 16.1... ...80 26.7 If you like: you can add this line in your function to make floating point output fixed, make sure you…
3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n) 4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…