Pages

Tampilkan postingan dengan label pemrograman. Tampilkan semua postingan
Tampilkan postingan dengan label pemrograman. Tampilkan semua postingan

Rabu, 19 September 2012

Yuk..!!! Mengenal Web lebih dekat

Pastinya udah tau donk apa itu web/website, setidaknya pernah dengar lah istilah yang sudah tak asing ini.
contoh sederhana web itu www.facebook.com , halaman web yang paling sering di akses umat manusia sekarang ini.
yuk kita mengenal lebih dekat tentang bagaimana cara kerja suatu website.

pertama ada yang harus anda lengkapi terlebih dahulu untuk mengakses sebuah web :
  1. User/Pengguna --> orang yang melalukan permintaan untuk mengakses suatu web. anda nggak usah binggung cari user kemana-mana, karena anda sendirilah user.
  2. Browser -->  aplikasi yang berfungsi sebagai sebuah mesin pencari dimana sebuah situs atau informasi berada. kenal donk sama Mozilla Firefox atau Opera, nah itu contoh Browser.
  3. TCP/IP --> standar komunikasi data yang digunakan oleh komunitas internet dalam proses tukar-menukar data dari satu komputer ke komputer lain di dalam jaringan Internet.
  4. Server --> Pusat penyimpanan dan pengelolahan data. disinilah letak segala informasi yang ingin anda akses melalui web.
Print Friendly and PDF

Jumat, 01 Juni 2012

[TUGAS PBO] RumahGempa

Print Friendly and PDF

Kamis, 31 Mei 2012

BOLA BOLI





Print Friendly and PDF

Minggu, 29 April 2012

TUGAS 4 PBO






Print Friendly and PDF

Sabtu, 28 April 2012

TUGAS 3 PBO

pusing mikir untuk buat program yg lebih compleks, ane rilis yg sedehana dulu...




Print Friendly and PDF

Sabtu, 07 April 2012

Tugas 2 PBO




referensi lain, hasil tetap sama.
disini kita mengkonversi variabel a menjadi x dengan type integer
int x=Integer.parseInt(a);




Print Friendly and PDF

Sabtu, 28 Januari 2012

TREE : C++ [TUGAS]


#include<stdio.h>
#include<conio.h>
#include<malloc.h>
#include<stdlib.h>

struct Node
{
char INFO;
struct Node *LEFT;
struct Node *RIGHT;
};
typedef struct Node Simpul;
Simpul *ROOT,*P;
char X;

void Inisialisasi()
{
ROOT=NULL;
P=NULL;
}

void BuatSimpul(char X)
{
P=(Simpul *)malloc(sizeof(Simpul));
P->INFO=X;
P->RIGHT=NULL;
P->LEFT=NULL;
}

void BuatAkar()
{
ROOT=P;
}

void PreOrder(Simpul *T)
{
if(T!=NULL)
{
printf("%c",T->INFO);
PreOrder(T->LEFT);
PreOrder(T->RIGHT);
}
}

void InOrder(Simpul *T)
{
if(T!=NULL)
{
InOrder(T->LEFT);
printf("%c",T->INFO);
InOrder(T->RIGHT);
}
}

void PostOrder(Simpul *T)
{
if(T!=NULL)
{
PostOrder(T->LEFT);
PostOrder(T->RIGHT);
printf("%c",T->INFO);
}
}

void main()
{
Inisialisasi();
BuatSimpul('A');BuatAkar();
BuatSimpul('B');ROOT->LEFT=P;
BuatSimpul('C');ROOT->RIGHT=P;
BuatSimpul('G');ROOT->RIGHT->RIGHT=P;
BuatSimpul('E');ROOT->LEFT->RIGHT=P;
BuatSimpul('F');ROOT->RIGHT->LEFT=P;
BuatSimpul('L');ROOT->RIGHT->LEFT->LEFT=P;
BuatSimpul('M');ROOT->RIGHT->LEFT->RIGHT=P;

printf("\n Preorder :");PreOrder(ROOT);
printf("\n Inorder :");InOrder(ROOT);
printf("\n Postorder :");PostOrder(ROOT);
}


Print Friendly and PDF

