
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
![Given a string str and number n, write a program that recursively appends a copy of string str n times and returns the resulting string. For example:
RecuriveCopy("a", 10)
// -> "aaaaaaaaaaa"
RecursiveCopy("blah", 5)
// -> "blahblahblahblahblahblah"
For this exercise, complete the following function. n is the number of copies to add to str:
function RecursiveCopy(str, n) {
// your code here
}
Part 2: Call RecursiveCopy
Write another function that calls RecursiveCopy() and returns the following string output: "The resulting string [x] has [y] characters". [x] should be replaced by the
result from RecursiveCopy) and [y] should be replaced by the number of characters in the resulting string. You may pick the arguments to RecursiveCopy in
CountChars or have the user provide input. I will leave this up to you.
function CountChars() {
}
// your code here
// call RecursiveCopy(..)
// returns a formatted string
For example:
console.log(CountChars())
// -> "The resulting string blahblahblahblah has 16 characters"](https://content.bartleby.com/qna-images/question/34ad7f09-3af4-48a5-aeaa-19cf65627345/0b4fa10e-cbcc-4100-aed5-dc17cdc50e1a/f4ggap2_thumbnail.png)
Transcribed Image Text:Given a string str and number n, write a program that recursively appends a copy of string str n times and returns the resulting string. For example:
RecuriveCopy("a", 10)
// -> "aaaaaaaaaaa"
RecursiveCopy("blah", 5)
// -> "blahblahblahblahblahblah"
For this exercise, complete the following function. n is the number of copies to add to str:
function RecursiveCopy(str, n) {
// your code here
}
Part 2: Call RecursiveCopy
Write another function that calls RecursiveCopy() and returns the following string output: "The resulting string [x] has [y] characters". [x] should be replaced by the
result from RecursiveCopy) and [y] should be replaced by the number of characters in the resulting string. You may pick the arguments to RecursiveCopy in
CountChars or have the user provide input. I will leave this up to you.
function CountChars() {
}
// your code here
// call RecursiveCopy(..)
// returns a formatted string
For example:
console.log(CountChars())
// -> "The resulting string blahblahblahblah has 16 characters"
SAVE
AI-Generated Solution
info
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
to generate a solution
Click the button to generate
a solution
a solution
Knowledge Booster
Similar questions
- How to attempt? Question: Given a string, write a recursive function which will print one character of a string at one time by removing white spaces and the following special characters [#../?]. Example: Input: Hello User Output: Recursive call 1: r Recursive call 2: e Recursive call 3: s Recursive call 4: U Recursive call 5: o Recursive call 6: 1 Recursive call 7:1 Recursive call 8: e Recursive call 9: Harrow_forwardWrite code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common.Sample output with inputs: 4 24^2 = 16 def raise_to_power(base_val, exponent_val): if exponent_val == 0: result_val = 1 else: result_val = base_val * ''' Your solution goes here ''' return result_val user_base = int(input())user_exponent = int(input()) print('{}^{} = {}'.format(user_base, user_exponent, raise_to_power(user_base, user_exponent)))arrow_forwardWrite a recursive function that accepts a number and returns its factorial. b. Write a recursive function that accepts an array, its size and the index of the initial element as arguments. The function fills the array with the elements of the following sequence: n1 = 3, nk+1 = nk+35 c. Write an iterative and a recursive versions of the binary search. In C++ codingarrow_forward
- Which of the following is the termination condition in the following recursive function, assuming N only accepts integer values? def xxx(N): if (N 4 b. N > 5 C. N<4 D. N< 5arrow_forwardWrite a RECURSIVE function, without using any loops, that prints the contents of a matrix with 3 columns. The function should take the matrix and the number of rows as arguments. void print_matrix(int arr[][3], int num_rows);arrow_forwardWrite code to complete raise_to_power). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(0, would be more common. Sample output with inputs: 4 2 4^2 = 16 344614.2214230.qx3zqy7 1 def raise_to_power (base_val, exponent_val): if exponent_val result_val 2 0: == = 1 4 else: result_val base_val * Your solution goes here ... = 6. 7 return result_val 9 user_base 10 user_exponent int (input ()) int (input ()) = = 11 12 print ('{}^{} {}'.format (user_base, user_exponent, raise_to_power (user_base, user_exponent))) 13arrow_forward
- Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…arrow_forwardPlease only do rec_sum_digits function in python using only recursive and no looparrow_forwardCan you please use python code and explain it pleasearrow_forward
- python3 Write a recursive function called is_palindrome(string) that takes a string parameter and checks if it is a palindrome ignoring the spaces, if any, and returns True/False. Sample output:>>> print(is_palindrome("never odd or even"))True>>> print(is_palindrome("step on no pets"))Truearrow_forwardConsider a network of streets laid out in a rectangular grid, In a northeast path from one point in the grid to another, one may walk only to the north (up) and to the east (right). Write a program that must use a recursive function to count the number of northeast paths from one point to another in a rectangular grid. Your program should prompt the user to input the numbers of points to the north and to east respectively, and then output the total number of paths. Notes: 1. Here is a file (timer.h download and timer.cpp download) which should be included in your program to measure time in Window or Unix (includes Mac OS and Linux) systems (use start() for the beginning of the algorithm, stop() for the ending, and show() for printing). 2. The computing times of this algorithm is very high, and the number of paths may be overflow, don't try input numbers even over 16. 3. Name your recursive function prototype as calcPath(int north, int east) to ease grading. 4. Paste your outputarrow_forwardUsing recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education