Minggu, 16 Desember 2012

program gue..by alfi

gw alfinah..
ini buat pengguna blog,,semoga bermanfaat..!!








#include <stdio.h>
#include <iostream.h>
#include <conio.h>
main()
{
char np[20],kode,jenis,*judul;
int jumbel,harga,th,pot,tobay,ubay,ukem;

cout<<"\n\t\tJAZZY MUSIKINDO "<<endl;
cout<<"\n penjualan tiket konser "<<endl;
cout<<"\n\t\t*************************************\n";
cout<<"\n Nama Pembeli              : ";cin>>np;
cout<<"\n kode konser [1/2/3]       : ";cin>>kode;
cout<<"\n jenis tiket"<<endl;
cout<<"\n a. tribune"<<endl;
cout<<"\n b. vip"<<endl;
cout<<"\n c. wip"<<endl;
cout<<"\n pilih jenis tiket         : ";cin>>jenis;
cout<<"\n jumlah beli               : ";cin>>jumbel;

if(kode=='1')
{ judul="java jazz festival";
 if(jenis=='A'||jenis=='a')
 { harga=50000; }
  else if (jenis=='B'||jenis=='b')
  { harga=75000; }
  else if (jenis=='C'||jenis=='c')
  { harga=100000; }
}
else if(kode=='2')
{ judul="young diva in concert";
 if(jenis=='A'||jenis=='a')
 { harga=50000; }
  else if (jenis=='B'||jenis=='b')
  { harga=100000; }
  else if (jenis=='C'||jenis=='c')
  { harga=150000; }
}
else if(kode=='3')
{ judul="la light indiefest";
 if(jenis=='A'||jenis=='a')
 { harga=50000; }
  else if (jenis=='B'||jenis=='b')
  { harga=90000; }
  else if (jenis=='C'||jenis=='c')
  { harga=130000; }
}



clrscr();
cout<<"\n JAZZY MUSIKINDO "<<endl;
cout<<"\n penjualan tiket konser "<<endl;
cout<<"\n\t\t*************************************"<<endl;
cout<<"\n Nama Pembeli              : "<<np<<endl;
cout<<"\n judul konser              : "<<judul<<endl;
cout<<"\n jenis tiket               : "<<jenis<<endl;
cout<<"\n harga tiket               : Rp. "<<harga<<endl;
cout<<"\n jumlah beli               : "<<jumbel<<endl;
cout<<"\n\t\t*************************************"<<endl;
th=jumbel*harga;
cout<<"\n total harga               : Rp.  "<<th<<endl;

if(jumbel>=5)
{ pot=0.1*th; }
else
{ pot=0; }

cout<<"\n potongan                  : Rp.  "<<pot<<endl;
tobay=th-pot;
cout<<"\n total bayar               : Rp.  "<<tobay<<endl;
cout<<"\n\t\t*************************************"<<endl;
cout<<"\n uang bayar                : Rp. ";cin>>ubay;
ukem=ubay-tobay;
cout<<"\n uang kembali              : Rp. "<<ukem<<endl;
cout<<"\n\t\t*************************************"<<endl;

cout<<"\n have fun and enjoy the show..."<<endl;
getch();

}





program array 1.. by alfii

