Notes

//fibonacci
DECLARE
A NUMBER(2):=-1;
B NUMBER(2):=1;
C NUMBER(2);
N NUMBER(2);
I NUMBER(2);
BEGIN
N:=&NO.OF ITERATION;
FOR I IN 1..N
LOOP
C:=A+B;
DBMS_OUTPUT.PUT_LINE (C) ;
A:=B;
B:=C;
END LOOP;
END;











//LCM AND HCF
DECLARE
A NUMBER (3);
B NUMBER(3);
L NUMBER(3);
G NUMBER(3);
I NUMBER(3);
BEGIN
A:=&FIRSTVALUE;
B:=&SECONDVALUE;
--CALCULATING LCM
L=A*B;
IF A>B THEN
G:=A;
ELSE
G:=B;
END IF;
FOR I IN G..L
LOOP
IF MOD(I,A)=0 AND MOD (I,B)=0 THEN
DBMS_OUTPUT.PUT_LINE(‘LCM IS’||I);
EXIT;
END IF;
END LOOP;
--CALCULATING HCF/GCD
G:=MOD(A,B)
WHILE G<>0
A:=B;
B:=G;
G:=MOD(A,B);
END LOOP;
DBMS_OUTPUT.PUT_LINE(‘GCD IS’||B);
END;

//REVERSE OF A NUMBER
DECLARE
A NUMBER(2);
I NUMBER(2);
R NUMBER(2):=0;
BEGIN
A:=&VALUE;
WHILE A>0
LOOP
I:=MOD(A,10);
R:=R*10+I;
I:=I/10;
END LOOP;
DBMS_OUTPUT.PUT_LINE(‘REVERSE=’||R);
END;


//A NUMBER IS PRIME OR NOT
DECLARE
I NUMBER(2):=0;
B NUMBER(2):=0;
FLAG NUMBER(2):=0;
N NUMBER(2);
BEGIN
N:=&N;
B:=N-1;
FOR I IN 2..B
LOOP
IF(MOD(N,I)=0) THEN
FLAG:=1;
EXIT;
END IF;
END LOOP;
IF(&FLAG=0) THEN
DBMS_OUTPUT.PUT_LINE(‘NO IS PRIME’);
ELSE
DBMS_OUTPUT.PUT_LINE(‘NO IS NOT PRIME’);
END IF;
END