******************************************************

Decimal to Binary Conversion using C program

#include <stdio.h>

int main()
{
int number,cnt,i;
int bin[32];

printf("Enter decimal number: ");

scanf("%d",&number);

cnt=0; /*initialize index to zero*/

while(number>0)
{
bin[cnt]=number%2;
number=number/2;
cnt++;
}

/*print value in reverse order*/

printf("Binary value is: ");
for(i=(cnt-1); i>=0;i--)
printf("%d",bin[i]);

return 0;
}
******************************************************
Check Perfect Square using C program:
#include <stdio.h>
#include <math.h>

int main()
{
int num;
int iVar;
float fVar;

printf("Enter an integer number: ");

scanf("%d",&num);

fVar=sqrt((double)num);
iVar=fVar;

if(iVar==fVar)
printf("%d is a perfect square.",num);
else
printf("%d is not a perfect square.",num);

return 0;
}
******************************************************
Swapping two Bytes/Words using C program
#include <stdio.h>

int main()
{
unsigned int data=0x1234;
printf("\ndata before swapping : %04X",data);

data= ((data<<8)&0xff00)|((data>>8)&0x00ff);
 printf("\ndata after swapping : %04X",data);

return 0;
}
******************************************************
Print all Leap Years from 1 to N using C program:
#include <stdio.h>

//function to check leap year

int checkLeapYear(int year)
{
if( (year % 400==0)||(year%4==0 && year%100!=0) )
return 1;
else
return 0;
}

int main()
{
int i,n;

printf("Enter the value of N: ");

scanf("%d",&n);

printf("Leap years from 1 to %d:\n",n);

for(i=1;i<=n;i++)
{
if(checkLeapYear(i))
printf("%d\t",i);
}

return 0;
}
******************************************************
Check Armstrong Number using C program:
#include <stdio.h>

int main()
{
int number, sum=0, rem=0,tempNumber;

printf("Enter an integer number: ");

scanf("%d", &number);

tempNumber=number;

while(tempNumber!=0)
{
rem=tempNumber%10;
sum=sum + (rem*rem*rem);
tempNumber/=10;
}

/* checking number is armstrong or not */

if(sum==number)
printf("%d is an Armstrong number.",number);
else
printf("%d is not an Armstrong number.",number);

return 0;
}
******************************************************
Program to multiply two matrices in C language
#include <stdio.h>

#define MAXROW 10
#define MAXCOL 10

/*User Define Function to Read Matrix*/

void readMatrix(int m[][MAXCOL],int row,int col)
{
int i,j;
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
printf("Enter element [%d,%d] : ",i+1,j+1);
scanf("%d",&m[i][j]);
}
}
}

/*User Define Function to Read Matrix*/

void printMatrix(int m[][MAXCOL],int row,int col)
{
int i,j;
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
printf("%d\t",m[i][j]);
}
printf("\n");
}
}

int main()
{
int a[MAXROW][MAXCOL],b[MAXROW][MAXCOL],result[MAXROW][MAXCOL];
int i,j,r1,c1,r2,c2;
int sum,k;

printf("Enter number of Rows of matrix a: ");

scanf("%d",&r1);
printf("Enter number of Cols of matrix a: ");
scanf("%d",&c1);

printf("\nEnter elements of matrix a: \n");

readMatrix(a,r1,c1);

printf("Enter number of Rows of matrix b: ");

scanf("%d",&r2);
printf("Enter number of Cols of matrix b: ");
scanf("%d",&c2);

printf("\nEnter elements of matrix b: \n");

readMatrix(b,r2,c2);
 if(r1==c2)
{
/*Multiplication of two matrices*/
for(i=0;i< r1;i++)
{
for(j=0;j< c1;j++)
{
sum=0;
for(k=0;k< r1;k++)
{
sum=sum + (a[i][k]*b[k][j]);
}
result[i][j]=sum;
}
}

/*print matrix*/
printf("\nMatrix after multiplying elements (result matrix):\n");
printMatrix(result,r1,c1);

}
else
{
printf("\nMultiplication can not be done.");
}

return 0;
}
******************************************************
program to find a number from array elements:
#include<stdio.h>
#define MAX 20

