Roys CoDing HuB

  Q.3        WAP in C/ C++/ java to find the suffix of the given number.             Inputs               Outputs                1                            st                2                             nd                3                              rd                11        ...

  Q.2   WAP in C/ C++/ java to print the even numbers between M and N ( 0> M,N <100 ). Solution :  #include <stdio.h> void   main () {      int   M , N ;      printf ( " \n Enter the lower limit : " );      scanf ( " %d " ,  & M );      printf ( "Enter the upper limit : " );      scanf ( " %d " ,  & N );      if (  M > N   ||   M == N   ||   M < 1   ||   M > 100   ||   N < 1   ||   N > 100 )     {          printf ( " \n Invalid input. Enter the inputs again -->" );          main ();     }      else    ...

     1.          Q.1      WAP in C/ C++/ java to perform the following tasks : a.       Accept two numbers from the user( a and b). b.       Print the numbers. c.        Print the smallest number. d.       Calculate their :                                i.       Summation (a+b)                               ii.       Subtract them (a-b)                              iii.       Multiply them (a*b)                              iv.  ...

  Number Programs for Absolute Beginners : LEVEL 1 à 1.       WAP in C/ C++/ java to perform the following tasks : a.       Accept two numbers from the user( a and b). b.       Print the numbers. c.        Print the smallest number. d.       Calculate their :                                                               i.       Summation (a+b)                             ...

  /**  * Write a Java program to find and print the Happy numbers between m and n. Happy number: Starting with any positive integer, replace the number by the sum of the squares of its digits,  and repeat the process until the number equals 1, or it loops endlessly in a cycle which does not include 1. Example: 19 is a happy number 1^2 + 9^2=82 8^2 + 2^2=68 6^2 + 8^2=100 1^2 + 0^2 + 02=1 The first few happy numbers are 1, 7, 10, 13, 19, 23, 28, 31, 32, 44, 49, 68, 70, 79, 82, 86, 91, 94, 97, 100, ...  */ import java.util.*; public class HappyNum {     public static int digitSq( int x) // recursive function to find square of digits of the number     {         if(x<10)         return x*x;         else         return (x%10)*(x%10) + digitSq(x/10);     } // end of digitSq()          public static boolean isHappy(int num, int i) ...

  /**  * Write a Java program to display first N Lucas numbers. ( 3>N>100 ) The Lucas numbers or series are integer sequences named after the mathematician François Édouard Anatole Lucas,  who studied both that sequence and the closely related Fibonacci numbers.  Lucas numbers and Fibonacci numbers form complementary instances of Lucas sequences. The sequence of Lucas numbers : 2, 1, 3, 4, 7, 11, 18, 29, ….  */ import java.util.*; public class Lucas {     public static void lucas( int x, int a, int b) //recursive function to display lucas series     {         i f(x==0)             System.out.println();         else         {             int c=a+b;             a=b;             b=c;             System.out.print( ",   " ...

  /**  * Write a Java program to print all the possible Abundant numbers (integers) between M and N ( 1 > M,N < 100000) . In number theory, an abundant number is a number for which the sum of its proper divisors are greater than the number itself. The first few abundant numbers are: 12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100,  102,... The integer 12 is the first abundant number. Its proper divisors are 1, 2, 3, 4 and 6 for a total of 16.  */ import java.util.*; public class AbundantNum {     public static int factors( int x, int f) / /recursive function to find the sum of factors of the number     {         if(x==f)              return 0;         else if(x%f==0)              return f+factors(x,f+1);         else              return f...