Senin, 28 Desember 2009

Penjumlahan Matriks

#include

main()

{

int M1[2][2],M2[2][2],M3[2][2],i,j,k,l,a,b,c,d;

puts("Program Penjumlahan Matriks");

puts("===========================");

for(i=0;i<2;i++)

{

for(j=0;j<2;j++)

{

printf("Masukkan matrik 1[%d][%d]= ",i+1,j+1);

scanf("%d",&M1[i][j]);

}

}

printf("\n");

for(k=0;k<2;k++)

{

for(l=0;l<2;l++)

{

printf("Masukkan matrik 2[%d][%d]= ",k+1,l+1);

scanf("%d",&M2[k][l]);

M3[k][l]=M1[k][l]+M2[k][l];

}

}

printf("\n");

for(a=0;a<2;a++)

{

for(b=0;b<2;b++)

{

printf("%3d",M1[a][b]);

}

printf("\t");

for(c=0;c<2;c++)

{

printf("%3d",M2[a][c]);

}

printf("\t");

for(d=0;d<2;d++)

{

printf("%3d",M3[a][d]);

}

printf("\n");

}

printf("\n");

}

Perkalian Matriks

#include

main()

{

int M1[2][3],M2[3][2],M3[2][2];

int i,j,k,l,m,n,a,b,c,d,hsl;

puts("Program Perkalian Matriks");

puts("=========================");

for(i=0;i<2;i++)

{

for(j=0;j<3;j++)

{

printf("Masukkan Matrik 1 [%d][%d]= ",i+1,j+1);

scanf("%d",&M1[i][j]);

}

}

printf("\n");

for(k=0;k<3;k++)

{

for(l=0;l<2;l++)

{

printf("Masukkan Matrik 2 [%d][%d]= ",k+1,l+1);

scanf("%d",&M2[k][l]);

}

}

printf("\n");

for(m=0;m<2;m++)

{

for(n=0;n<2;n++)

{

hsl=0;

for(a=0;a<3;a++)

{

d=M1[m][a]*M2[a][n];

hsl=hsl+d;

}

M3[m][n]=d;

}

}

for(b=0;b<2;b++)

{

for(c=0;c<2;c++)

{

printf("%4d",M3[b][c]);

}

printf("\n");

}

printf("\n");

}



Program Bilangan Prima

#include

main()

{

int n,i,fak=0;

puts("Program Menunjukkan Bilangan Prima");

puts("==================================");

printf("Silahkan Masukkan Bilangan = ");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

if(n%i==0)

{

fak=fak+1;

}

}

printf("Bilangan : ");

if(fak==2)

printf("%d adalah bilangan prima\n",n);

else

printf("\n%d bukan bilangan prima\n\n\n",n);

}



LISTING DAY 13

Program Biner Desimal

#include

#include

main()

{

int bin,b=0,c=0,d,i,j;

double z=0;

int y[8];

puts("Program Konversi Biner ke Desimal");

puts("=================================");

do

{

printf("Masukkan biner= ");

scanf("%d",&bin);

}while(bin>11111111);

for(i=0;;i++)

{

if(bin==1)

{

y[i]=bin;

c=1;

break;

}

if(bin>=10)

{

y[i]=bin%10;

b=b+1;

}

bin=bin/10;

if(bin<10)

{

y[i+1]=bin;

c=c+1;

break;

}

}

d=b+c;

for(j=0;j

{

if(y[j]==0)

continue;

if(y[j]==1)

{

z=z+pow(2,j);

}

}

printf("Bilangan Desimalnya :");

printf("%.0f\n",z);

}

Biner Desimal

#include

#define MAKS 100

main()

{

int x[MAKS],y,a=0,z,des;

puts("Program Konversi Desimal ke Biner");

puts("=================================");

do

{

printf("Masukkan bilangan desimal= ");

scanf("%d",&des);

}while(des>255);

for(y=0;x[MAKS];y++)

{

x[y]=des%2;

a=a+1;

des=des/2;

if(des<=0)

break;

}

printf("Bilangan Binernya :");

for(z=a-1;z>=0;z--)

{

printf("%d",x[z]);

}

printf("\n");

}

Fibonacci

#include

main()

{

int fib1=1,fib2=1,x,y,z;

puts("Program Deret Fibonacci");

puts("=======================");

printf("Masukkan banyaknya deret fibonacci= ");

scanf("%d",&x);

printf("%5d",fib1);

printf("%5d",fib2);

for(y=3;y<=x;y++)

{

z=fib1+fib2;

printf("%5d",z);

fib1=fib2;

fib2=z;

}

printf("\n");

}


FLOW CHART DAY 13

BINER KE DESIMAL


DESIMAL KE BINER


FIBONANCI

FLOWCHART DAY 11


PALINDROM



MEMBALIK BILANGAN


MEMBALIK KALIMAT



MEMILAH ANGKA



FLOWCHART DAY 14

"PERKALIAN MATRIK"

"PENJUMLAHAN MATRIK"


"BILANGAN PRIMA"
DAY 14
OUTPUT





DAY 13
OUTPUT