/* function : readArray()
to read array elements.
*/

void readArray(int a[],int size)

{
int i;
for(i=0;i< size;i++)
{
printf("Enter %d element :",i+1);
scanf("%d",&a[i]);
}
}

/* function : findElement(),
to find an item from array elements.
return : -1 for fail,
position to success.
*/
int findElement(int a[],int size,int item)
{
int i,pos=-1;
for(i=0;i< size;i++)
{
 if(a[i]==item)
{
pos=i;
break;
}
}
return pos;
}

int main()
{
int arr[MAX];
int n,item,pos;

printf("\nEnter size of an Array :");

scanf("%d",&n);

printf("\nEnter elements of Array 1:\n");

readArray(arr,n);

printf("Enter an item to find :");

scanf("%d",&item);

pos=findElement(arr,n,item);
if(pos==-1)
printf("\n%d does not exists in array.\n",item);
else
printf("\n%d find @ %d position.\n",item,pos);

printf("\n\n");
return 0;
}
******************************************************
C program to delete given element from one dimensional array:
#include <stdio.h>
#define MAX 100
int main()
{
int arr[MAX],n,i,j;
int num,countDel;

printf("Enter total number of elements: ");

scanf("%d",&n);

//read array elements

printf("Enter array elements:\n");
for(i=0;i< n;i++)
{
printf("Enter element %d: ",i+1);
scanf("%d",&arr[i]);
}

printf("\nEnter number (element) to delete: ");

scanf("%d",&num);

//delete elements
countDel=0;
for(i=0;i< n;i++)
 {
if(arr[i]==num)
{
countDel++;
//shift all other elements up
for(j=i;j< n;j++){
arr[j]=arr[j+1];
}
}
}
if(countDel)
printf("%d found %d times and deleted successfully.",num,countDel);
else
printf("%d not found.",num);

printf("\nArray elements after deleting %d.\n",num);

for(i=0;i<(n-countDel);i++)
{
printf("%d\n",arr[i]);
}
return 0;
}
******************************************************
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int solveMeFirst(int a, int b) {

return a+b;
}
int main() {
int num1, num2;
int sum;
cin>>num1>>num2;
sum = solveMeFirst(num1,num2);
cout<<sum;
return 0;
}
*****************************************************
#include<stdio.h>
int main(){
FILE *fp;
char c;
fp = fopen(__FILE__,"r");

do{
c= getc(fp);
putchar(c);
}

while(c!=EOF);
fclose(fp);
return 0;
}
*****************************************************
#include<stdio.h>
void main(){
if(printf("Hello world")){
 }
}
*****************************************************
Factorial program in c using for loop:
#include<stdio.h>
int main(){
int i,f=1,num;

printf("Enter a number: ");

scanf("%d",&num);

for(i=1;i<=num;i++)
f=f*i;

printf("Factorial of %d is: %d",num,f);

return 0;
}
*****************************************************
Factorial program in c using pointers:
#include<stdio.h>

void findFactorial(int,int *);

int main(){
int i,factorial,num;

printf("Enter a number: ");

scanf("%d",&num);

findFactorial(num,&factorial);
printf("Factorial of %d is: %d",num,*factorial);

return 0;
}

void findFactorial(int num,int *factorial){

int i;

*factorial =1;

for(i=1;i<=num;i++)
*factorial=*factorial*i;
}
*****************************************************
Factorial series in c:
#include<stdio.h>
int main(){
long f=1;
int i,num,min,max;

printf("Enter the minimum range: ");

scanf("%d",&min);

printf("Enter the maximum range: ");

scanf("%d",&max);

printf("Factorial series in given range: ");

for(num=min;num<=max;num++){
f=1;

for(i=1;i<=num;i++)
f=f*i;
 printf("%ld ",f);
}

return 0;
}
*****************************************************
Factorial program in c using function:
#include<stdio.h>

