Recursion in One Shot in java | Number Programs based on Recursion |ISC Computer Science Class 12th

Recursion in one shot in java | Number Programs based on Recursion |ISC Computer Science Class 12th Function Recursion in java| Recursive function in java | Recursive function example for isc computer science Ready to unlock the secrets of function recursion in Java? 🚀 Dive into the captivating world of recursive algorithms with our comprehensive guide! 📚 In this video we covered #Armstrong number program using function recursion #Palindrome number program using function recursion #Perfect number program using function recursion #Evil number program using function recursion #Pronic number program using function recursion #sumofseries program using function recursion #function recursion programs for class 11th 12th isc computer science #function recursion #recursion programs #program for class 11th 12th isc #isc computer science #computer science #Recursion in One Shot #Number Programs based on Recursion #ISC Computer Science Class 12th, #important Java Programs based on recursion #Java Program #isc java programming Dedign a class ArmNum to check if a given number is an Armstrong number or not. Example : 371 = 33 + 73 +13 = 27 + 343 + 1 = 371 : 1634 = 14 + 64 + 34 + 44 =1634 Class : ArmNum Data member: n : to store the number l : to store the length of the number Member functions: ArmNum(int nn) : Parameterized constructor int sum_pow(int i) : returns the sum of each digit raised to the power of the length of the number Using recursive technique. Eg: 34 will return 32 + 42 (as the length of the number is 2) void isArmstrong() : checks whether the given number is an Armstrong number by invoking the function sum_pow() and displays the result with an appropriate message. Question 2: A class SeriesSum is designed to calculate the sum of the following series: Some of the members of the class are given below: Class name : SeriesSum Data members/instance variables: x : to store an integer number n : to store number of terms sum : double variable to store the sum of the series Member functions: SeriesSum(int xx, int nn) : constructor to assign x=xx and n=nn double findfact(int m) : to return the factorial of m using recursive technique. double findpower(int x, int y) void calculate( ) : to calculate the sum of the series by invoking the recursive functions respectively void display( ) : to display the sum of the series Question 3: A class Palin has been defined to check whether a positive number is a Palindrome number or not. The number ‘N’ is palindrome if the original number and its reverse are same. Some of the members of the class are given below: [10] Class name : Palin Data members/instance variables: num : integer to store the number revnum : integer to store the reverse of the number Methods/Member functions: Palin( ) : constructor to initialize data members with legal initial values void accept( ) : to accept the number int reverse(int y) : reverses the parameterized argument ‘y’ and stores it in ‘revnum’ using recursive technique. void check( ) Question 4: Design a class Perfect to check if a given number is a perfect number or not. [ A number is said to be perfect if sum of the factors of the number excluding itself is equal to the original number] Example : 6 = 1 + 2 + 3 (where 1, 2 and 3 are factors of 6, excluding itself) Some of the members of the class are given below: [10] Class name : Perfect Data members/instance variables: num : to store the number Methods/Member functions: Perfect (int nn) int sum_of_factors(int i) void check( ) Question 5: An Evil Number is a number which contains even number of 1’s in its binary equivalent. Example: Binary equivalent of 10 = 1010 which contains even number on 1’s. Thus, 10 is an Evil Number. Design a class Evil to check if a given number is an Evil number or not. Some of the members of the class are given below: . [10] Class name : Evil Data members/instance variables: num : to store a positive integer number bin : to store the binary equivalent Methods / Member functions: Evil( ) void acceptNum( ) void rec_bin (int x) void check( ) Question 6: Design a class Pronic to check if a given number is a pronic number or not. [ A number is said to be pronic if the product of two consecutive numbers is equal to the number] Example: 0 = 0 × 1 2 = 1 × 2 6 = 2 × 3 12 = 3 × 4 thus, 0, 2, 6, 12... are pronic numbers. Some of the members of the class are given below: [10] Class name : Pronic Data members/instance variables: num : to store a positive integer number Methods / Member functions: Pronic( ) void acceptnum( ) boolean ispronic(int v) void check( ) MATLAB RAMJI SIR #ICSE JAVA PROGRAMMING #ISC JAVA PROGRAMMING #CBSE PYTHON PROGRAMMING #ICSE 10TH COMPUTER #ISC 12TH JAVA COMPUTER #CBSE 12TH PYTHON