Introduction to Programming with C++
3rd Edition
ISBN: 9780133252811
Author: Y. Daniel Liang
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 6, Problem 9CP
Identify and correct the errors in the following
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a recursive function diff which takes two positive integer arguments (x and y) and returns |x – y|. You may not perform an x - y calculation anywhere in the function! Example calls: diff(3, 7) returns 4; diff(7,3) returns 4
In JAVA
Write a recursive function definition for the following function: int squares(int n); //Precondition: n >= 1 //Returns the sum of the squares of numbers 1 through n. For example, squares(3) returns 14 because 12 + 22 + 32 is 14.
Write java overloaded function calculate() with following function definitions.void calculate(int x, int y ) – to calculate the sum of all even numbers from xtill y and print the sum .void calculate(char a,char n) – to print all vowels from variable a to n if anyvoid calculate(int x, int y, int z) – to print the middle number from x,y,z ifyou arrange them in ascending order.
Chapter 6 Solutions
Introduction to Programming with C++
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
- Given two integers x snf y, the following recurrsive definition determined the greatest common divisor of x and y, Write gcd(xy). Write a recursive function, gcd, that takes two integers as parameters and returns the greatest commmon divisorof numbers.Also write a program to test your function. Write a recursive function,reverseDigits, that takes an integer as a parameter snd returns the number with the digits reversed. Also write a program to test your application.arrow_forward(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.arrow_forwardWrite a recursive function called Mod which takes two positive integers argument (aand b) and returns a % b – the remainder of a dividing by b. You may not use a remainderoperator or built-in function.arrow_forward
- Write a recursive function called Mod (java) which takes two positive integers argument (a and b) and returns a % b –the remainder of a dividing by b. You may not use a remainder operator or built-in function.arrow_forwardEach of the following recursive function definitions contains an error. Briefly but fully and clearly explain what is wrong with each definition. f(x) = 3*f(x-5) where x is a positive integer. f(0) = 7 2. g(x) = 2 - 4*g(x) where x is a positive integer. g(1) = 3 g(2) = 4arrow_forwardWrite a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, the pattern generated is as follows: **** *** ** * * ** *** **** Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.arrow_forward
- The following recursive function takes three positive integer arguments: def compute(n,x,y) : if n==0 : return x return compute(n-1,x+y,y) What is the value returned by the compute function? n*x+y x+y x+n*y x What if: will the returned value be for the compute function defined in the question above if the argument n is negative? x x-n*y x+n*y The function will never return a value.arrow_forwardTake a look at the pseudocode representation of the following recursive function, GUESS(n, m). To identify the output when the recursive function is invoked with, manually trace the code. n = 6 and m = 3. function GUESS(n, m)if (m > n) then return (0);if (m = n) then return (1);if (n = 1) or (m = 0) then return (1);if (m < n) then return ((n-1)*GUESS(n-1, m-1));end GUESSarrow_forwardWrite a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is:********************Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the above pattern.arrow_forward
- The greatest integer function is defined by int(x) = the greatest integer that is ....................For example, int(2.5) = ................ int(-2.5) = ............... and int(0.5) = ...................arrow_forwardWe rite a recursive function that calculates the products of natural numbers (1 through n) as follows: - asks the user to enter a positive number n - calculates and prints out the product of 1 through n (for example for n=5 the product is 120) Uploads: .c code and the outputarrow_forwardWrite a recursive function named sumSquares that returns the sum of the squares of the numbers from 0 to num, in which num is a nonnegative int variable. Do not use global variables; use the appropriate parameters. Also write a program to test your function.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Computer Programming for Beginners | Functions, Parameters & Arguments | Ep24; Author: Programming With Avelx;https://www.youtube.com/watch?v=VXlh-qJpfw0;License: Standard YouTube License, CC-BY