# include <stdio.h>
# include <conio.h>
# include <iostream.h>
# include <iomanip.h>
main()
{
char np[15],kd[5][25],nb[20][25],lagi; //kd[5][25]-->[5] banyak digit, [25]-->arraynya
int i,j;
float hrg[25],jml[25],tot[25];
awal:
clrscr();
printf("PT. Arta Bakery");
cout<<endl;
cout<<"JL. Akasi No.10 telp (0333) 414346"<<endl;
cout<<"----------------------------------------------"<<endl;
cout<<"Masukan nama pembeli :";cin>>np;
cout<<"Masukan Jumlah Data  :";cin>>j;
for(i=1;i<=j;i++)
{
cout<<"Data Ke - "<<i<<endl;
cout<<"Masukan Kode Roti  :";cin>>kd[i];
cout<<"Masukan Nama Roti  :";cin>>nb[i];
cout<<"Masukan Harga Roti :";cin>>hrg[i];
cout<<"Masukan Jumlah Beli  :";cin>>jml[i];
tot[i]=hrg[i]*jml[i];
cout<<endl;
}
clrscr();
cout<<endl;
cout<<"             PT. Arta Bakery"<<endl;
cout<<"    JL. Akasia No.10 telp (0333) 414346"<<endl;
cout<<endl;
cout<<"Nama Pembeli  : "<<np<<endl;
cout<<"======================================================"<<endl;
cout<<"No.  Kode      Nama      Harga      Jumlah     Total  "<<endl;
cout<<"     Roti      Roti      Roti       Beli       Bayar"<<endl;
cout<<"======================================================"<<endl;
for(i=1;i<=j;i++)
{
    cout<<setiosflags(ios::left)<<setw(5)<<i; //jarak antar no dan kode 5 digit
    cout<<setiosflags(ios::left)<<setw(10)<<kd[i];
    cout<<setiosflags(ios::left)<<setw(10)<<nb[i];
    cout<<setiosflags(ios::left)<<setw(11)<<hrg[i];
    cout<<setiosflags(ios::left)<<setw(11)<<jml[i];
    cout<<setiosflags(ios::left)<<setw(8)<<tot[i]<<endl;
}
cout<<"======================================================"<<endl;
cout<<"Mau input data lagi [Y/T] =";cin>>lagi;
 if (lagi=='Y'|| lagi=='y')
  goto awal;
 else
  goto akhir;
 akhir:
 clrscr();cout<<endl;cout<<"TERIMA KASIH ATAS KEDATANGANNYA";
getch();
}

Minggu, 02 Desember 2012

LTM pertemuan 11(logika n algoritma)

Tugas Logika & Algoritma LTM 11

  1. Terdapat deret bilangan : 
 80 , 45 , 21 , 100 , 23 , 67 , 43 , 20 , 90 , 99 , 46 , 75 , 73 , 29
Buat algoritma utk mencari angka 99 dgn teknik LINEAR SEARCH
Jawab :
1.      I = 1 , x = 99
2.      Nilai I  <> Nilai x , 80 <> 99
3.      I = 1 +1 = 2
4.      Nilai I <> Nilai x , 45 <> 99
5.      I = 2 + 1 = 3
6.      Nilai I <> Nilai x , 21 <> 99
7.      I = 3 + 1 = 4
8.      Nilai I <> Nilai x , 100 <> 99
9.      I = 4 + 1 = 5
10.  Nilai I <> Nilai x , 23 <> 99
11.  I = 5 + 1 = 6
12.  Nilai I <> Nilai x , 67 <> 99
13.  I = 6 + 1 = 7
14.  Nilai I <> Nilai x , 43 <> 99
15.  I = 7 + 1 = 8
16.  Nilai I <> Nilai x , 20 <> 99
17.  I = 8 + 1 = 9
18.  Nilai I <> Nilai x , 90 <> 99
19.  I = 9 + 1 = 10
20.  Nilai I = Nilai x , 99 = 99 , maka pencarian selesai
Jadi, I = 10 , x = 99

  1. Terdapat deret angka :
12 , 16 , 20 , 25 , 29 , 34 , 45 , 56 , 60 , 67 , 70 , 78 , 89 , 93 , 99
Buat algoritma utk mencari angka 25 dgn teknik BINARY SEARCH
Jawab :
    1. L = 1 , H = 15 , X = 25
    2. L <= H à 1 <= 15 , maka  Mid = ( L + H ) / 2
          = ( 1 + 15 ) / 2
Mid   = 8
    1. X < Mid à 25 < 56 , maka  H = Mid – 1 à  = 8 - 1
                                                                             H = 7
    1. L <= H à 1 <= 7 , maka Mid = ( L + H ) / 2 à = ( 1 + 7 ) / 2
                                                               Mid = 4
    1. X = Mid à 25 = 25 , maka pencarian selesai.
Jadi untuk  X = 25 , maka  L = 1 , H = 7



  1. Terdapat deret angka :
34 , 67 , 12 , 40 , 66 , 18 , 90
Buat algoritma utk mencari nilai Max & Min dg teknik STRAIT MAXMIN, dan tentukan jml ops Perbandingannya.
 Jawab :
Elemen max =90, & elemen min = 12.
Jmlh operasi perbandingannya  = 3 n / 2 – 1
                                                            = 3.7 /2 – 1
                                                            = 9 kali satuan operasi.