int findFactorial(int);
int main(){
int i,factorial,num;

printf("Enter a number: ");

scanf("%d",&num);

factorial = findFactorial(num);
printf("Factorial of %d is: %d",num,factorial);

return 0;
}

int findFactorial(int num){

int i,f=1;

for(i=1;i<=num;i++)
f=f*i;

return f;
}
*****************************************************
print Fibonacci series in c:
#include<stdio.h>
int main(){

int i,range;
long int arr[40];

printf("Enter the number range: ");

scanf("%d",&range);

arr[0]=0;
arr[1]=1;

for(i=2;i<range;i++){
arr[i] = arr[i-1] + arr[i-2];
}

printf("Fibonacci series is: ");

for(i=0;i<range;i++)
printf("%ld ",arr[i]);

return 0;
}
*****************************************************
Fibonacci series in c using while loop:
#include<stdio.h>
int main(){
int k=2,r;
long int i=0l,j=1,f;
 printf("Enter the number range:");
scanf("%d",&r);

printf("Fibonacci series is: %ld %ld",i,j);

while(k<r){
f=i+j;
i=j;
j=f;
printf(" %ld",j);
k++;
}

return 0;
}
*****************************************************
Sum of Fibonacci series in c:
#include<stdio.h>
int main(){
int k,r;
long int i=0,j=1,f;
long int sum = 1;

printf("Enter the number range: ");

scanf("%d",&r);

for(k=2;k<r;k++){
f=i+j;
i=j;
j=f;
sum = sum + j;
}

printf("Sum of Fibonacci series is: %ld",sum);

return 0;
}
*****************************************************
To print the fibonacci series using recursion:
#include <stdio.h>
#include <conio.h>
unsigned long fib(int);
void main()
{
int n,i;
unsigned long f;
clrscr();
printf("\nENTER A NUMBER: ");
scanf("%d",&n);
printf("\nTHE FIBONNACI SERIES UPTO %d NUMBERS IS:\n",n);
for(i=0;i<n;i++)
{
f=fib(i);
printf("%lu ",f);
}
getch();
}
unsigned long fib(int x)
{
unsigned long res;
 if(x==0)
return(0);
else
if(x==1)
return(1);
else
{
res=fib(x-1)+fib(x-2);
return(res);
}
}
*****************************************************
calculate roots of a quadratic equation:
#include<stdio.h>
#include<math.h>

int main(){
float a,b,c;
float d,root1,root2;

printf("Enter a, b and c of quadratic equation: ");

scanf("%f%f%f",&a,&b,&c);

d = b * b - 4 * a * c;

if(d < 0){

printf("Roots are complex number.\n");

printf("Roots of quadratic equation are: ");

printf("%.3f%+.3fi",-b/(2*a),sqrt(-d)/(2*a));
printf(", %.3f%+.3fi",-b/(2*a),-sqrt(-d)/(2*a));

return 0;
}
else if(d==0){
printf("Both roots are equal.\n");

root1 = -b /(2* a);

printf("Root of quadratic equation is: %.3f ",root1);

return 0;
}
else{
printf("Roots are real numbers.\n");

root1 = ( -b + sqrt(d)) / (2* a);

root2 = ( -b - sqrt(d)) / (2* a);
printf("Roots of quadratic equation are: %.3f , %.3f",root1,root2);
}

return 0;
}
*****************************************************
find a b and c in a quadratic equation:
#include<stdio.h>
#include<math.h>

int main(){
float a,b,c;
float d,root1,root2;
 printf("Enter quadratic equation in the format ax^2+bx+c: ");
scanf("%fx^2%fx%f",&a,&b,&c);

d = b * b - 4 * a * c;

if(d < 0){

printf("Roots are complex number.\n");

return 0;
}

root1 = ( -b + sqrt(d)) / (2* a);

root2 = ( -b - sqrt(d)) / (2* a);
printf("Roots of quadratic equation are: %.3f , %.3f",root1,root2);

return 0;
}
*****************************************************
palindrome Program For String using String function:
#include <stdio.h>
#include <conio.h>
void main() {
char *a;
int i,len,flag=0;
clrscr();
printf("\nENTER A STRING: ");
gets(a);
len=strlen(a);
for (i=0;i<len;i++) {
if(a[i]==a[len-i-1])
flag=flag+1;
}
if(flag==len)
printf("\nTHE STRING IS PALINDROM"); else
printf("\nTHE STRING IS NOT PALINDROM");
getch();
}
*****************************************************
palindrome Program For String without using String function
#include <stdio.h>
#include <string.h>
int main() {
char text[100];
int begin, middle, end, length = 0;
gets(text);
while ( text[length] != '\0' )
length++;
end = length - 1;
middle = length/2;
for ( begin = 0 ; begin < middle ; begin++ ) {
if ( text[begin] != text[end] ) {
printf("Not a palindrome.\n");
break;
}
end--;
}
if( begin == middle )
printf("Palindrome.\n");
return 0;
}
*****************************************************
palindrome Program For Number:
#include<stdio.h>
int main(){
int num,r,sum=0,temp;

printf("Enter a number: ");

scanf("%d",&num);

temp=num;
while(num){
r=num%10;
num=num/10;
sum=sum*10+r;
}
if(temp==sum)
printf("%d is a palindrome",temp);
else
printf("%d is not a palindrome",temp);

return 0;
}
*****************************************************
C Program For find Palindrome numbers in given range
#include
int main(){
int num,r,sum,temp;
int min,max;
printf("Enter the minimum range: ");
scanf("%d",&min);
printf("Enter the maximum range: ");
scanf("%d",&max);
printf("Palindrome numbers in given range are: ");
for(num=min;num<=max;num++){
temp=num;
sum=0;
while(temp){
r=temp%10;
temp=temp/10;
sum=sum*10+r;
}
if(num==sum)
printf("%d ",num);
}
return 0;
}
*****************************************************
palindrome Program For String using loop:
#include<stdio.h>
int main(){
int num,r,sum=0,temp;

printf("Enter a number: ");

scanf("%d",&num);

for(temp=num;num!=0;num=num/10){
r=num%10;
sum=sum*10+r;
}
if(temp==sum)
printf("%d is a palindrome",temp);
 else
printf("%d is not a palindrome",temp);

return 0;
}
*****************************************************
palindrome Program using recursion:
#include<stdio.h>

int checkPalindrome(int);
int main(){
int num,sum;

printf("Enter a number: ");

scanf("%d",&num);

sum = checkPalindrome(num);

if(num==sum)
printf("%d is a palindrome",num);
else
printf("%d is not a palindrome",num);

return 0;
}

int checkPalindrome(int num){

static int sum=0,r;

if(num!=0){
r=num%10;
sum=sum*10+r;
checkPalindrome(num/10);
}

return sum;
}
*****************************************************
palindrome Program using Pointer:
#include <stdio.h>
int is_palindrome(char*);
void copy_string(char*, char*);
void reverse_string(char*);
int string_length(char*);
int compare_string(char*, char*);
int main() {
char string[100];
int result;
printf("Enter a string\n");
gets(string);
result = is_palindrome(string);
if ( result == 1 )
printf("\"%s\" is a palindrome string.\n", string); else
printf("\"%s\" is not a palindrome string.\n", string);
return 0;
}
int is_palindrome(char *string) {
int check, length;
char *reverse;
length = string_length(string);
 reverse = (char*)malloc(length+1);
copy_string(reverse, string);
reverse_string(reverse);
check = compare_string(string, reverse);
free(reverse);
if ( check == 0 )
return 1; else
return 0;
}
int string_length(char *string) {
int length = 0;
while(*string) {
length++;
string++;
}
return length;
}
void copy_string(char *target, char *source) {
while(*source) {
*target = *source;
source++;
target++;
}
*target = '\0';
}
void reverse_string(char *string) {
int length, c;
char *begin, *end, temp;
length = string_length(string);
begin = string;
end = string;
for ( c = 0 ; c < ( length - 1 ) ; c++ )
end++;
for ( c = 0 ; c < length/2 ; c++ ) {
temp = *end;
*end = *begin;
*begin = temp;
begin++;
end--;
}
}
int compare_string(char *first, char *second) {
while(*first==*second) {
if ( *first == '\0' || *second == '\0' )
break;
first++;
second++;
}
if( *first == '\0' && *second == '\0' )
return 0; else
return -1;
}
*****************************************************
Write a c program to check given number is strong number or not:
#include<stdio.h>
int main() {
int num,i,f,r,sum=0,temp;
printf("Enter a number: ");
scanf("%d",&num);
temp=num;
while(num) {
 i=1,f=1;
r=num%10;
while(i<=r) {
f=f*i;
i++;
}
sum=sum+f;
num=num/10;
}
if(sum==temp)
printf("%d is a strong number",temp); else
printf("%d is not a strong number",temp);
return 0;
}
*****************************************************
#include<stdio.h>
int main() {
int num,i,f,r,sum,temp;
int min,max;
printf("Enter minimum range: ");
scanf("%d",&min);
printf("Enter maximum range: ");
scanf("%d",&max);
printf("Strong numbers in given range are: ");
for (num=min; num <= max; num++) {
temp = num;
sum=0;
while(temp) {
i=1;
f=1;
r=temp%10;
while(i<=r) {
f=f*i;
i++;
}
sum=sum+f;
temp=temp/10;
}
if(sum==num)
printf("%d ",num);
}
return 0;
}
*****************************************************
C program to find given number is prime or not:
#include<stdio.h>

int main(){

int num,i,count=0;
printf("Enter a number: ");
scanf("%d",&num);
for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}
if(count==0 && num!= 1)
printf("%d is a prime number",num);
else
 printf("%d is not a prime number",num);
return 0;
}
*****************************************************
Prime number 1-100:
#include<stdio.h>

int main(){
int num,i,count;

for(num = 1;num<=100;num++){
count = 0;

for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}

if(count==0 && num!= 1)

printf("%d ",num);
}

return 0;
}
*****************************************************
#include<stdio.h>

int main(){

int num,i,count,n;
printf("Enter max range: ");
scanf("%d",&n);

for(num = 1;num<=n;num++){

count = 0;

for(i=2;i<=num/2;i++){
if(num%i==0){
count++;
break;
}
}

if(count==0 && num!= 1)

printf("%d ",num);
}

return 0;
}
*****************************************************
Min-max range:prime number;
#include<stdio.h>

int main(){

int num,i,count,min,max;

printf("Enter min range: ");

 scanf("%d",&min);

printf("Enter max range: ");

scanf("%d",&max);

num = min;
while(num<=max){

count = 0;
i=2;

while(i<=num/2){
if(num%i==0){
count++;
break;
}
i++;
}

if(count==0 && num!= 1)

printf("%d ",num);

num++;
}

return 0;
}
*****************************************************
Write a c program to print Pascal triangle
#include<stdio.h>

long fact(int);
int main(){
int line,i,j;

printf("Enter the no. of lines: ");

scanf("%d",&line);

for(i=0;i<line;i++){
for(j=0;j<line-i-1;j++)
printf(" ");

for(j=0;j<=i;j++)
printf("%ld ",fact(i)/(fact(j)*fact(i-j)));
printf("\n");
}
return 0;
}

long fact(int num){

long f=1;
int i=1;
while(i<=num){
f=f*i;
i++;
}
return f;
}
*****************************************************
check given number is perfect number or not:
#include<stdio.h>
int main(){
int n,i=1,sum=0;

printf("Enter a number: ");

scanf("%d",&n);

while(i<n){
if(n%i==0)
sum=sum+i;
i++;
}
if(sum==n)
printf("%d is a perfect number",i);
else
printf("%d is not a perfect number",i);

return 0;
}
*****************************************************
C program to print perfect numbers from 1 to 100:
#include<stdio.h>
int main(){
int n,i,sum;

printf("Perfect numbers are: ");

for(n=1;n<=100;n++){
i=1;
sum = 0;

while(i<n){
if(n%i==0)
sum=sum+i;
i++;
}

if(sum==n)
printf("%d ",n);
}

return 0;
}
*****************************************************
class HelloWorld
{
public static void main(String args[])
{
System.out.println("Hello World");
}
}
---------------------------------------------------------
/ If else in Java code
import java.util.Scanner;

class IfElse {
public static void main(String[] args) {
int marksObtained, passingMarks;

passingMarks = 40;

Scanner input = new Scanner(System.in);

 System.out.println("Input marks scored by you");

marksObtained = input.nextInt();

if (marksObtained >= passingMarks) {

System.out.println("You passed the exam.");
}
else {
System.out.println("Unfortunately, you failed to pass the exam.");
}
}
}
--------------------------------------------------------
//Java for loop program
class ForLoop {
public static void main(String[] args) {
int c;

for (c = 1; c <= 10; c++) {

System.out.println(c);
}
}
}

import java.util.Scanner;

class WhileLoop {
public static void main(String[] args) {
int n;

Scanner input = new Scanner(System.in);

System.out.println("Input an integer");

while ((n = input.nextInt()) != 0) {

System.out.println("You entered " + n);
System.out.println("Input an integer");
}

System.out.println("Out of loop");
}
}

class Alphabets
{
public static void main(String args[])
{
char ch;

for( ch = 'a' ; ch <= 'z' ; ch++ )

System.out.println(ch);
}
}
Printing alphabets using a while loop (Only the body of the main method is
shown):
char c = 'a';

while (c <= 'z') {

System.out.println(c);
c++;
}
Using a do while loop:
char c = 'A';

do {
System.out.println(c);
c++;
} while (c <= 'Z');

import java.util.Scanner;

class GetInputFromUser
{
public static void main(String args[])
{
int a;
float b;
String s;

Scanner in = new Scanner(System.in);

System.out.println("Enter an integer");
a = in.nextInt();
System.out.println("You entered integer "+a);

System.out.println("Enter a float");
b = in.nextFloat();
System.out.println("You entered float "+b);

System.out.println("Enter a string");
s = in.nextLine();
System.out.println("You entered string "+s);
}
}

import java.util.Scanner;

class MultiplicationTable
{
public static void main(String args[])
{
int n, c;
System.out.println("Enter an integer to print it's multiplication
table");
Scanner in = new Scanner(System.in);
n = in.nextInt();
System.out.println("Multiplication table of "+n+" is :-");

for ( c = 1 ; c <= 10 ; c++ )

System.out.println(n+"*"+c+" = "+(n*c));
}
}

import java.util.Scanner;

class OddOrEven
{
public static void main(String args[])
{
int x;
 System.out.println("Enter an integer to check if it is odd or even
");
Scanner in = new Scanner(System.in);
x = in.nextInt();

if ( x % 2 == 0 )
System.out.println("You entered an even number.");
else
System.out.println("You entered an odd number.");
}
}

Swapping using temporary or third variable

import java.util.Scanner;

class SwapNumbers
{
public static void main(String args[])
{
int x, y, temp;
System.out.println("Enter x and y");
Scanner in = new Scanner(System.in);

x = in.nextInt();
y = in.nextInt();

System.out.println("Before Swapping\nx = "+x+"\ny = "+y);

temp = x;
x = y;
y = temp;

System.out.println("After Swapping\nx = "+x+"\ny = "+y);

}
}

Swapping without temporary variable

import java.util.Scanner;

class SwapNumbers
{
public static void main(String args[])
{
int x, y;
System.out.println("Enter x and y");
Scanner in = new Scanner(System.in);

x = in.nextInt();
y = in.nextInt();

System.out.println("Before Swapping\nx = "+x+"\ny = "+y);

x = x + y;
y = x - y;
x = x - y;

System.out.println("After Swapping\nx = "+x+"\ny = "+y);

}
}
import java.util.Scanner;

class Factorial
{
public static void main(String args[])
{
int n, c, fact = 1;

System.out.println("Enter an integer to calculate it's factorial");

Scanner in = new Scanner(System.in);

n = in.nextInt();

if (n < 0)
System.out.println("Number should be non-negative.");
else
{
for (c = 1; c <= n; c++)
fact = fact*c;

System.out.println("Factorial of "+n+" is = "+fact);

}
}
}

import java.util.Scanner;

class ArmstrongNumber
{
public static void main(String args[])
{
int n, sum = 0, temp, remainder, digits = 0;

Scanner in = new Scanner(System.in);

System.out.println("Input a number to check if it is an Armstrong
number");
n = in.nextInt();

temp = n;

// Count number of digits

while (temp != 0) {
digits++;
temp = temp/10;
}

temp = n;

while (temp != 0) {
remainder = temp%10;
sum = sum + power(remainder, digits);
temp = temp/10;
}

if (n == sum)
System.out.println(n + " is an Armstrong number.");
else
System.out.println(n + " isn't an Armstrong number.");
}
 static int power(int n, int r) {
int c, p = 1;

for (c = 1; c <= r; c++)

p = p*n;

return p;
}
}

import java.util.*;

class ReverseString
{
public static void main(String args[])
{
String original, reverse = "";
Scanner in = new Scanner(System.in);

System.out.println("Enter a string to reverse");

original = in.nextLine();

int length = original.length();

for ( int i = length - 1 ; i >= 0 ; i-- )

reverse = reverse + original.charAt(i);

System.out.println("Reverse of entered string is: "+reverse);

}
}

import java.util.*;

class Palindrome
{
public static void main(String args[])
{
String original, reverse = ""; // Objects of String class
Scanner in = new Scanner(System.in);

System.out.println("Enter a string to check if it is a palindrome");

original = in.nextLine();

int length = original.length();

for ( int i = length - 1; i >= 0; i-- )

reverse = reverse + original.charAt(i);

if (original.equals(reverse))
System.out.println("Entered string is a palindrome.");
else
System.out.println("Entered string isn't a palindrome.");

}
}

import java.util.Scanner;
class ReverseNumber
{
public static void main(String args[])
{
int n, reverse = 0;

System.out.println("Enter a number to reverse");

Scanner in = new Scanner(System.in);
n = in.nextInt();

while(n != 0)
{
reverse = reverse * 10;
reverse = reverse + n%10;
n = n/10;
}

System.out.println("Reverse of the number is " + reverse);

}
}

To find Strong Number

import java.util.scanner;
public class strongnumber
{
public static void
main(string args[])
{
strongnumber ss=new
strongnumber();
int a,b,r,s=0;
scanner sl=new scanner(system.in);
system.out.println(“Enter a number”);
b=sl.nextInt();
a=b;
while(b>0)
{
r=b%10;
s=s+ss.fact(r);
b=b/10;
}
if(a==s)
system.out.println(a+” is a stong number);
else
system.out.println(a+”is not a strong number);
}
int fact(int i)
{
int f,j;
f=1;
for(j=i;j>0;j--)
f=f*j;
return f;
}
}
GCD of Two Numbers:
import java.util.P;
public class gcdoftwonumbers
{
public static void
main(string args[])
{
int a,b,gcd;
a=b=gcd=0;
scanner s=new scanner(system.in);
system.out.println(“enter two num);
a=s.nextInt();
b=s.next.Int();
while(a!=0)
{
gcd=a;
a=b%a;
b=gcd;
}
system.out.println(“GCD”+gcd);
}
}