Program Plan: piValuevariableis used in the program. pi () function is include in the program to display the data. Program Description: The main purpose of the program is to create a function named pi (). This function has no parameter. This function is used to calculate the value of the p. This function display the value of the p.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6.1, Problem 11E

Program Plan Intro

Program Plan:

piValuevariableis used in the program.

pi () function is include in the program to display the data.

Program Description: The main purpose of the program is to create a function named pi (). This function has no parameter. This function is used to calculate the value of the p. This function display the value of the p.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(Valid Password) You are required to test the validity of a password by writing the following 4 C++ functions: a. A function called passSize that receives a string and returns true if the string has 8 or more characters. b. HA function called passSpace that receives a string and returns false if the string has space. A function called passSymbol that receives a string and returns true if the string has at least one symbol (consider a symbol as a character that is neither a letter nor a digit). C. d. A function called passUpper that receives a string and returns true if the string has at least one uppercase letter.

(Fibonacci) The Fibonacci series0, 1, 1, 2, 3, 5, 8, 13, 21, …begins with the terms 0 and 1 and has the property that each succeeding term is the sum of the twopreceding terms. a) Write a nonrecursive function fibonacci(n) that calculates the nth Fibonaccinumber. Use unsigned int for the function’s parameter and unsigned long long int for its returntype. b) Determine the largest Fibonacci number that can be printed on your system.

Please write a C++ coding with modularity using functions. 15. (Numerical) a. Euclid’s method for finding the greatest common divisor (GCD) of two positive integers consists of the following steps:Step 1: Divide the larger number by the smaller and retain the remainder.Step 2: Divide the smaller number by the remainder, again retaining the remainder.Step 3: Continue dividing the previous remainder by the current remainder until the remainder is zero, at which point the last non-zero remainder is the GCD. For example, if the two positive integers are 84 and 49, you have the following: Step 1: 84/49 yields a remainder of 35.Step 2: 49/35 yields a remainder of 14.Step 3: 35/14 yields a remainder of 7.Step 3: 14/7 yields a remainder of 0. Therefore, the last non-zero remainder, which is 7, is the GCD of 84 and 49.Using Euclid’s algorithm, replace the stub function written for Exercise 14 with an actual function that determines and returns the GCD of its two integer arguments. thank you…