Write a program in C++ to do the following tasks. a) Read a number N from the user. b) Using recursion generate and find sum of the numbers which are divisible by 3 starting from N and ends with 0. c) Print the numbers and sum as shown in the below output. Note: A number is divisible by 3 if the remainder after dividing the number with 3 is zero. Sample output 1: Enter a number: 15 Numbers are: 15 12 sum of the numbers are:45 Sample output 2: Enter a number: 20 18 Numbers are: 15 sum of the numbers are:63 12 9 3

Write a program in C++ to do the following tasks. a) Read a number N from the user. b) Using recursion generate and find sum of the numbers which are divisible by 3 starting from N and ends with 0. c) Print the numbers and sum as shown in the below output. Note: A number is divisible by 3 if the remainder after dividing the number with 3 is zero. Sample output 1: Enter a number: 15 Numbers are: 15 12 sum of the numbers are:45 Sample output 2: Enter a number: 20 18 Numbers are: 15 sum of the numbers are:63 12 9 3

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write the definition of a recursive function int simpleSqrt(int n) The function returns the integer square root of n, meaning the biggest integer whose square is less than or equal to n. You may assume that the function is always called with a nonnegative value for n. Use the following algorithm: If n is 0 then return 0. Otherwise, call the function recursively with n-1 as the argument to get a number t. Check whether or not t+1 squared is strictly greater than n. Based on that test, return the correct result. For example, a call to simpleSqrt(8) would recursively call simpleSqrt(7) and get back 2 as the answer. Then we would square (2+1) = 3 to get 9. Since 9 is bigger than 8, we know that 3 is too big, so return 2 in this case. On the other hand a call to simpleSqrt(9) would recursively call simpleSqrt(8) and get back 2 as the answer. Again we would square (2+1) = 3 to get back 9. So 3 is the correct return value in this case.
Write a program to print the number from 11 to 30 both included using recursion in clojure programming language
Python Using recursion No loops Print asterisks If k > n, n is negative or zero, or indent is negative, the function does not print anything. It may use string multiplication and formatted strings such s * num for some string s and some integer num def printStars(k, n, indent):
6) Write a recursive function to calculate the summation of numbers from 1 to n. For exampleif the user enters 5, your program would add 1+2+3+4+5 and print out the answer 15.7) Write a recursive program to calculate Fibonacci numbers. Use the definition of a Fibonaccinumber where F(n) = F(n-1) + F(n-2). use java to code
A,5digit positive integer is entered through the keyboard write a function of digit of the 5 digit number 1 without using recurism 2 using recursion
Write a recursive function to find the factorial of a number.int factorial(int n);
with python
Write a recursive function to see if the first letter matches the last letter, return the middle letters and check until only 0 or 1 letters are left. It returns True or False. Here is the original code that needs to be checked: # Returns the first character of the string str def firstCharacter(str): return str[:1] # Returns the last character of a string str def lastCharacter(str): return str[-1:] # Returns the string that results from removing the first # and last characters from str def middleCharacters(str): return str[1:-1] def isPalindrome(str): # base case #1 # base case #2 # recursive case pass Python code
.......
Python
The process of defining a problem or the solution of the problem in terms of a simpler version of itself is called Select one: a.function b.recursion c.binary search d.condition
Write a recursive function that finds the number of occurrences of a specified letter in a string using the following function header. def count(s, a):For example, count("Welcome", 'e') returns 2. Write a test program thatprompts the user to enter a string and a character, and displays the number of occurrences for the character in the string.