Selasa, 24 Januari 2012

ANTRIAN [QUEUE] : TUGAS


#include <stdio.h>
#include <conio.h>
#include <iostream.h>

typedef struct{
char data[10];
int head;
int tail;
}
Queue;
void keluar();
Queue antrian;

int IsEmpty(){
if (antrian.tail==0)
return 1;
else
return 0;
}

int IsFull(){
if(antrian.tail==10)
return 1;
else return 0;
}

void Enqueue(char data){
if(IsEmpty()==1){
antrian.head=antrian.tail=1;
antrian.data[antrian.tail]=data;
}else
if(IsFull()==0){
antrian.tail++;
antrian.data[antrian.tail]=data;
}
keluar();
}

char Dequeue(){
int i;
char e = antrian.data[antrian.head];
for(i = antrian.head;i<=antrian.tail-1;i++){
antrian.data[i] = antrian.data[i+1];
}
antrian.tail--;
return e;
}

void Tampil(){
clrscr();
if(IsEmpty()==0){
for(int i=antrian.head;i<=antrian.tail;i++){
cout<<antrian.data[i];
}
}else printf("Data kosong!\n");
keluar();
}



void menu()
{
char pil,data;
clrscr();
textcolor(3);
gotoxy(20,14);cprintf("  JUNED/11051103247 \r \n " );
gotoxy(20,5);cprintf ("  TUGAS LIMA  \r \n " );
gotoxy(20,6);cprintf (" -------------------  \r \n " );
gotoxy(20,7);cprintf ("   1. ENQUEUE         \r \n " );
gotoxy(20,8);cprintf ("   2. DEQUEUE           \r \n " );
gotoxy(20,9);cprintf ("   3. TAMPIL           \r \n " );
gotoxy(20,10);cprintf("   4. EXIT          \r \n " );
cout<<endl;
gotoxy(20,11);cprintf("  Pilihan : "); cin >> pil;


switch(pil)
{
case '1' : clrscr();cout<<" input data : ";cin>>data; Enqueue(data);break;
case '2' : clrscr();  cout<<" data keluar : "<<Dequeue();keluar();
case '3' : Tampil();break;
case '4' : break;
default :
gotoxy(20,3);cprintf(" input anda salah ....!!! ");getch();menu();
}
}

void keluar()
{
char x ;
textcolor(12);
cprintf( "\n Kembali ke Menu ...? (Y/N) "); cin >> x;
switch(x)
{
case 'Y' : menu();break;
case 'y' : menu();break;
case 'N' : cout << " thankzzzz";break;
case 'n' : cout << " thankzzzz";break;
default :
{
cprintf( " input salah ... \r \n");keluar();
}
}
}

void main()
{
menu ();
}

Print Friendly and PDF

Senin, 16 Januari 2012

FPB [TUGAS]


include <stdio.h>
#include <iostream.h>
#include <conio.h>


int fpb(int x, int y ){
int z,a;
if (y<=x && x%y==0){
return(y);
}else{
if (x<=y && y%x==0){
return(x);
}else{
if (x<y) {
z = fpb(y,x);
return(z);
}else{
a=x%y;
z=fpb(y,a);
return(z);
}
}
}
}

main(){
int m,n;
cout << " bilang 1 = "; cin >> m;
cout << " bilang 2 = "; cin >> n;
cout << " FPB = "<< fpb(m,n);
getch();
}
Print Friendly and PDF

STACK : BINER [TUGAS]


#include<stdio.h>
#include<conio.h>
#include<iostream.h>

int MAXSTACK;
typedef int itemtype;

typedef struct{
 itemtype item[300];
 int count; }stack;

void initstack(stack *s){
 s->count = 0; }

int empty(stack *s){
 return (s->count == 0);
}

int full(stack *s){
 return (s->count == MAXSTACK);
}

void push(itemtype x, stack *s){
 if(full(s))
 cout<< "stack penuh !\n";
 else{
 s->item[s->count]=x;
 ++(s->count);
 }
}

int pop(stack *s){
 if(empty(s))
 cout<<"stack kosong\n";
 else {
 --(s->count);
 return (s->item[s->count]);
 }
 return 0;
}
//deklarasi
int i, n, m, o;
int input;
stack tumpukan;

