Dah lama gak edit postingan nih :D
untuk kali ini K akan kasih tutorial tentang if else di matlab.
nah langsung aja ke TKP
clear all;// DELETE ALL VARIABEL
clc;// CLEAR CONSOLE
Friday, December 9, 2011
Wednesday, November 9, 2011
the secret of shalat
Shalat is one of responsibility that the Muslim must done five times in each day
so many people in the world who said that they are Muslim but do not do it properly, and maybe they don't know what's the essence of shalat.
1. with shalat we can try to be discipline in our life, because the time of shalat was already decided by our god
2. Salat can make us helathy :
- When we stand in our shalat, it'll help us straighten our backbone
- In Rukuk (bow down position in shalat), it'll help us pull the backbone, so it can make our nerve loosen, and relaxing it.
- kneeling (Sujud) : this position will make all of our muscle contracting, that also make it stronger, and healthier, and also make our blood blood vessel and our lymph got massage. this position also help our heart, and prevent our blood vessel from shrinking
and there are a lot of thing then that thing that I write above..
that's just some of it..
so lets shalat
package koderekursi;
import java.util.Scanner;
public class rekursi{
public static long faktorial (int n){
if ((n!=1)&& (n!=0))
return (n*faktorial(n-1));
else
{
return (1);
}
}
public static void main(String[] args) {
int n;
Scanner input=new Scanner (System.in);
System.out.print("masukkan bilangannya :");
n=input.nextInt();
System.out.print("hasil faktorial :"+faktorial (n)+"\n");
}
}
in the code below, we'll make a factorial method in java using "rekursi" i don't how to say it in english hehehe :P
we can see on the class below, that it used method to call the value of n,
method if.... return means that the value of n, will be multiplied as long as the value of n not 0 or 1, when it reach 1, then the loop will stop.
Monday, November 7, 2011
Program Quick Sort
public class Main {
public static void main(String a[]){
int i;
int array[] = {7,1,5,4,13,11};
quick_srt(array,0,array.length-1);
System.out.print("nilai yang telah disusun");
for(i = 0; i <array.length; i++)
System.out.print(array[i]+" ")
}
public static void quick_srt(int array[],int bag_kiri, int bag_kanan){
int i = bag_kiri;
int j = bag_kanan;
if (i >= j) {
return;
}
int pivot = array[(i + j) / 2];
while (i < j)
{
while (i<j && array[i] < pivot) {
i++;
}
while (i<j && array[j] > pivot) {
j--;
}
if (i < j) {
int T = array[i];
array[i] = array[j];
array[j] = T;
}
}
if (i < j) {
int T = j;
j = i;
i = T;
}
quick_srt(array, bag_kiri, i);
quick_srt(array, i == bag_kiri ? i+1 : i, bag_kanan);
}
}
Friday, July 8, 2011
koding list converter bilangan bahasa C
//Program for Binary, Octal, Hexadecimal Conversions
/*
*Program for Binary, Octal, Hexadecimal Conversions
*
Created on March 25, 2009
*/
#include
#include
#include
#include
void bd();
void db();
void doc();
void dh();
void od();
void ob();
void bo();
void bh();
void hb();
void hd();
void oh();
void ho();
void main()
{
int n;
char c;
begin:
clrscr();
printf("\n\n @@ ## ~~ MAIN MENU ~~ ## @@\n\n ");
printf("\nPlease Enter y0ur ch0ise..!!(1-12) ");
printf("\n 1. Binary to Decimal. ");
printf("\n 2. Decimal to Binary. ");
printf("\n 3. Decimal to Octal. ");
printf("\n 4. Decimal to Hexadecimal. ");
printf("\n 5. Octal to Decimal. ");
printf("\n 6. Octal to Binary. ");
printf("\n 7. Binary to Octal. ");
printf("\n 8. Binary to Hexadecimal. ");
printf("\n 9. Hexadecimal to Binary. ");
printf("\n 10. Hexadecimal to Decimal. ");
printf("\n 11. Octal to Hexadecimal. ");
printf("\n 12. Hexadecimal to Octal. ");
printf("\n\n");
printf("Ch00se ConVersi0n fr0m...t0...(1-12):\n");
scanf("%d",& n);
if(n<1 || n>12)
printf("\n\n ");
printf("\n\nInvalid Choise ");
if(n==1)
bd();
else if(n==2)
db();
else if(n==3)
doc();
else if(n==4)
{
long a;
clrscr();
printf("\n\n");
printf("Conversion from Decimal to Hexadecimal ");
printf("\n");
printf(" Enter the decimal number...!!! ");
printf("\n\n\t");
scanf("%ld",&a);
printf("\n\n");
//dh(a);
}
else if(n==5)
od();
else if(n==6)
ob();
else if(n==7)
bo();
else if(n==8)
bh();
else if(n==9)
hb();
else if(n==10)
hd();
else if(n==11)
{
unsigned long n,i=0,a,p=1,t=0;
clrscr();
printf("\n\n");
printf("Conversion from Octal to Hexadecimal. ");
printf("\n");
printf(" Enter a Octal number...!!! ");
printf("\n\n\t");
scanf("%ld",&n);
printf("\n\n");
i=0;
while(n!=0)
{
a=n%10;
if(a>7)
t=1;
n=n/10;
i=i+a*p;
p=p*8;
}
if(t==1)
{
printf(" Hexadecimal eq= ");
//oh(i);
}
else if(t==0)
printf(" Numbert entered is not octal. ");
}
else if(n==12)
ho();
printf("\n\n\n");
printf(" Do you Wish to continue???..(Y/N) ");
printf("\n\t\t");
scanf("%s",&c);
c=toupper(c);
if(c=='Y')
goto begin;
getch();
}
void bd()
{
int n,b=0,a[6],i=0,t=0;
clrscr();
printf("\n\n");
printf("Conversion from Binary to Decimal. ");
printf("\n");
printf(" Enter Binary Number...!!! ");
printf("\n\n\t");
scanf("%d",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%10;
n=n/10;
if(a[i]!=1 && a[i]!=0)
t=1;
i++;
}
a[i]=2;
n=1;
for(i=0;a[i]!=2;i++)
{
b=b+a[i]*n;
n=n*2;
}
if(t==0)
printf(" Decimal Equivalent=%d",b);
else if(t==1)
printf("\n\n");
printf("\nEntered number is not binary.");
}
void db()
{
int dec,bin,n,i=0,a[10];
clrscr();
printf("\n\n");
printf("Conversion from Decimal to Binary. ");
printf("\n");
printf(" Enter decimal number...!!!");
printf("\n\n\t");
scanf("%d",&dec);
printf("\n\n ");
do
{
a[i]=dec%2;
dec=dec/2;
i++;
}
while(dec!=0);
for(n=i-1;n>=0;n--)
printf("%d",a[n]);
}
void doc()
{
int n,i,a[10];
clrscr();
printf("\n\n");
printf("Conversion from Decimal to Octal. ");
printf("\n");
printf(" Enter a Decimal number...!!! ");
printf("\n\n\t");
scanf("%d",&n);
printf("\n\n");
i=0;
printf(" Octal equivalent of %d is ",n);
while(n!=0)
{
a[i]=n%8;
n=n/8;
i++;
}
i--;
for(;i>=0;i--)
printf("%d",a[i]);
}
void dh(long n)
{
long i;
if(n>0)
{
i=n%16;
n=n/16;
dh(n);
if(i>=10)
{
switch(i)
{
case 10:
printf("A");
break;
case 11:
printf("B");
break;
case 12:
printf("C");
break;
case 13:
printf("D");
break;
case 14:
printf("E");
break;
case 15:
printf("F");
break;
}
}
else
printf("\n\n");
printf("%ld",i);
}
}
void od()
{
unsigned long n,i=0,a,p=1,t=0;
clrscr();
printf("\n\n");
printf("Conversion from Octal to Decimal. ");
printf("\n");
printf(" Enter a Octal number...!!! ");
printf("\n\n\t");
scanf("%ld",&n);
printf("\n\n");
i=0;
printf(" Decimal equivalent of %ld is ",n);
while(n!=0)
{
a=n%10;
if(a>7)
t=1;
n=n/10;
i=i+a*p;
p=p*8;
}
if(t==0)
printf("=%ld",i);
else if(t==1)
printf("\n");
printf("\n Can't be calculated,,!!!\nBecause it is not an Octal Number. \n");
}
void ob()
{
int n,a[6],i=0,t=0;
clrscr();
printf("\n\n");
printf("Convertion from Octal to Binary. ");
printf("\n");
printf(" Enter an Octal Number...!!! ");
printf("\n\n\t");
scanf("%d",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%10;
n=n/10;
if(a[i]>7)
t=1;
i++;
}
i--;
if(t==0)
for(;i>=0;i--)
{
switch(a[i])
{
case 0:
printf("000");
break;
case 1:
printf("001");
break;
case 2:
printf("010");
break;
case 3:
printf("011");
break;
case 4:
printf("100");
break;
case 5:
printf("101");
break;
case 6:
printf("110");
break;
case 7:
printf("111");
break;
}
}
if(t==1)
printf(" Not a Octal number!!!\n");
}
void bo()
{
int i=0,a[5],t=0;
long int n;
clrscr();
printf("\n\n");
printf("Convertion From Binary to Octal. ");
printf("\n");
printf("Enter a Binary number...!!! ");
printf("\n\n\t");
scanf("%ld",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%1000;
n=n/1000;
if(a[i]>111)
t=1;
i++;
}
i--;
if(t==0)
for(;i>=0;i--)
{
switch(a[i])
{
case 0:
printf("0");
break;
case 1:
printf("1");
break;
case 10:
printf("2");
break;
case 11:
printf("3");
break;
case 100:
printf("4");
break;
case 101:
printf("5");
break;
case 110:
printf("6");
break;
case 111:
printf("7");
break;
default:
printf(" Entered number is not binary.\nPrinted value is not correct. ");
break;
}
}
if(t==1)
printf("Number is not Binary!!! ");
}
void bh()
{
int i=0,a[5],t=0;
long int n;
clrscr();
printf("\n\n");
printf("Convertion from Binary to Hexadecimal. ");
printf("\n");
printf(" Enter a Binary number...!!! ");
printf("\n\n\t");
scanf("\t%ld",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%10000;
n=n/10000;
if(a[i]>1111)
t=1;
i++;
}
i--;
if(t==0)
for(;i>=0;i--)
{
switch(a[i])
{
case 0:
printf("0");
break;
case 1:
printf("1");
break;
case 10:
printf("2");
break;
case 11:
printf("3");
break;
case 100:
printf("4");
break;
case 101:
printf("5");
break;
case 110:
printf("6");
break;
case 111:
printf("7");
break;
case 1000:
printf("8");
break;
case 1001:
printf("9");
break;
case 1010:
printf("A");
break;
case 1011:
printf("B");
break;
case 1100:
printf("C");
break;
case 1101:
printf("D");
break;
case 1110:
printf("E");
break;
case 1111:
printf("F");
break;
default:
printf(" Entered number is not binary.\n Printed value is not correct.\n");
break;
}
}
if(t==1)
printf("\nNumber is not Binary\n");
}
void hb()
{
int i;
char s[20];
clrscr();
printf("\n\n");
printf("Convertion from Hexadecimal to Binary.");
printf("\n");
printf(" Enter a Hexadecimal number...!!!");
printf("\n\n\t");
scanf("%s",s);
printf("\n\n");
//gets(s);
printf(" Binary Equivalent=");
for(i=0;s[i]!=NULL;i++)
{
switch(s[i])
{
case '0':
printf("0000");
break;
case '1':
printf("0001");
break;
case '2':
printf("0010");
break;
case '3':
printf("0011");
break;
case '4':
printf("0100");
break;
case '5':
printf("0101");
break;
case '6':
printf("0110");
break;
case '7':
printf("0111");
break;
case '8':
printf("1000");
break;
case '9':
printf("1001");
break;
case 'a':
case 'A':
printf("1010");
break;
case 'b':
case 'B':
printf("1011");
break;
case 'c':
case 'C':
printf("1100");
break;
case 'd':
case 'D':
printf("1101");
break;
case 'e':
case 'E':
printf("1110");
break;
case 'f':
case 'F':
printf("1111");
break;
default:
printf(" Entered number is not Hexadecimal.\Printed value is not correct.\n");
break;
}
}
}
void hd()
{
int i,a[20];
unsigned long int h=0,m=1;
char s[20];
clrscr();
printf("\n\n");
printf("Convertion from Hexadecimal to Decimal.");
printf("\n");
printf(" Enter a Hexadecimal number...!!!");
printf("\n\n\t");
scanf("%s",s);
printf("\n\n");
printf(" Decimal Equivalent= ");
for(i=0;s[i]!=NULL;i++)
{
switch(s[i])
{
case '0':
a[i]=0;
break;
case '1':
a[i]=1;
break;
case '2':
a[i]=2;
break;
case '3':
a[i]=3;
break;
case '4':
a[i]=4;
break;
case '5':
a[i]=5;
break;
case '6':
a[i]=6;
break;
case '7':
a[i]=7;
break;
case '8':
a[i]=8;
break;
case '9':
a[i]=9;
break;
case 'a':
case 'A':
a[i]=10;
break;
case 'b':
case 'B':
a[i]=11;
break;
case 'c':
case 'C':
a[i]=12;
break;
case 'd':
case 'D':
a[i]=13;
break;
case 'e':
case 'E':
a[i]=14;
break;
case 'f':
case 'F':
a[i]=15;
break;
default:
printf(" Entered number is not Hexadecimal.\nPrinted value is not correct.\n");
break;
}
}
i--;
for(;i>=0;i--)
{
h=h+a[i]*m;
m=m*16;
}
printf("%ld",h);
}
void oh(long n)
{
long i;
if(n>0)
{
i=n%16;
n=n/16;
oh(n);
if(i>=10)
{
switch(i)
{
case 10:
printf("A");
break;
case 11:
printf("B");
break;
case 12:
printf("C");
break;
case 13:
printf("D");
break;
case 14:
printf("E");
break;
case 15:
printf("F");
break;
}
}
else
printf("%ld",i);
}
}
void ho()
{
int i,a[20];
unsigned long int h=0,m=1;
char s[20];
clrscr();
printf("\n\n");
printf("Convertion from Hexadecimal to Octal.");
printf("\n");
printf(" Enter a Hexadecimal number...!!!");
printf("\n\n\t");
scanf("%s",s);
printf("\n\n");
// Converting hex to dec first
for(i=0;s[i]!=NULL;i++)
{
switch(s[i])
{
case '0':
a[i]=0;
break;
case '1':
a[i]=1;
break;
case '2':
a[i]=2;
break;
case '3':
a[i]=3;
break;
case '4':
a[i]=4;
break;
case '5':
a[i]=5;
break;
case '6':
a[i]=6;
break;
case '7':
a[i]=7;
break;
case '8':
a[i]=8;
break;
case '9':
a[i]=9;
break;
case 'a':
case 'A':
a[i]=10;
break;
case 'b':
case 'B':
a[i]=11;
break;
case 'c':
case 'C':
a[i]=12;
break;
case 'd':
case 'D':
a[i]=13;
break;
case 'e':
case 'E':
a[i]=14;
break;
case 'f':
case 'F':
a[i]=15;
break;
default:
printf(" Entered number is not Hexadecimal.\nPrinted value is not correct.");
break;
}
}
i--;
for(;i>=0;i--)
{
h=h+a[i]*m;
m=m*16;
}
// Now convering from decimal to octal (h)
i=0;
printf(" Octal equivalent= ");
while(h!=0)
{
a[i]=h%8;
h=h/8;
i++;
}
i--;
for(;i>=0;i--)
printf("%d",a[i]);
}
/*
*Program for Binary, Octal, Hexadecimal Conversions
*
Created on March 25, 2009
*/
#include
#include
#include
#include
void bd();
void db();
void doc();
void dh();
void od();
void ob();
void bo();
void bh();
void hb();
void hd();
void oh();
void ho();
void main()
{
int n;
char c;
begin:
clrscr();
printf("\n\n @@ ## ~~ MAIN MENU ~~ ## @@\n\n ");
printf("\nPlease Enter y0ur ch0ise..!!(1-12) ");
printf("\n 1. Binary to Decimal. ");
printf("\n 2. Decimal to Binary. ");
printf("\n 3. Decimal to Octal. ");
printf("\n 4. Decimal to Hexadecimal. ");
printf("\n 5. Octal to Decimal. ");
printf("\n 6. Octal to Binary. ");
printf("\n 7. Binary to Octal. ");
printf("\n 8. Binary to Hexadecimal. ");
printf("\n 9. Hexadecimal to Binary. ");
printf("\n 10. Hexadecimal to Decimal. ");
printf("\n 11. Octal to Hexadecimal. ");
printf("\n 12. Hexadecimal to Octal. ");
printf("\n\n");
printf("Ch00se ConVersi0n fr0m...t0...(1-12):\n");
scanf("%d",& n);
if(n<1 || n>12)
printf("\n\n ");
printf("\n\nInvalid Choise ");
if(n==1)
bd();
else if(n==2)
db();
else if(n==3)
doc();
else if(n==4)
{
long a;
clrscr();
printf("\n\n");
printf("Conversion from Decimal to Hexadecimal ");
printf("\n");
printf(" Enter the decimal number...!!! ");
printf("\n\n\t");
scanf("%ld",&a);
printf("\n\n");
//dh(a);
}
else if(n==5)
od();
else if(n==6)
ob();
else if(n==7)
bo();
else if(n==8)
bh();
else if(n==9)
hb();
else if(n==10)
hd();
else if(n==11)
{
unsigned long n,i=0,a,p=1,t=0;
clrscr();
printf("\n\n");
printf("Conversion from Octal to Hexadecimal. ");
printf("\n");
printf(" Enter a Octal number...!!! ");
printf("\n\n\t");
scanf("%ld",&n);
printf("\n\n");
i=0;
while(n!=0)
{
a=n%10;
if(a>7)
t=1;
n=n/10;
i=i+a*p;
p=p*8;
}
if(t==1)
{
printf(" Hexadecimal eq= ");
//oh(i);
}
else if(t==0)
printf(" Numbert entered is not octal. ");
}
else if(n==12)
ho();
printf("\n\n\n");
printf(" Do you Wish to continue???..(Y/N) ");
printf("\n\t\t");
scanf("%s",&c);
c=toupper(c);
if(c=='Y')
goto begin;
getch();
}
void bd()
{
int n,b=0,a[6],i=0,t=0;
clrscr();
printf("\n\n");
printf("Conversion from Binary to Decimal. ");
printf("\n");
printf(" Enter Binary Number...!!! ");
printf("\n\n\t");
scanf("%d",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%10;
n=n/10;
if(a[i]!=1 && a[i]!=0)
t=1;
i++;
}
a[i]=2;
n=1;
for(i=0;a[i]!=2;i++)
{
b=b+a[i]*n;
n=n*2;
}
if(t==0)
printf(" Decimal Equivalent=%d",b);
else if(t==1)
printf("\n\n");
printf("\nEntered number is not binary.");
}
void db()
{
int dec,bin,n,i=0,a[10];
clrscr();
printf("\n\n");
printf("Conversion from Decimal to Binary. ");
printf("\n");
printf(" Enter decimal number...!!!");
printf("\n\n\t");
scanf("%d",&dec);
printf("\n\n ");
do
{
a[i]=dec%2;
dec=dec/2;
i++;
}
while(dec!=0);
for(n=i-1;n>=0;n--)
printf("%d",a[n]);
}
void doc()
{
int n,i,a[10];
clrscr();
printf("\n\n");
printf("Conversion from Decimal to Octal. ");
printf("\n");
printf(" Enter a Decimal number...!!! ");
printf("\n\n\t");
scanf("%d",&n);
printf("\n\n");
i=0;
printf(" Octal equivalent of %d is ",n);
while(n!=0)
{
a[i]=n%8;
n=n/8;
i++;
}
i--;
for(;i>=0;i--)
printf("%d",a[i]);
}
void dh(long n)
{
long i;
if(n>0)
{
i=n%16;
n=n/16;
dh(n);
if(i>=10)
{
switch(i)
{
case 10:
printf("A");
break;
case 11:
printf("B");
break;
case 12:
printf("C");
break;
case 13:
printf("D");
break;
case 14:
printf("E");
break;
case 15:
printf("F");
break;
}
}
else
printf("\n\n");
printf("%ld",i);
}
}
void od()
{
unsigned long n,i=0,a,p=1,t=0;
clrscr();
printf("\n\n");
printf("Conversion from Octal to Decimal. ");
printf("\n");
printf(" Enter a Octal number...!!! ");
printf("\n\n\t");
scanf("%ld",&n);
printf("\n\n");
i=0;
printf(" Decimal equivalent of %ld is ",n);
while(n!=0)
{
a=n%10;
if(a>7)
t=1;
n=n/10;
i=i+a*p;
p=p*8;
}
if(t==0)
printf("=%ld",i);
else if(t==1)
printf("\n");
printf("\n Can't be calculated,,!!!\nBecause it is not an Octal Number. \n");
}
void ob()
{
int n,a[6],i=0,t=0;
clrscr();
printf("\n\n");
printf("Convertion from Octal to Binary. ");
printf("\n");
printf(" Enter an Octal Number...!!! ");
printf("\n\n\t");
scanf("%d",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%10;
n=n/10;
if(a[i]>7)
t=1;
i++;
}
i--;
if(t==0)
for(;i>=0;i--)
{
switch(a[i])
{
case 0:
printf("000");
break;
case 1:
printf("001");
break;
case 2:
printf("010");
break;
case 3:
printf("011");
break;
case 4:
printf("100");
break;
case 5:
printf("101");
break;
case 6:
printf("110");
break;
case 7:
printf("111");
break;
}
}
if(t==1)
printf(" Not a Octal number!!!\n");
}
void bo()
{
int i=0,a[5],t=0;
long int n;
clrscr();
printf("\n\n");
printf("Convertion From Binary to Octal. ");
printf("\n");
printf("Enter a Binary number...!!! ");
printf("\n\n\t");
scanf("%ld",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%1000;
n=n/1000;
if(a[i]>111)
t=1;
i++;
}
i--;
if(t==0)
for(;i>=0;i--)
{
switch(a[i])
{
case 0:
printf("0");
break;
case 1:
printf("1");
break;
case 10:
printf("2");
break;
case 11:
printf("3");
break;
case 100:
printf("4");
break;
case 101:
printf("5");
break;
case 110:
printf("6");
break;
case 111:
printf("7");
break;
default:
printf(" Entered number is not binary.\nPrinted value is not correct. ");
break;
}
}
if(t==1)
printf("Number is not Binary!!! ");
}
void bh()
{
int i=0,a[5],t=0;
long int n;
clrscr();
printf("\n\n");
printf("Convertion from Binary to Hexadecimal. ");
printf("\n");
printf(" Enter a Binary number...!!! ");
printf("\n\n\t");
scanf("\t%ld",&n);
printf("\n\n");
while(n!=0)
{
a[i]=n%10000;
n=n/10000;
if(a[i]>1111)
t=1;
i++;
}
i--;
if(t==0)
for(;i>=0;i--)
{
switch(a[i])
{
case 0:
printf("0");
break;
case 1:
printf("1");
break;
case 10:
printf("2");
break;
case 11:
printf("3");
break;
case 100:
printf("4");
break;
case 101:
printf("5");
break;
case 110:
printf("6");
break;
case 111:
printf("7");
break;
case 1000:
printf("8");
break;
case 1001:
printf("9");
break;
case 1010:
printf("A");
break;
case 1011:
printf("B");
break;
case 1100:
printf("C");
break;
case 1101:
printf("D");
break;
case 1110:
printf("E");
break;
case 1111:
printf("F");
break;
default:
printf(" Entered number is not binary.\n Printed value is not correct.\n");
break;
}
}
if(t==1)
printf("\nNumber is not Binary\n");
}
void hb()
{
int i;
char s[20];
clrscr();
printf("\n\n");
printf("Convertion from Hexadecimal to Binary.");
printf("\n");
printf(" Enter a Hexadecimal number...!!!");
printf("\n\n\t");
scanf("%s",s);
printf("\n\n");
//gets(s);
printf(" Binary Equivalent=");
for(i=0;s[i]!=NULL;i++)
{
switch(s[i])
{
case '0':
printf("0000");
break;
case '1':
printf("0001");
break;
case '2':
printf("0010");
break;
case '3':
printf("0011");
break;
case '4':
printf("0100");
break;
case '5':
printf("0101");
break;
case '6':
printf("0110");
break;
case '7':
printf("0111");
break;
case '8':
printf("1000");
break;
case '9':
printf("1001");
break;
case 'a':
case 'A':
printf("1010");
break;
case 'b':
case 'B':
printf("1011");
break;
case 'c':
case 'C':
printf("1100");
break;
case 'd':
case 'D':
printf("1101");
break;
case 'e':
case 'E':
printf("1110");
break;
case 'f':
case 'F':
printf("1111");
break;
default:
printf(" Entered number is not Hexadecimal.\Printed value is not correct.\n");
break;
}
}
}
void hd()
{
int i,a[20];
unsigned long int h=0,m=1;
char s[20];
clrscr();
printf("\n\n");
printf("Convertion from Hexadecimal to Decimal.");
printf("\n");
printf(" Enter a Hexadecimal number...!!!");
printf("\n\n\t");
scanf("%s",s);
printf("\n\n");
printf(" Decimal Equivalent= ");
for(i=0;s[i]!=NULL;i++)
{
switch(s[i])
{
case '0':
a[i]=0;
break;
case '1':
a[i]=1;
break;
case '2':
a[i]=2;
break;
case '3':
a[i]=3;
break;
case '4':
a[i]=4;
break;
case '5':
a[i]=5;
break;
case '6':
a[i]=6;
break;
case '7':
a[i]=7;
break;
case '8':
a[i]=8;
break;
case '9':
a[i]=9;
break;
case 'a':
case 'A':
a[i]=10;
break;
case 'b':
case 'B':
a[i]=11;
break;
case 'c':
case 'C':
a[i]=12;
break;
case 'd':
case 'D':
a[i]=13;
break;
case 'e':
case 'E':
a[i]=14;
break;
case 'f':
case 'F':
a[i]=15;
break;
default:
printf(" Entered number is not Hexadecimal.\nPrinted value is not correct.\n");
break;
}
}
i--;
for(;i>=0;i--)
{
h=h+a[i]*m;
m=m*16;
}
printf("%ld",h);
}
void oh(long n)
{
long i;
if(n>0)
{
i=n%16;
n=n/16;
oh(n);
if(i>=10)
{
switch(i)
{
case 10:
printf("A");
break;
case 11:
printf("B");
break;
case 12:
printf("C");
break;
case 13:
printf("D");
break;
case 14:
printf("E");
break;
case 15:
printf("F");
break;
}
}
else
printf("%ld",i);
}
}
void ho()
{
int i,a[20];
unsigned long int h=0,m=1;
char s[20];
clrscr();
printf("\n\n");
printf("Convertion from Hexadecimal to Octal.");
printf("\n");
printf(" Enter a Hexadecimal number...!!!");
printf("\n\n\t");
scanf("%s",s);
printf("\n\n");
// Converting hex to dec first
for(i=0;s[i]!=NULL;i++)
{
switch(s[i])
{
case '0':
a[i]=0;
break;
case '1':
a[i]=1;
break;
case '2':
a[i]=2;
break;
case '3':
a[i]=3;
break;
case '4':
a[i]=4;
break;
case '5':
a[i]=5;
break;
case '6':
a[i]=6;
break;
case '7':
a[i]=7;
break;
case '8':
a[i]=8;
break;
case '9':
a[i]=9;
break;
case 'a':
case 'A':
a[i]=10;
break;
case 'b':
case 'B':
a[i]=11;
break;
case 'c':
case 'C':
a[i]=12;
break;
case 'd':
case 'D':
a[i]=13;
break;
case 'e':
case 'E':
a[i]=14;
break;
case 'f':
case 'F':
a[i]=15;
break;
default:
printf(" Entered number is not Hexadecimal.\nPrinted value is not correct.");
break;
}
}
i--;
for(;i>=0;i--)
{
h=h+a[i]*m;
m=m*16;
}
// Now convering from decimal to octal (h)
i=0;
printf(" Octal equivalent= ");
while(h!=0)
{
a[i]=h%8;
h=h/8;
i++;
}
i--;
for(;i>=0;i--)
printf("%d",a[i]);
}
Wednesday, June 22, 2011
Searching with Binary Method in java using scanner utility
package binary;
import java.util.Scanner;// mamasukkan utility library scann.
/**
*
* @author dell
*/
public class BinnarySearch {
public static void main(String[] args) {
int k, angka; //memasukkan nilai variabel
boolean notfound=true;/** menginisialisasi nilai variabel notfound dengan
* nilai false
*/
int []z={25,30,35,40,45};// nilai variabel dari array z
for (int i=0;ibatasatas)//yang akan dilakukan jika batas atas sudah melebihi
//batas atas, dan syarat ini hanya akan di kerjakan jika else di bawah
//tidak bisa berjalan.
{
System.out.println("tidak ditemukan :"+angka);// SOP bahwa nilai tidak ditemukan
break;//menghentikan program karena nilai tidak ditemukan
}
else {// syarat yang akan dijalankan jika syarat if pertama tidak berhasil
//untuk menemukan nilai
if (z[posisisekarang]
{
batasbawah=posisisekarang+1;// jika syarat diatas terpenuhi, maka nilai batas bawah
//yang baru didapatkan dengan cara ini.
}//akhir if
else
{
batasatas=posisisekarang-1;// yang akan dilakukan untuk mendapatkan
//nilai batas atas baru jika posisi sekarang lebih dari angka/
}// akhir else
}//akhir else
}//akhir while
}//akhir main args
}//akhir class binary
import java.util.Scanner;// mamasukkan utility library scann.
/**
*
* @author dell
*/
public class BinnarySearch {
public static void main(String[] args) {
int k, angka; //memasukkan nilai variabel
boolean notfound=true;/** menginisialisasi nilai variabel notfound dengan
* nilai false
*/
int []z={25,30,35,40,45};// nilai variabel dari array z
for (int i=0;i
//batas atas, dan syarat ini hanya akan di kerjakan jika else di bawah
//tidak bisa berjalan.
{
System.out.println("tidak ditemukan :"+angka);// SOP bahwa nilai tidak ditemukan
break;//menghentikan program karena nilai tidak ditemukan
}
else {// syarat yang akan dijalankan jika syarat if pertama tidak berhasil
//untuk menemukan nilai
if (z[posisisekarang]
{
batasbawah=posisisekarang+1;// jika syarat diatas terpenuhi, maka nilai batas bawah
//yang baru didapatkan dengan cara ini.
}//akhir if
else
{
batasatas=posisisekarang-1;// yang akan dilakukan untuk mendapatkan
//nilai batas atas baru jika posisi sekarang lebih dari angka/
}// akhir else
}//akhir else
}//akhir while
}//akhir main args
}//akhir class binary
Thursday, June 16, 2011
source code tree java post order
package treepckg;
/**
*
* @author dell
*/
public class Node {
Node left;
Node right;
int value;
public Node(int value){
this.value=value;
}
public void run(){
Node root=new Node(4);
System.out.print("contohnya Binary Tree");
System.out.print("Membangun tree dengan nilai akar"+root.value);
insert (root,1);
insert (root,8);
insert (root,6);
insert (root,3);
insert (root,9);
System.out.print("trasversing tree secara in order"+"\n");
printInOrder(root);
}
public void insert(Node node, int value){
if (valuenode.value)
{
if (node.right !=null){
insert (node.right, value);
}
else
{
System.out.println("menyisipkan "+value+" ke kanan dari "+node.value);
node.right= new Node(value);
}
}
}
public void printInOrder (Node node){
if (node != null){
printInOrder(node.right);
System.out.println("Traversed "+node.value);
printInOrder(node.left);
}
}
}
package treepckg;
/**
*
* @author dell
*/
public class Main {
public static void main(String[] args) {
Node test=new Node(5);
test.run();
}
}
/**
*
* @author dell
*/
public class Node {
Node left;
Node right;
int value;
public Node(int value){
this.value=value;
}
public void run(){
Node root=new Node(4);
System.out.print("contohnya Binary Tree");
System.out.print("Membangun tree dengan nilai akar"+root.value);
insert (root,1);
insert (root,8);
insert (root,6);
insert (root,3);
insert (root,9);
System.out.print("trasversing tree secara in order"+"\n");
printInOrder(root);
}
public void insert(Node node, int value){
if (value
{
if (node.right !=null){
insert (node.right, value);
}
else
{
System.out.println("menyisipkan "+value+" ke kanan dari "+node.value);
node.right= new Node(value);
}
}
}
public void printInOrder (Node node){
if (node != null){
printInOrder(node.right);
System.out.println("Traversed "+node.value);
printInOrder(node.left);
}
}
}
package treepckg;
/**
*
* @author dell
*/
public class Main {
public static void main(String[] args) {
Node test=new Node(5);
test.run();
}
}
Wednesday, June 8, 2011
koding untuk Stack link list
Class tempat push dan pop
package Stack;
class item
{
public String data;// membuat Variabel yang bernilai String
public item lanjut;// membuat Variabel yang bernilai abstract
public item kembali;// membuat Variabel yang bernilai abstract
public item(String i)// method String
{
data = i;//menginisialisasikan bahwa nilai i = data
} //akhir method item
public void displayLink()//method display untuk menampilkan data yang telah di inputkan
{
System.out.print( data );//menampilkan data
}
}
class StackLinkList//class yang digunakan untuk menginisialisasikan posisi dari data
{
private item atas;//data atas
private item bawah;//data bawah
public StackLinkList()//method letak data
{
atas = bawah = null;//menginisialisasi bahwa list kosong
}
public boolean isEmpty()//syarat
{
return (atas==null);//yang akan dilakukan, akan lebih jelas terlihat pada class main
}
public void push(String id)//method untuk memasukkan nilai
{
item newitem = new item(id);//memanggila class item
if (atas == null)//syarat
{
atas = bawah = newitem;//yang akan dilakukan jika nilai atas masih kosong
}
else //yang akan jika syarat sebelumnya belum terpenuhi
{
atas.lanjut = newitem;
newitem.kembali = atas;
atas = newitem;
}
}//akhir method push
public item pop()//method untuk menghapus nilai
{ item temp = null;//menginisialisasi bahwa nilai temp masih null
if (atas == null)//syarat yang akan dilakukan ketika atas masih null
System.out.println("Stack is empty");//SOP menandakan data kosong
else if (atas == bawah)//yang akan dilakukan jika data hanya 1
{
temp = atas;
atas = bawah = null;
}
else //yang akan dilakukan jika syarat tidak ada yang terpenuhi
{
temp = atas;
atas = atas.kembali;
atas.lanjut = null;
}
return temp;//mengembalikan nilai return
}//akhir method pop
public void display()//method untuk menampilkan data
{
item current = bawah;//menginisialisasikan bahwa nilai current=nilai data paling bawah
while(current != null)//yang akan dilakukan jika nilai bawah tidak kosong
{
current.displayLink();//menampilkan data
current = current.lanjut;//nilai current menjadi nilai dat berikutnya
}//akhir dari while
System.out.println("");//memberikan spasi
}//akhir method display
} //akhir class StackLinklist
Class untuk menampilkan data
package Stack;
class StackLinkListApp
{
public static void main(String[] args)
{
StackLinkList a = new StackLinkList();//memanggil class StackLinkList
a.push("G1A010064");//Memasukkan nilai
a.push("G1A010063");//Memasukkan nilai
a.push("G1A010059");//Memasukkan nilai
a.push("G1A010025");//Memasukkan nilai
a.push("G1A010011");//Memasukkan nilai
a.push("G1A010007");//Memasukkan nilai
a.push("G1A010001");//Memasukkan nilai
a.display();//menampilkan data
System.out.println("menghapus data dari atas");
while( !a.isEmpty() )//yang akan dilakukan ketika list tidak kosong
{
item aLink = a.pop();// memanggil method pop
System.out.print("angka atasnya pindah kedepan :\n ");{//SOP
aLink.displayLink();
}
a.display();//menampilkan data
System.out.println("");//memberikan spasi
if (a.isEmpty())//yang akan dilakukan ketika list kosong
System.out.print("data telah kosong \n");//SOP bahwa list telah kosong
}//akhir while
}//akhir main args
}//akhir class List APp
package Stack;
class item
{
public String data;// membuat Variabel yang bernilai String
public item lanjut;// membuat Variabel yang bernilai abstract
public item kembali;// membuat Variabel yang bernilai abstract
public item(String i)// method String
{
data = i;//menginisialisasikan bahwa nilai i = data
} //akhir method item
public void displayLink()//method display untuk menampilkan data yang telah di inputkan
{
System.out.print( data );//menampilkan data
}
}
class StackLinkList//class yang digunakan untuk menginisialisasikan posisi dari data
{
private item atas;//data atas
private item bawah;//data bawah
public StackLinkList()//method letak data
{
atas = bawah = null;//menginisialisasi bahwa list kosong
}
public boolean isEmpty()//syarat
{
return (atas==null);//yang akan dilakukan, akan lebih jelas terlihat pada class main
}
public void push(String id)//method untuk memasukkan nilai
{
item newitem = new item(id);//memanggila class item
if (atas == null)//syarat
{
atas = bawah = newitem;//yang akan dilakukan jika nilai atas masih kosong
}
else //yang akan jika syarat sebelumnya belum terpenuhi
{
atas.lanjut = newitem;
newitem.kembali = atas;
atas = newitem;
}
}//akhir method push
public item pop()//method untuk menghapus nilai
{ item temp = null;//menginisialisasi bahwa nilai temp masih null
if (atas == null)//syarat yang akan dilakukan ketika atas masih null
System.out.println("Stack is empty");//SOP menandakan data kosong
else if (atas == bawah)//yang akan dilakukan jika data hanya 1
{
temp = atas;
atas = bawah = null;
}
else //yang akan dilakukan jika syarat tidak ada yang terpenuhi
{
temp = atas;
atas = atas.kembali;
atas.lanjut = null;
}
return temp;//mengembalikan nilai return
}//akhir method pop
public void display()//method untuk menampilkan data
{
item current = bawah;//menginisialisasikan bahwa nilai current=nilai data paling bawah
while(current != null)//yang akan dilakukan jika nilai bawah tidak kosong
{
current.displayLink();//menampilkan data
current = current.lanjut;//nilai current menjadi nilai dat berikutnya
}//akhir dari while
System.out.println("");//memberikan spasi
}//akhir method display
} //akhir class StackLinklist
Class untuk menampilkan data
package Stack;
class StackLinkListApp
{
public static void main(String[] args)
{
StackLinkList a = new StackLinkList();//memanggil class StackLinkList
a.push("G1A010064");//Memasukkan nilai
a.push("G1A010063");//Memasukkan nilai
a.push("G1A010059");//Memasukkan nilai
a.push("G1A010025");//Memasukkan nilai
a.push("G1A010011");//Memasukkan nilai
a.push("G1A010007");//Memasukkan nilai
a.push("G1A010001");//Memasukkan nilai
a.display();//menampilkan data
System.out.println("menghapus data dari atas");
while( !a.isEmpty() )//yang akan dilakukan ketika list tidak kosong
{
item aLink = a.pop();// memanggil method pop
System.out.print("angka atasnya pindah kedepan :\n ");{//SOP
aLink.displayLink();
}
a.display();//menampilkan data
System.out.println("");//memberikan spasi
if (a.isEmpty())//yang akan dilakukan ketika list kosong
System.out.print("data telah kosong \n");//SOP bahwa list telah kosong
}//akhir while
}//akhir main args
}//akhir class List APp
Saturday, April 30, 2011
Efect of global warming in Bengkulu, Indonesia
Bengkulu is one of province in Indonesia, located at sumatera, as we know, Sumatera is one of largest island in Indonesia that have a huge forest in Indonesia..
But know, almost all of the forest destructed, cause of the human greed, they cut the forest tree, burnt it to make a new farm or land for new building, an also that's a lot of transportation which give bad emition for the atmosfer, like carbon dioxide, which can triger the green house effect in earth..
this is one of deserted land in bengkulu...
but at least there are still a bit of forest remain in my beloved province, i hope there are no more deserted forest in my pro vince
But know, almost all of the forest destructed, cause of the human greed, they cut the forest tree, burnt it to make a new farm or land for new building, an also that's a lot of transportation which give bad emition for the atmosfer, like carbon dioxide, which can triger the green house effect in earth..
this is one of deserted land in bengkulu...
but at least there are still a bit of forest remain in my beloved province, i hope there are no more deserted forest in my pro vince
Thursday, April 14, 2011
Yudisium Fakultas teknik Unib Ke-11 14 April 2011
Foto- foto :
Kak Riki Laboran TI Akhirnya Yudisium,,,,
Peserta Yudisium Ke-11
Masih banyak foto yang lain, tapi lagi males up load, kalo perlu lagi fotonya, post aja ya..... :)
Kak Riki Laboran TI Akhirnya Yudisium,,,,
Peserta Yudisium Ke-11
Masih banyak foto yang lain, tapi lagi males up load, kalo perlu lagi fotonya, post aja ya..... :)
Friday, April 8, 2011
lagi-lagi
lagi, DPR berulah, kerja gak becus, kerja cuma tidur, maunya makan terus...
jadi SAPI aja sekalian tuh orang-orang DPR, tidur sambil makan, enak juga kalo bisa dimakan tuh anggota DPR, neh namanya beternak sapi, tapi sapi haram yang gak boleh dimakan,
gaji besar, kerjaan tidur, tapi masih kurang juga ? mau perumahan ato, apalah tuh, mau dibikinin kandang yang bagus ? kerja dulu tuh garap lahan indonesia ini, kalo lahan kita udah subur, hasilnya dah bagus, baru istirahat, apa mau jadi sapi bali, sapi pedaging, yang makan tidur .......
KANDANG DPRnya, mau pake kolam lagi... pake lumpur yoh ?
kandang sapi kok mau bagus-bagus ? ginian juga cukup
jadi SAPI aja sekalian tuh orang-orang DPR, tidur sambil makan, enak juga kalo bisa dimakan tuh anggota DPR, neh namanya beternak sapi, tapi sapi haram yang gak boleh dimakan,
gaji besar, kerjaan tidur, tapi masih kurang juga ? mau perumahan ato, apalah tuh, mau dibikinin kandang yang bagus ? kerja dulu tuh garap lahan indonesia ini, kalo lahan kita udah subur, hasilnya dah bagus, baru istirahat, apa mau jadi sapi bali, sapi pedaging, yang makan tidur .......
kandang sapi kok mau bagus-bagus ? ginian juga cukup
Subscribe to:
Posts (Atom)