Java Program finding the sum of the digits of a given number

//Java program finding the sum of the digits of a number

 

SumOfDigitsofaNumberDemo.java

public class SumOfDigitsofaNumberDemo
{
 public static void main(String[] args)
 {

	 int originalNumber=2345;
	 int rem=0;
	 int number = originalNumber;
	 int sum = 0;
	//Find sum of the digits of the number

	while(number > 0){
		rem = number % 10;
		number = number / 10;
		sum = sum + rem;
	}

	System.out.println("Sum of the Digits of the "+originalNumber+ " is "+sum);
	}
}

o/p

 Sum of the Digits of 2345 is 14.

 Dry Run

/*

* rem = 2345 % 10 = 5 rem stores remainder

* number = 2345 / 10 = 234 number stores quotient the remaining number

*

*  rem   number  sum=sum+rem

*   5      234      0+5= 5

*   4      23       5+4= 9

*   3      2        9+3= 12

*   2      0        12+2 = 14

*

* */

Java program checking whether a Number is Palindrome

//Java program checking whether a Number is Palindrome

PalindromeNumberDemo.java

public class PalindromeNumberDemo
{
 public static void main(String[] args)
 {

   int originalNumber=1441;
	 int temp, reversedNumber=0;
	 int number = originalNumber;
	//reverse the number

	while(number > 0){
		temp = number % 10;
		number = number / 10;
		reversedNumber = reversedNumber * 10 + temp;

	}

	if(originalNumber == reversedNumber)

	System.out.println(originalNumber + " is a palindrome number");

	else

	System.out.println(originalNumber + " is not a palindrome number");
	}
 }

To check whether a number is palindrome just reverse the number and then match the original and reverse number, if they match, the number is a palindrome.

e.g 1441=1441 so 1441 is a Palinrome.

2345!=5432 so 2345 is not a Palindrome.

Power Function in C

/*

  Program demonstrating Power Function

*/

 

#include<stdio.h>

#include<conio.h>

 

//Power Function Integer Version

int power(int base, int exponent)

{

      int i;

      int result = 1;

     

      for(i=1; i<=exponent; i++)

      {

               result = result * base;

      }

     

      return result; 

}

//Power Function Floating-Point Version

float powerfloat(float base, float exponent)

{

      float i;

      float result = 1.0;

     

      for(i=1; i<=exponent; i++)

      {

               result = result * base;

      }

     

      return result; 

}

 

int main()

{

     int a, b, c;

     a=2;

     b=3;

     printf(“\n ~~~Power Functions C~~~ \n”);

    

     printf(“\n %d to the power %d is %d”, a,b, power(a,b));

    

     printf(“\n 2.0 to the power 4.0 is %f”, powerfloat(2.0, 4.0));

     getch();

     return 0;  

}

Snapshot of the o/p