C How to Program (8th Edition)
8th Edition
ISBN: 9780133976892
Author: Paul J. Deitel, Harvey Deitel
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 5, Problem 5.38E
Program Plan Intro
To modify the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
(Visualizing Recursion) It’s interesting to watch recursion “in action.” Modify the factorialfunction of Fig. 5.18 to print its local variable and recursive call parameter. For each recursive call,display the outputs on a separate line and add a level of indentation. Do your utmost to make theoutputs clear, interesting and meaningful. Your goal here is to design and implement an output format that helps a person understand recursion better. You may want to add such display capabilitiesto the many other recursion examples and exercises throughout the text.
4. The Area of the Target: To decide on prizes for the archery contest, you decided to use the areas of the center and
rings. You decided that rings with smaller areas should be worth more points. But how much more? Complete the
following investigation to help you decide.
a. Find the sequence of the areas of the rings, including the center. (Be careful.)
b. Write a recursive formula and an explicit formula for this sequence.
C.
Write the explicit formula in summation notation. Find the total area of the bull's eye if it had 9 rings around the
bull's eye.
(Recursive Exponentiation) Write a recursive function power(base, exponent) that wheninvoked returnsbaseexponentFor example, power(3, 4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equalto 1. Hint: The recursion step would use the relationshipbaseexponent = base * baseexponent–1and the terminating condition occurs when exponent is equal to 1 becausebase1 = base
Chapter 5 Solutions
C How to Program (8th Edition)
Ch. 5 - Show the value of x after each of the following...Ch. 5 - (Parking Charges) A parking garage charges a $2.00...Ch. 5 - (Rounding Numbers) An application of function...Ch. 5 - (Rounding Numbers) Function floor may be used to...Ch. 5 - Write statements that assign random integers to...Ch. 5 - For each of the following sets of integers, write...Ch. 5 - (Hypotenuse Calculations) Define a function called...Ch. 5 - (Exponentiation) Write a function...Ch. 5 - Prob. 5.17ECh. 5 - Prob. 5.18E
Ch. 5 - Prob. 5.19ECh. 5 - (Displaying a Square of Any Character) Modify the...Ch. 5 - Prob. 5.21ECh. 5 - (Separating Digits) Write program segments that...Ch. 5 - (Time in Seconds) Write a function that takes the...Ch. 5 - (Temperature Conversions) Implement the following...Ch. 5 - (Find the Minimum) Write a function that returns...Ch. 5 - (Perfect Numbers) An integer number is said to be...Ch. 5 - Prob. 5.27ECh. 5 - (Reversing Digits) Write a function that takes an...Ch. 5 - (Greatest Common Divisor) The greatest common...Ch. 5 - (Quality Points for Students Grades) Write a...Ch. 5 - (Coin Tossing) Write a program that simulates coin...Ch. 5 - (Guess the Number) Write a C program that plays...Ch. 5 - (Guess the Number Modification) Modify the program...Ch. 5 - (Recursive Exponentiation) Write a recursive...Ch. 5 - (Fibonacci) The Fibonacci series 0, 1, 1, 2, 3, 5,...Ch. 5 - (Towers of Hanoi) Every budding computer scientist...Ch. 5 - Prob. 5.37ECh. 5 - Prob. 5.38ECh. 5 - Prob. 5.39ECh. 5 - Prob. 5.40ECh. 5 - (Distance Between Points) Write a function...Ch. 5 - Prob. 5.42ECh. 5 - Prob. 5.43ECh. 5 - After you determine what the program of Exercise...Ch. 5 - (Testing Math Library Functions) Write a program...Ch. 5 - Find the error in each of the following program...Ch. 5 - Prob. 5.47ECh. 5 - (Research Project: 1m proving the Recursive...Ch. 5 - (Global Warming Facts Quiz) The controversial...Ch. 5 - Prob. 5.50MDCh. 5 - Prob. 5.51MDCh. 5 - (Computer-Assisted Instruction: Monitoring Student...Ch. 5 - (Computer-Assisted Instruction: Difficulty Levels)...Ch. 5 - (Computer-Assisted Instruction: Varying the Types...
Knowledge Booster
Similar questions
- (b) Good Programming practices help in improving programs readability and understandability both for a programmer and for a general user. What changes would you make in the following program, written by a beginner, keeping in view the good programming practices. You are also required to write the output of the program if a user wants to find factorial of number 6. Note: The Program finds/calculates factorial of a number using a user defined recursive function. #include using namespace std; int f(int n); int main() { int n; cout > n; cout 1) return n * f(n - 1); else return 1; }arrow_forward(C Language) Write a recursive function called DrawTriangle() that outputs lines of '*' to form a right side up isosceles triangle. Function DrawTriangle() has one parameter, an integer representing the base length of the triangle. Assume the base length is always odd and less than 20. Output 9 spaces before the first '*' on the first line for correct formatting. Hint: The number of '*' increases by 2 for every line drawn.arrow_forward2, Towers of Hanoi Problem. (10 points) The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. Answer the following questions. (1) Determine a state representation for this problem. (4points) (2) What is the size of the state space? (3 points) (3) Supposing K=3, N=4, what is the start state by using your proposed state representation method and what is the goal state? (3 points)arrow_forward
- (Towers of Hanoi: Iterative Solution) Any program that can be implemented recursivelycan be implemented iteratively, although sometimes with considerably more difficulty and considerably less clarity. Try writing an iterative version of the Towers of Hanoi. If you succeed, compareyour iterative version with the recursive version you developed in Exercise 5.36. Investigate issuesof performance, clarity, and your ability to demonstrate the correctness of the programs.arrow_forwardNOTE: (what your answer will contain) 1 Use C PROGRAMMING LANGUAGE ONLY 2. Use RECURSION type of program 3. Copy and paste your code(no need screenshot) 4. Screenshot the output 5. It should be USER-DEPENDENT 3. Write a C program containing a recursive function that will get the whole number quotient result of dividing two integers n and m. (Example if n=4 and m 3, 4/3 1. Output 1)arrow_forwardQUESTION 9 There are several rules to keep in mind when writing a recursive function. Select all of them from the following list. A. The recursive function may not call any other function or method. B. The value of all arguments passed to the recursive tunction must change for every recursive cal. C. The recursive method must cali the main function in order to begin. D. There must be a clearly stated base case. E. The function must contain a break statement to end the recursion. OF. The recursive function may not include a return statement. G. Recursive calls to the function must converge on the base case. H. One or more arguments passed to the function must change in value each time the function is cailed.arrow_forward
- (GREATEST COMMON DIVISOR) The greatest common divisor of integers x and y is the largest integer that evenly divides into both x and y. Write and test a recursive function gcd that returns the greatest common divisor of x and y. The gcd of x and y is defined recursively as follows: If y is equal to 0, then gcd (x, y) is x; otherwise, gcd (x, y) is gcd (y, x % y), where % is the remainder operator.arrow_forwardPython only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…arrow_forwardPython only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…arrow_forward
- NOTE: (what your answer will contain) 1. Use C PROGRAMMING LANGUAGE ONLY 2. Use RECURSION type of program 3. Copy and paste your code(no need screenshot) 4. Screenshot the output 5. It should be USER-DEPENDENT 4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,2... begins with terms 0 and I and has the property that nach suoceeding term is the sum of the two previous terme. Write a program containing e recursive function that computes and cisplays Ihe n"Fibenacc number, given the value for n.arrow_forward(b) Good Programming practices help in improving programs readability and understandability both for a programmer and for a general user. What changes would you make in the following program, written by a beginner, keeping in view the good programming practices. You are also required to write the output of the program if a user wants to find factorial of number 6. Note: The Program finds/calculates factorial of a number using a user defined recursive function. #include<iostream> using namespace std; int f(int n); int main() {int n; cout << "Enter: "; cin >> n; cout << "Answer = " <<factorial(n); return 0; } int f(int n) { if(n > 1)return n * f(n - 1); else return 1; }arrow_forward6. Write a recursive function that find the sum of the following series. 1+1/2+1/4+1/8+...+1/2"arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning