Bachelor of Technology in Information Technology

ALGORITHM:

Step 1: Start.
Step 2: declare n, n1, and rev = 0, rem Step 3: print enter an integer.
Step 4: read n.
Step 5: n1 = n.
Step 6: while (n > 0) { rem = n % 10
rev = rev * 10 + rem n = n / 10
Step 7: if (n1 == rev)
Print number is palindrome.

Step 8: else

Step 9: Stop.

Print number is not palindrome.

SOURCE CODE:

#include

int main()
{
int n, n1, rev = 0, rem;

printf("Enter any number: "); scanf("%d", &n);

n1 = n;

/* logic */ while (n > 0){ rem = n % 10;

rev = rev * 10 + rem; n = n / 10;
}

if (n1 == rev){

printf("%d is a palindrome.", rev);
}
else{
printf("%d is not a palindrome.", rev);
}
return 0;
}

4. C program to find the GCD/LCM of two given integers ALGORITHM:

Step 1: Start.
Step 2: Step 3: print enter two integers. Step 4: read n1, n2.
Step 5: x=n1
y=n2
Step 6: while ( n1≠n2) Step 7: if(n1>n2)
n1 ← n1-n2 n2←n2-n1
Step 8: gcd← n1
Step 9: lcm ← (x*y)/gcd
Step 10: Print gcd is Greatest common divisor. Step 11: print lcm is Least common multiplier. Step 12: Stop.

SOURCE CODE:

#include

int main()
{

int n1,n2,x,y,gcd,lcm; printf("Enter two numbers:\n"); scanf("%d%d",&n1,&n2);

x=n1; y=n2;
while(n1!=n2)
{
if(n1>n2)
{
n1=n1-n2;
}
else
{
n2=n2-n1;
}
}
gcd=n1; lcm=(x*y)/gcd;
printf("Greatest common divisor=%d\n",gcd); printf("Least commom multiple=%d",lcm);
return 0;
}
------------------------------*-----------OUTPUT----------------*------------------------

5.