Python Programming: An Introduction to Computer Science, 3rd Ed.
3rd Edition
ISBN: 9781590282755
Author: John Zelle
Publisher: Franklin, Beedle & Associates
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 6, Problem 8PE
Program Plan Intro
Calculate the square root
- Import the required packages
- The function named “nextGuess()” is defined and inside the “nextGuess()”,
- Declare the required variable named as “g”.
- Calculate and assign the value of “g”
- Return the value stored in the “g” variable.
- In the “main()” function,
- Generate the prompts to take the user inputs
- Calculate the value of “g”.
- Initialize a for loop that ranges till the value of “y”, which is taken as user input.
- Call the method named “nextGuess()” with user input as the argument.
- Print the output value.
- Call the function “main()”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Please can be handwritten. Question 2: Implementing a Recursive Function . Write recursive function, recursionprob(n), which takes a positive number as its argument and returns the output as shown below.
The solution should clearly write the steps as shown in an example in slide number 59 and slide number 60 in lecture slides.
After writing the steps, trace the function for “recursiveprob(5)” as shown in an example slide number 61.
Function Output: >> recursionprob(1) 1 >> recursionprob(2) 1 4 >> recursionprob(3) 1 4 9 >>recrusionprob(4) 1 4 9 16
Which of the following statements are true?■ Any recursive function can be converted into a nonrecursive function.■ Recursive functions take more time and memory to execute than nonrecursive functions.■ Recursive functions are always simpler than nonrecursive functions.■ There is always a selection statement in a recursive function to check whether a base case is reached.
Drawing a right side up triangle
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.
Ex: If the input of the program is:
3
the function DrawTriangle() outputs:
* ***
Ex: If the input of the program is:
19
the function DrawTriangle() outputs:
* *** ***** ******* ********* *********** ************* *************** ***************** *******************
Note: No space is output before the first '*' on the last line when the base length is 19. in c++
Chapter 6 Solutions
Python Programming: An Introduction to Computer Science, 3rd Ed.
Ch. 6 - Prob. 1TFCh. 6 - Prob. 2TFCh. 6 - Prob. 3TFCh. 6 - Prob. 4TFCh. 6 - Prob. 5TFCh. 6 - Prob. 6TFCh. 6 - Prob. 7TFCh. 6 - Prob. 8TFCh. 6 - Prob. 9TFCh. 6 - Prob. 10TF
Ch. 6 - Prob. 1MCCh. 6 - Prob. 2MCCh. 6 - Prob. 3MCCh. 6 - Prob. 4MCCh. 6 - Prob. 5MCCh. 6 - Prob. 6MCCh. 6 - Prob. 7MCCh. 6 - Prob. 8MCCh. 6 - Prob. 9MCCh. 6 - Prob. 10MCCh. 6 - Prob. 1DCh. 6 - Prob. 2DCh. 6 - Prob. 3DCh. 6 - Prob. 4DCh. 6 - Prob. 5DCh. 6 - Prob. 1PECh. 6 - Prob. 2PECh. 6 - Prob. 3PECh. 6 - Prob. 4PECh. 6 - Prob. 5PECh. 6 - Prob. 6PECh. 6 - Prob. 7PECh. 6 - Prob. 8PECh. 6 - Prob. 9PECh. 6 - Prob. 10PECh. 6 - Prob. 11PECh. 6 - Prob. 12PECh. 6 - Prob. 13PECh. 6 - Prob. 14PECh. 6 - Prob. 16PECh. 6 - Prob. 17PE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Which of the following statements are true? Any recursive function can be converted into a nonrecursive function. A recursive function takes more time and memory to execute than a onrecursive function. Recursive functions are always simpler than nonrecursive functions. There is always a selection statement in a recursive function to check whether a base case is reached.arrow_forwardCodeW X bFor fun X C Solved x b Answer + x https://codeworko... CodeWorkout X265: Recursion Programmlng Exercise: GCD The greatest common divisor (GCD) for a pair of numbers is the largest positive integer that divides both numbers without remainder. For function GCD , write the missing base case condition and action. This function will compute the greatest common divisor of x and y.You can assume that x and y are both positive integers and that x > y. Greatest common divisor is computed as follows: = x and GCD(x, y) = GCD(y, x % y). Examples: GCD (6, 4) -> 2 Your An swer: 1 public int GCD(int x, int y) { if > { 2. > 3. } else { 4. return GCD(y, x % y); 9. { 7. 1:09 AM 50°F Clear 1V 1. 12/4/2021 甲arrow_forwardRead Chapter 12 Recursive Lines Write a recursive function that accepts an integer argument, n. The function should display n lines of asterisks on the screen, with the first line showing 1 asterisk, the second line showing 2 asterisks, up to the middle line which shows n asterisks. You will then continue to print less stars until your last line of one asterisk. With an input of 3 your output should look like below. You will need to wind the stack to print up to your largest line. You will print the last set of lines as you unwind the stack or as you come out of your recursion. * ** *** ** *arrow_forward
- JAVA CODE PLEASE Recursive Functions Practice ll by CodeChum Admin Create a recursive function named factorial that accepts an integer input as a parameter. This calculates the factorial of that integer through recursion and return it. In the main function, call the factorial function and assign the value to a variable. Print the value in the next line. Input 1. One line containing an integer Output Enter·a·number:·4 24arrow_forward4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that each succeeding term is the sum of the two previous terms. Write a program containing a recursive function that computes and displays the nh Fibonacci number, given the value for n.arrow_forward4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that each succeeding term is the sum of the two previous terms. Write a program containing a recursive function that computes and displays the nth Fibonacci number, given the value for n.arrow_forward
- Design a function that accepts an integer argument and returns the sum of all the integers from 1up to the number passed as an argument. For example, if 50 is passed as an argument, thefunction will return the sum of 1, 2, 3, 4, . . . 50. Use recursion to calculate the sum.arrow_forwardWrite a recursive function that finds factorial. Ex 4 >>>> 24 WRITE IN PYTHON PLEASEarrow_forwardComputer Science In python, how do I make a function that will initiate a round of a game, in a game where there's a total of three rounds total, and the first person to win 2 rounds win.arrow_forward
- Python 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_forwardQuestion 2: Implementing a Recursive Function .Write recursive function, recursionprob(n), which takes a positive number as its argument and returns the output as shown below. The solution should clearly write the steps as shown in an example in slide number 59 and slide number 60 in lecture slides. After writing the steps, trace the function for “recursiveprob(5)” as shown in an example slide number 61. Function Output: >> recursionprob(1) 1 >> recursionprob(2) 1 4 >> recursionprob(3) 1 4 9 >>recrusionprob(4) 1 4 9 16arrow_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
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License