1.

include <iostream>
2.#include <stdio.h>
3.#include <conio.h>
4.using namespace std;
5.struct node
6.{
7. int data;
8. node *next;
9.}*top = NULL, *p = NULL, *np = NULL;
10. int x;
11. void push(int n)
12. {
13. np = new node;
14. np->data = n;
15. np->next = NULL;
16. if (top == NULL)
17. {
18. top = np;
19. }
20. else
21. {
22. np->next = top;
23. top = np;
24. }
25. }
26. int pop()
27. {
28. if (top == NULL)
29. {
30. cout<<"underflow\n";
31. }
32. else
33. {
34. p = top;
35. top = top->next;
36. x = p->data;
37. delete(p);
38. return(x);
39. }
40. }
41. int main()
42. {
43. int n, a;
44. cout<<"enter the decimal number\n";
45. cin>>n;
46. while (n > 0)
47. {
48. a = n % 2;
49. n = n / 2;
50. push(a);
51. }
52. p = top;
53. cout<<"resultant binary no:";
54. while(true)
55. {
56. if (top != NULL)
57. cout<<pop()<<"\t";
58. else
59. break;
 60. }
61. getch();
62. }

MAKENULL (S) # krijimi i stives

    while n > 1:

push(n)

n -= 1 # dikrementim i n me 1

result = 1; #inicializim

    while NOT EMPTY(S):

n = pop(S);

result *= n # shumezohet rezultati me n

    return result

MAKENULL (S1)
WHILE (NOT EMPTY (S)
DO BEGIN
Z=POP(TOP(S))
PUSH (Z, S1)
PUSH (X, S1)
Y=POP(S)
PUSH (Y,S1)
END;
WHILE NOT EMPTY (S1) DO
BEGIN
A=POP(S1)
PUSH (A,S)
END;

MAKENULL (S1)
WHILE (NOT EMPTY (S))
DO BEGIN
Z=POP(S)
PUSH (Z, S1)
End;
WHILE (NOT EMPTY (S1)
DO BEGIN
y=POP(TOP(S))
PUSH (y, S)
PUSH (X, S)
a=POP(S1)
PUSH (a,S)

end;

MAKENULL (S1)
WHILE (NOT EMPTY (S))
DO BEGIN
y=POP(S)
PUSH (y, S1)
PUSH (X,S1)
End;
WHILE (NOT EMPTY (S1)
DO BEGIN
Z=POP(S1)
PUSH (Z,S)

end;

MAKENULL (S1)
WHILE (NOT EMPTY (S))
DO BEGIN
WHILE TOP(S)!=X
{ Y= POP(TOP(S))
PUSH ( Y, S1) }
END;
WHILE NOT EMPTY (S1)
DO BEGIN
Z=POP (S1)
PUSH (Z,S1)
END;

If (eliri == NULL) then

write (‘ ‘ error’ ‘ )

Else
read (x)
eliri.^element← x;
eliri.^para ← NULL;
eliri.^pas← sh;
sh.^para ← eliri;
End
 If (sh != NULL) then

new (newNode)

read (x)

newNode.^element ← x;

newNode.^pas ← sh.^pas;

newNode.^para ← sh;

If (sh.^pas != NULL) then

Sh.^pas.^para ← newNode;

Sh.^pas← newNode;

write('Node added successfully')

End

KRIJOPOLINOM(L1), KRIJOPOLINOM(L2)

f1:=L1^.fuqi
f2:=L2^.fuqi
k1:=L1^.koeficient
k2:=L2^.koeficient

if f1>f2
writeln (‘polinomi 1 eshte me i madh)
else if f1<f2
writeln (‘polinomi 2 eshte me i madh)
else if f2=f1
then if k1>k2
writeln (‘polinomi 1 eshte me i madh)
else writeln (‘polinomi 2 eshte me i madh)
else if k1=k2
repeat
f1:=f1^.pas, f2:=f2^.pas, k1:=k1^.pas, k2:=k2^pas
until f1<>NIL, f2<>NIL
end;
READ (J)
MAXSUM=-999
R=-1;
SHUMA:=0;
FOR I:=1 TO N DO
WHILE V[I]<>NIL
SHUMA+=V[I][J]
WITH V[I]^ DO
IF (SHUMA>MAXSUM)
MAXSUM:=SHUMA;
R:=I;
V[I]:=V[I]^.PAS;
RETURN MAXSUM;
END;

NEW (ELIRI) //KRIJOHET ELEMENTI I RI

ELIRI^.ELEMENT:=X; //I JEPET VLERA PERKATESE
ELIRI^.PARA:=SH; //SH SHENJON MBI ELEMENTIN
PARA ELEMENTIT QE DO TE VENDOSET
ELIRI^.PAS:=SH^.PAS;
SH^.PAS^.PARA:=ELIRI;
SH^.PAS:=ELIRI;

KRIJOPOLINOM(L1), KRIJOPOLINOM(L2)
F1:=L1^.FUQI; F2:=L2^.FUQI; K1:=L1^.KOEFICIENT;
K2:=L2^.KOEFICIENT
  IF F1>F2
     WRITELN (‘POLINOMI 1 ESHTE ME I MADH)
  ELSE IF F1<F2
        WRITELN (‘POLINOMI 2 ESHTE ME I MADH)
  ELSE IF F2=F1
  THEN IF K1>K2
  WRITELN (‘POLINOMI 1 ESHTE ME I MADH)
  ELSE   WRITELN (‘POLINOMI 2 ESHTE ME I MADH)
  ELSE IF K1=K2
REPEAT
F1:=F1^.PAS, F2:=F2^.PAS, K1:=K1^.PAS, K2:=K2^PAS
UNTIL F1<>NIL, F2<>NIL
WRITELN (‘VENDOS NUMER DECIMAL’)
READ (N);
WHILE (N!=0)
{   IF (!FULL(S))
NEW (A)
A=N%2;
N=N/2;
PUSH(A,S)   }
P=TOP(S);
WRITELN(‘NUMRI NE BINAR ESHTE’)
IF (TOP!=NULL)
POP(A,S);

MAKENULL (S) # KRIJIMI I STIVES

WHILE N > 1:
     PUSH(N)
     N -= 1      # DIKREMENTIM I N ME 1
RESULT = 1;         #INICIALIZIM
    WHILE NOT EMPTY(S):
     N = POP(S);
     RESULT *= N # SHUMEZOHET REZULTATI ME N
    RETURN RESULT