Question

2. Write a recursive method that returns the number of digits that are in a positive integer.

Answer #1

In the given question we have to count the number of digits in a positive integer by using recursion.

Here is the C++ program for doing this-

```
#include<iostream>
using namespace std;
//Recursive function for counting number of digits
int Digits(long long n){
if (n==0)
return 0;
else
return 1+Digits(n / 10);
}
//Main code
int main(){
long long n;
cout<<" Enter the number "<<endl;
cin>>n;
cout<<" Number of digits in given number are "<<Digits(n);
return 0;
}
```

For example -

Input- 164528

Output- Number of digits are 6

Write a recursive method public static int
sumEveryOther(int n) that takes a positive int as an
argument and returns the sum of every other int from n down to
1.
For example, the call sumEveryOther(10) should return 30, since
10 + 8 + 6 + 4 + 2 = 30.
The call sumEveryOther(9) should return 25 since 9 + 7 + 5 + 3 +
1 = 25.
Your method must use recursion.

Write a recursive method repeatNTimes(String s, int n) that
accepts a String and an integer as two parameters and returns a
string that is concatenated together n times. (For example,
repeatNTimes ("hello", 3) returns "hellohellohello") Write a driver
program that calls this method from the Main program.
Program should ask for input and be stored in the string and
should return n amount of times.

In C++ Using recursion write a program that takes a positive
integer number and returns whether there is 6. For example, if the
input number is 7068, the function returns true

In JAVA
Write a RECURSIVE method that receives as a parameter an integer
named n. The method will output n # of lines of stars. For example,
the first line will have one star, the second line will have two
stars, and so on.
The line number n will have "n" number of ****** (stars)
so if n is 3 it would print
*
**
***
The method must not have any loops!

Write the recursive version of the function decimal which takes
in n, a number, and returns a list representing the decimal
representation of the number.
def decimal(n):
"""Return a list representing the decimal representation of a number.
>>> decimal(55055)
[5, 5, 0, 5, 5]
>>> decimal(-136)
['-', 1, 3, 6]
"""

Write recursive method to return true if a given array of
integers, named numbers, with n occupied positions is sorted in
ascending (increasing) order, or returns false otherwise. Array can
be empty or not.
//PRECONDITION: Varible n denotes the number of occupied
positions in the array and must be non-negative.
Employee class has method getSalary() that returns employee's
salary.
// An empty array and an array with single element in it, are
sorted. Method isSortedRec must be recursive and
returns...

IN JAVA: Write recursive method to return true if a given array
has element equal to employee emp, or returns false otherwise.
Array can be empty or not.
//PRECONDITION: Varible n denotes the number of occupied
positions in the array and must be non-negative.
Employee class has method getSalary() that returns employee's
salary,
// and it has method boolean equals(Employee emp) that accept an
employee object and returns true if employee calling the equals
method is equal as employee emp,...

For C++:
a) Write a function is_prime that takes a positive integer X and
returns 1 if X is a prime number, or 1 if X is not a prime
number.
b) write a program that takes a positive integer N and prints
all prime numbers from 2 to N by calling your function is_prime
from part a.

Write a recursive method to return all possible k permutations
of the given String non-zeros number
Sample input : "123" , 2
output : "1-2", "1-3", "2-3", "2-1", "3-1", "3-2"
** Please provide
-PSEUDO CODE
-UML DIAGRAM

A program devise a recursive algorithm to find a2n, where a is a
real number and n is a positive integer (hint: use the equality
a2n+1 = (a^2n)^2

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 45 seconds ago

asked 2 minutes ago

asked 50 minutes ago

asked 50 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago