EXPERIMENT NO 5

WRITE A PROGRAM TO CHECK WHETHER A NUMBER IS ARMSTRONG NUMBER OR NOT

AIM
TO CHECK WHETHER THE GIVEN NUMBER IS ARMSTRONG NUMBER OR NOT

ALOGRITHM
STEP 1 - START

STEP 2 - INUPUT A NUMBER STORE IN num

STEP 3 – INITIALIZE sum=0 ,temp=num and temp2=num

STEP 4 – FIND THE NUMBER OF DIGITS

STEP 5 – REPEAT UNTIL temp2>0

STEP 6 – digit = temp%10

STEP 7 – SUM = SUM + POW(digit,n)

STEP 8-- temp=temp/10

STEP 9 – IF (sum== temp2)

STEP 10 – DISPLAY “GIVEN NUMBER IS AMSTRONG NUMBER”

STEP 11 – ELSE

STEP12—DISPLAY “GIVEN NUMBER IS NOT AMSTRONG NUMBER”

STEP 13 -- STOP
PROGRAM

OUTPUT
RESULT
THE PROGRAM HAS BEEN EXECUTED SUCCESSFULLY AND THE OUTPUT IS VERIFIED

EXPERIMENT NO 6
WRITE A PROGRAM TO CHECK WHETHER A NUMBER IS PRIME NUMBER OR NOT

AIM
TO CHECK WHETHER A NUMBER IS PRIME NUMBER OR NOT

ALGORITHM
STEP 1—START

STEP 2—TAKE THE VALUE IN num

STEP 3 – COPY THE VALUE IN temp

STEP 4-- i=2

STEP 5 – REPEAT THE STEP 5 TO 7 UNTIL i< temp

STEP 6—IF ((num%i)==0) THEN k=1

STEP 7 – AFTER INCREMENTING i BY ONE GO TO STEP 5

STEP 8 -- IF k==1 THEN DISPLAY “ THE GIVEN NUMBER IS PRIME NUMBER

STEP 9— ELSE DISPLAY “THE GIVEN NUMBER IS NOT PRIME NUMBER”

STEP 10—STOP
PROGRAM

OUTPUT
RESULT
THE PROGRAM HAS BEEN EXECUTED SUCCESSFULLY AND THE OUTPUT IS VERIFIED