main()
{

 initstack(&tumpukan);
 cout << "masukkan bilangan desimal = ";cin>>input;

for(o=1,n=input;n>0;n=n/2,o++)
 {
 MAXSTACK=o;
 m=n%2;
 push(m,&tumpukan);
 }
for(i=MAXSTACK;i>0;i--)
 {
 cout<<pop(&tumpukan);
 }
 getch();
}


Print Friendly and PDF

PENGURUTAN [TUGAS]


#include <stdio.h>
#include <conio.h>
#include <iostream.h>

void main(){
int x,i;
int data[100];
cout <<" banyak data : "; cin>>x;

for (i=1; i<=x; i++){
cout<<" data ke-"<<i<<" : "; cin>>data[i];
clrscr();
}

cout<<" sebelum diurutkan : "<<endl;
for (i=1; i<=x; i++){
cout<<"  "<<data[i];
}

int temp,a;
for (i=2; i<=x; i++){
for (a=x; a>=i; a--){
if (data[a] < data[a-1]){
temp=data[a];
data[a]=data[a-1];
data[a-1]=temp;
}
}
}
cout<<"\n sesudah diurutkan : "<<endl;
for (i=1; i<=x; i++){
cout<<"  "<<data[i];
}
getch();
} Print Friendly and PDF

BILANGAN GENAP [TUGAS]


#include <stdio.h>
#include <conio.h>
#include <iostream.h>

int bil (int b, int a, int *banyak);

void main()
{
int b,a,banyak;
banyak=0;
cout << " BILANGAN GENAP " << endl;
cout << " ---------------- "<<endl;
cout << " batas bawah = ";cin >> b;
cout << " batas atas  = ";cin >> a;
bil(b,a,&banyak);
cout << " jumlah      = " << banyak;
getch();
}

int bil(int b, int a,int *banyak){
int x;
for (x=b; x<=a; x++){
if(x % 2 == 0){
*banyak = *banyak+1;
}
}
return(*banyak);
}

Print Friendly and PDF

SEGITIGA BINTANG & ANGKA [TUGAS]

  • SEGITIGA BINTANG & ANGKA
#include <stdio.h>
#include <iostream.h>
#include <conio.h>

void keluar();
void bintang()
{

int a,b,c;
clrscr();
gotoxy(14,14);cout << " Input batas = "; cin >> a;
clrscr();

for (b=1; b<=a; b++){
   for (c=1; c<=b; c++){
   textcolor(c);
   cprintf("*");
   }
   cout << endl;
   }
   keluar();
}

void angka()
{
int a,b,c;
clrscr();
gotoxy(14,14);cout << " Input batas = "; cin >> a;

clrscr();
for (b=1; b<=a; b++){
   for (c=1; c<=b; c++){
   cout<<c;
   }
   cout << endl;
   }
   keluar();
}

void menu()
{
char pil;
clrscr();
textcolor(3);
gotoxy(20,14);cprintf("  JUNED/11051103247 \r \n " );
gotoxy(20,5);cprintf ("  TUGAS DUA  \r \n " );
gotoxy(20,6);cprintf (" -------------------  \r \n " );
gotoxy(20,7);cprintf ("   1. BINTANG         \r \n " );
gotoxy(20,8);cprintf ("   2. ANGKA           \r \n " );
cout<<endl;
gotoxy(20,10);cprintf("  Pilihan : "); cin >> pil;


switch(pil)
{
case '1' : bintang();break;
case '2' : angka();break;
default :
gotoxy(20,3);cprintf(" input anda salah ....!!! ");
getch();
menu();
}
}

void keluar()
{
char x ;
textcolor(12);
cprintf( "\n Kembali ke Menu ...? (Y/N) "); cin >> x;
switch(x)
{
case 'Y' :
case 'y' : menu();break;
case 'N' :
case 'n' :
cout << " thankzzzz";break;
default :
{
cprintf( " input salah ... \r \n");keluar();
}
}
}
void main()
{
menu ();
}
Print Friendly and PDF

LUAS DAN KELILING [TUGAS]

  • LUAS DAN KELILING
  • #include 
    #include 
    #include 
    #include 
    
    void keluar();
    
    void luas_segitiga()
    {
    int a, t;
    float l,kel1,sisi_miring;
    clrscr();
    textcolor(5);
    gotoxy(20,5);cprintf("  LUAS SEGITIGA \r \n" );
    gotoxy(20,6);cprintf(" ----------------------- \r \n" );
    gotoxy(20,7);cprintf("  panjang alas     =  " ); cin >> a ;
    gotoxy(20,8);cprintf("  inputkan tinggi  =  ") ; cin >> t ;
    l = (a*t)/2;
    gotoxy(20,10);cprintf("  luas = "); cout << l << endl;
    sisi_miring =sqrt((a*a)+(t*t));
    kel1 = (a + t + sisi_miring) ;
    gotoxy(20,11);cprintf("  sisi miring = "); cout << sisi_miring  << endl;
    gotoxy(20,12);cprintf("  keliling    = "); cout << kel1  << endl;
    gotoxy(20,13);cprintf(" ----------------------- \r \n" );
    gotoxy(20,15);keluar();
    }
    
    void luas_persegi()
    {
    int s;
    float lu,kel2;
    
    clrscr();
    textcolor(6);
    gotoxy(20,5);cprintf ("   LUAS PERSEGI \r \n");
    gotoxy(20,6);cprintf ("  ------------------ \r \n" );
    gotoxy(20,7);cprintf ("   Panjang sisi = "); cin >> s ;
    lu = (s*s);
    gotoxy(20,9);cprintf ("   Luas     = " ); cout << lu  << endl;
    kel2 = (4*s) ;
    gotoxy(20,10);cprintf("   Keliling = ");cout << kel2  << endl;
    gotoxy(20,11);cprintf ("  ------------------ \r \n" );
    gotoxy(20,13);keluar();
    }
    
    void luas_ketupat()
    {
    int d;
    float luas,kel3,sisi,sd;
    clrscr();
    textcolor(9);
    gotoxy(20,5);cprintf ("    LUAS BELAH KETUPAT \r \n");
    gotoxy(20,6);cprintf (" ------------------------- \r \n");
    gotoxy(20,7);cprintf ("    Panjang diagonal = "); cin >> d ;
    luas = (d*d)/2;
    gotoxy(20,9);cprintf ("    Luas     = "); cout << luas  << endl;
    sd = d/2;
    sisi = sqrt((sd*sd)+(sd*sd));
    gotoxy(20,10);cprintf("    Sisi     = " ); cout<< sisi  << endl;
    kel3 = (4*sisi);
    gotoxy(20,11);cprintf("    Keliling = " );cout << kel3 << endl;
    gotoxy(20,12);cprintf (" ------------------------- \r \n");
    gotoxy(20,3);keluar();
    }
    
    void menu()
    {
    char pil;
    clrscr();
    textcolor(2);
    gotoxy(20,14);cprintf("  JUNED/11051103247 \r \n " );
    gotoxy(20,5);cprintf ("  LUAS DAN KELILING  \r \n " );
    gotoxy(20,6);cprintf (" -------------------  \r \n " );
    gotoxy(20,7);cprintf ("   1. segitiga         \r \n " );
    gotoxy(20,8);cprintf ("   2. persegi           \r \n " );
    gotoxy(20,9);cprintf ("   3. belah ketupat      \r \n " );
    cout<> pil;
    
    
    switch(pil)
    {
    case '1' : luas_segitiga();break;
    case '2' : luas_persegi();break;
    case '3' : luas_ketupat();
    default :
    gotoxy(20,3);cprintf(" input anda salah ....!!! ");getch();menu();
    }
    }
    
    void keluar()
    {
    char x ;
    textcolor(4);
    cprintf( " Kembali ke Menu ...? (Y/N) "); cin >> x;
    switch(x)
    {
    case 'Y' :
    case 'y' : menu();break;
    case 'N' :
    case 'n' :
    cout << " thankzzzz";break;
    default :
    {
    cprintf( " input salah ... \r \n");keluar();
    }
    }
    }
    
    void main ()
    {
    menu();
    }
    
    
    
    
    


Print Friendly and PDF

Rabu, 28 Desember 2011

GAJI [TUGAS]

  • GAJI PEGAWAI
  • #include 
    #include 
    #include 
    #include 
    
    void main(){
    
    char nama[20][20], nip[20][20];
    float gp[20],bonus[20],total[20];
    int i,a,lk[20];
    
    cout << " banyak data : "; cin >> a;
    for (i=1; i<=a; i++){
    clrscr();
    cout << " NIP  : " ; cin >> nip[i];
    cout << " Nama : " ; cin >> nama[i];
    cout << " Gaji Pokok : " ; cin >> gp[i];
    cout << " Lama Kerja (bulan) : " ; cin >> lk[i];
    
     if (lk[i] >= 24  )
     bonus[i] = (gp[i]*0.25);
     else
     if (lk[i] < 24 && lk[i] >= 12)
     bonus[i] = (gp[i]*0.15);
     else
     if (lk[i] < 12 && lk[i] >= 6)
     bonus[i] = (gp[i]*0.1);
     else
     bonus[i] = (gp[i]*0.05);
    
     total[i]=gp[i]+bonus[i];
    } textcolor(4);
      clrscr();
     printf("  -----------------------------------------------------------------------------\n");
      cprintf("    NIP     NAMA       GAJI POKOK     LAMA KERJA      BONUS         TOTAL");
     printf("\n  -----------------------------------------------------------------------------\n");
       for (i=1; i<=a; i++){
       gotoxy(5,i+3);cout << nip[i];
       gotoxy(13,i+3);cout << nama[i];
       gotoxy(24,i+3);printf("%10.2f %10d %16.2f %14.2f \n",gp[i],lk[i],bonus[i],total[i]);
       }
       printf("  -----------------------------------------------------------------------------\n");
    getch();
    }
    
Print Friendly and PDF

Rabu, 14 Desember 2011

MENGHITUNG BANYAKNYA BILANGAN FIBONACI [TUGAS SD PRATIKUM]

  • C++
  • #include 
    #include 
    
    int fibonacci(int n){
    if(n==1)
    return(0);
    else if(n==2)
    return(1);
    else
    return (fibonacci(n-1)+fibonacci(n-2));
    }
    
    int jum(int b,int a)
    {
    int x=0;
    for(int n=1; fibonacci(n)<=a; n++){
    if ( fibonacci(n) >= b && fibonacci(n) <= a )
    x=x+1;
    }
    return(x);
    }
    
    
    void main()
    {
    int b,a;
    cout <<" BILANGAN fibonacci " << endl;
    cout <<" ------------------------ "<>b;
    cout <<" batas atas  : ";cin>>a;
    
    cout <<"\n jumlah = " << jum(b,a);
    getch();
    }
    
    
    
Print Friendly and PDF

Senin, 12 Desember 2011

LINKED LIST [TUGAS SD]

BUAT TEMAN2 YG PUNYA TUGAS LINKED LIST...
NE ANE KASIH GAMBAR CODING NYA
SENGAJA NGGAK ANE BUAT DALAM BENTUK TEKS AND NGGAK ANE KASIH PRINTSCREEN HASILNYA...
SUPAYA AGAN2 NGETIK ULANG...




Print Friendly and PDF

Minggu, 27 November 2011

METODE BAGI DUA [TUGAS METNUM] C++

  • C++
  • #include 
    #include 
    #include 
    
    float a,c,b,F_a,F_c,F_b,E;
    int max;
    
    float f(float x)
    {
       return (x*x*x*x*x)-x-1;
    }
    
    void main()
    {
       int it;
       char selang;
       float epsilon;
    
       printf("Batas bawah      = "); scanf("%f",&a);
       printf("Batas atas       = "); scanf("%f",&b);
       printf("Toleransi Error  = "); scanf("%f",&E);
       printf("Iterasi maksimum = "); scanf("%d",&max);
    
       it = 0;
       F_a = f(a);
       F_b = f(b);
       if(F_a * F_b > 0) printf("Nilai F(a) x F(b) > 0\n");
       else
       {
        printf("--------------------------------------------------------------------------\n");
          printf(" r     a       b        c       f(a)      f(b)     f(c)  selang  lebarnya \n");
          printf("--------------------------------------------------------------------------\n");
          do
          {
          it = it + 1;
             c = (a + b) / 2;
             F_c = f(c);
             if(F_a * F_c <= 0) { selang ='A'; }
             else {selang ='B'; }
    
             printf("%2d %8.5f %8.5f %8.5f %8.5f %8.5f %8.5f   C%c    %8.5f \n",
                     it,a,b,c,F_a,F_b,F_c,selang,fabs(a-c));
             epsilon = fabs(a-c);
             if(F_a * F_c <= 0) { b = c; F_b = F_c; }
             else { a = c; F_a = F_c; }
          } while(it <= max && epsilon > E);
    
          if(it <= max)
          {
             printf("\n Hampiran (pendekatan) nilai x = %g\n",c);
             printf(" pada iterasi ke-%d",it);
          }
          else printf("Toleransi tidak terpenuhi, Jumlah Iterasi kurang\n");
       }
       getch();
    }
    
Print Friendly and PDF

Sabtu, 26 November 2011

METODE BAGI DUA [TUGAS METNUM] PASCAL

  • PASCAL
  • program bagidua;
    uses wincrt;
    
    Var 
       a,b,c,F_a,F_b,F_c,E : real; 
       max,it : integer; 
       epsilon: real;
       selang :string;
     
    function f(x : real) : real; 
    Begin 
       f := (x*x*x*x*x) - x - 1; 
    End;
    Begin
       write  ('  Batas bawah      = '); read(a); 
       write  ('  Batas atas       = '); read(b); 
       write  ('  Toleransi Error  = '); read(E); 
       write  ('  Iterasi maksimum = '); read(max);
    
       clrscr;
       it := 0; 
       F_a := f(a); 
       F_b := f(b); 
       if (F_a * F_b > 0) then writeln('   Nilai F(a) x F(b) > 0') 
       else 
       Begin
          writeln('--------------------------------------------------------------------------');
          writeln(' r     a       b         c       f(a)     f(b)     f(c)  selang  lebarnya ' );
          writeln('--------------------------------------------------------------------------');
    
    epsilon := E+1; 
     
          while((it <= max) and (epsilon > E)) 
          do 
          Begin 
             it := it + 1; 
             c := (a + b) / 2; 
             F_c := f(c);
    
              if(F_a * F_c <= 0) Then
              begin
                selang :='CA';
                end
             else
               begin
               selang :='CB';
             end;
    
             write(it:2,' ',a:8:5,' ',b:8:5,' ',c:8:5,' ');
             writeln(F_a:8:5,' ',F_b:8:5,' ',F_c:8:5,' ',selang:4,'   ',(c-a):8:5);
    
             epsilon :=(c-a);
             if(F_a * F_c <= 0) Then 
             Begin 
                b := c; 
                F_b := F_c 
             End 
             else 
             Begin 
                a := c; 
                F_a := F_c 
             End;
          End;
          writeln; 
          if(it<=max) Then
          Begin 
             writeln('Hampiran (pendekatan) nilai x = ',c:8:5);
             writeln('Pada Iterasi ke-',it);
          End 
          else writeln('Toleransi tidak terpenuhi, jumlah iterasi kurang'); 
       End; 
    End.
    
Print Friendly and PDF

Kamis, 26 Mei 2011

JAWABAN TUGAS ALPRO [TIPE SOAL A]


BUAT TEMAN² YG LAGI BINGGUNG SOAL TUGAS ALPRO DOWNLOAD JAWABAN NYA DISINI ....
EHHHH NTAR DULU...!!!!
DOWNLOAD SOALNYA JUGA YA...!!!!

SOAL A

NAK SEKARANG SILAHKAN DOWNLOAD JAWABANNYA...
SOKKK ATU DI SEDOT...!!!!
PASS NYA JUDUL LAGU YANG PALING SERING DI NYANYIKAN TIF_E WAKTU KBM DI TAMBAH HURUF Z SEBANYAK 5 X
Print Friendly and PDF
Related Posts Plugin for WordPress, Blogger...