Diberdayakan oleh Blogger.
RSS
Powered By Blogger

Penjumlahan 2 Polinomial

Coding :

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

class poli{
friend ostream& operator << (ostream& , poli& );
friend istream& operator >> (istream& , poli& );
public:
poli();
void penjumlahan(const poli&, const poli&);
void nilai(int);
private:
int elemen[100];
int banyak;
};

poli::poli(){
for(int i=0;i<banyak;i++)
elemen[i];
}
istream& operator >> (istream& in, poli& a){
cout<<"banyak elemen : "; in>>a.banyak;
cout<<"masukkan data polinomial : \n";
for(int i=0;i<a.banyak;i++){
cout<<"variabel pangkat "<<i<<" :";
cin>>a.elemen[i];
}
return in;
}
void poli::nilai(int i){
banyak= i;
}
ostream& operator << (ostream& out, poli& a){

for(int i=(a.banyak-1); i>=0; i--){
        cout<<a.elemen[i];
        if(i!=0) cout<<"x^"<<i<<"+";
        }
cout<<endl;
return out;
}
void poli::penjumlahan(const poli& a, const poli& b){
if(a.banyak>b.banyak)banyak=a.banyak;
else banyak=b.banyak;
for(int i=0;i<banyak;i++){
if ((a.banyak-1)<i) elemen[i]=b.elemen[i];
else if ((b.banyak-1)<i) elemen[i]=a.elemen[i];
else elemen[i]=a.elemen[i]+b.elemen[i];
}
}

int main(){
poli x, y, z;
cin>>x;
cout<<x;
cin>> y;
cout<<y;
z.penjumlahan(x,y);
cout<<"\n\nhasil penjumlahan 2 polinomial\n"<<z<<endl;
getch();
return 0;
}


Hasil :

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Uji Kompetensi 04


Uji Kompetensi 04
1.Menambah di depan
void insertDepan(int databaru){
TNode *baru,*bantu;
baru = new TNode;
baru->data = databaru;
baru->next = baru;
if(isEmpty()==1){
head=baru;
head->next=head;
}
else {
bantu = head;
while(bantu->next!=head){
bantu=bantu->next;
}
baru->next = head;
head = baru;
bantu->next = head;
}
printf(”Data masuk\n“);
}
2. Menambah elemen dibelakang
void insertBelakang (int databaru){
TNode *baru,*bantu;
baru = new TNode;
baru->data = databaru;
baru->next = baru;
if(isEmpty()==1){
head=baru;
head->next=head;
}
else {
bantu = head;
while(bantu->next != head){
bantu=bantu->next;
}
bantu->next = baru;
baru->next = head;
}
printf(”Data masuk\n“);
}

3. Menghapus elemen di depan
void hapusDepan (){
TNode *hapus,*bantu;
if (isEmpty()==0){
int d;
hapus = head;
d = head->data;
if(head->next != head){
bantu = head;
while(bantu->next!=head){
bantu=bantu->next;
}
head = head->next;
delete hapus;
bantu->next = head;
}else{
head=NULL;
}
printf(“%d terhapus\n“,d);
} else printf(”Masih kosong\n“);
}

4. Menghapus elemen dibelakang
void hapusBelakang(){
TNode *hapus,*bantu;
if (isEmpty()==0){
int d;
hapus = head;
if(head->next == head){
head = NULL;
}else{
bantu = head;
while(bantu->next->next != head){
bantu = bantu->next;
}
hapus = bantu->next;
d = bantu->data;
bantu->next = head;
delete hapus;
}
printf(“%d terhapus\n“,d);
} else printf(”Masih kosong\n“);
}

5. Mencari elemen
Ketemu  = false;
N=1;
While ((N<ukuran) and (not ketemu)) do
If (array[n]=kunci)then
Ketemu = true {data ketemu}
i = n {pada posisi ke – i}
end if
else n = n+1 {cek data berikutnya}
end while
if ketemu then pencarianLinier = I {data ketemu pada posisi ke-i}
else pencarianLinier = -1 {data tidak ketemu}
end if




  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Uji Kompetensi 2 no.1


#include <cstdlib>
#include <iostream>

using namespace std;

class hit{
      private:
              double s,l,p,t,luba,voba,luku,voku;
              double as,ts,tp,lp,vp,ls,ks;
              double pi,r,vobo,lubo;
      public:
             double lubaku();
             double lupris();
             double lubol();
             };
            
double hit::lubaku(){
    cout<<"input lebar:";
    cin>>l;
    cout<<"input panjang:";
    cin>>p;
    cout<<"input tinggi:";
    cin>>t;
    cout<<"input sisi kubus:";
    cin>>s;
    luba=2*((p*l)+(p*t)+(l*t));
    voba=p*l*t;
    luku=6*(s*s);
    voku=s*s*s;
    cout<<"Volum Kubus: "<<voku<<endl;
    cout<<"Volume Balok: "<<voba<<endl;
    cout<<"Luas Permukaan Kubus: "<<luku<<endl;
    cout<<"Luas Permukaan Balok: "<<luba<<endl;
    cout<<endl;
    }
   
double hit::lupris(){
    cout<<"input alas segitiga: ";
    cin>>as;
    cout<<"input tinggi segitiga: ";
    cin>>ts;
    cout<<"input tinggi prisma: ";
    cin>>tp;
    ls=0.5*(as*ts);
    ks=(2*ts)+as;
    lp=(2*ls)+(ks*tp);
    vp=ls*ts;
    cout<<"Volume Prisma: "<<vp<<endl;
    cout<<"Luas Permukaan Prisma: "<<lp<<endl;
    cout<<endl;
}

double hit::lubol(){
       cout<<"input jari-jari: ";
       cin>>r;
       pi=3.14;
       lubo=4*pi*(r*r);
       vobo=pi*(r*r*r);
       cout<<"Luas Permukaan Bola: "<<lubo<<endl;
       cout<<"Volume Bola: "<<vobo<<endl;
       cout<<endl;
       }

   
int main(int argc, char *argv[])
{
    hit c;
    c.lubaku();
    c.lupris();
    c.lubol();
    system("PAUSE");
    return EXIT_SUCCESS;
}

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Program Absensi Kelas


#include <cstdlib>
#include <iostream>
#include <math.h>

using namespace std;

int main(int argc, char *argv[])
{
    system("TITLE Wakhid Firmansyah/11018044");
     int nim [25];
     char nama[25][30];
     char tt[25];
     int jumInput;


    for(int i=0;i<2000;i++){
    cout<<"\t\t\t|";
            }
    system("cls");
cout<<"\n\n\n\n\n\n\n\t\t\t+---------------------------------+"<<endl;
cout<<"\t\t\t     | +-----------------------------+ |"<<endl;
    cout<<"\t\t\t  | |      Uji Kompetensi SData      | |"<<endl;
    cout<<"\t\t\t  | |        --  ABSENSi--              | |"<<endl;
    cout<<"\t\t\t  | |     < Wakhid/11018044 >     | |"<<endl;
    cout<<"\t\t\t  | +-----------------------------+ |"<<endl;
    cout<<"\t\t\t +---------------------------------+\n\n\n\n\n\n\n\n";
    system("pause");
    system("cls");
    cout<<"\n\n\n\tMasukkan jumlah Mahasiswa : ";
    cin>>jumInput;
    cout<<endl<<endl;
    system("pause");
    system("cls");
    cout<<"\n\n\t\t\t +--------------------------------+\n";
    cout<<"\t\t\t |   -> Input Data Mahasiswa <-   |\n";
    cout<<"\t\t\t +--------------------------------+\n\n\n";
    for(int i=0;i<jumInput;i++){
    wakhid:
    cout<<"  NIM :";
    cin>>nim[i];
    cout<<"  Nama Mahasiswa "<<i+1<<"  : ";
    cin>>nama[i];
    cout<<"  Tanda Tangan : ";

 
    }
    cout<<endl;
    system("cls");
    cout<<"\n\n\t\t\t +--------------------------------+\n";
    cout<<"\t\t\t |   -> Output Data Mahasiswa <-  |\n";
    cout<<"\t\t\t +--------------------------------+\n\n";
    cout<<endl<<endl;
    cout<<"   |---- |--------------|----------------------|-------------|"<<endl;
    cout<<"   | No |   NIM          | Nama Mahasiswa     |    Tanda      |"<<endl;
    cout<<"   |       |                     |                                 |    Tangan    |"<<endl;
    cout<<"   |---- |--------------|----------------------|-------------|"<<endl;
    for(int i=0;i<jumInput;i++){
        cout.setf(ios::left|ios::showpoint);
cout<<"   | ";
cout.width(3);
cout<<i+1;
cout<<"| ";
cout.width(13);
cout<<nim[i];
cout<<"| ";
cout.width(21);
cout<<nama[i];
cout<<"| ";
cout.width(12);
cout<<tt[i];
cout.precision(5);
cout<<"|\n";
    }
    cout<<"   |----|--------------|----------------------|-------------|"<<endl;
    cout<<endl;
    system("PAUSE");
    return EXIT_SUCCESS;
}


  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Fungsi Rekursif untuk Menghitung Jumlah Deret


#include <iostream.h>
Long L(Int n)
{ if ((n==0 || (n==1)) return(1);
Else return (n*L(n-1)+1);
}

main (){
int n;
long hasil;
cout<<”input n:”;
cin>>n;
hasil=L(n);
cout<<”Nilai”<<n<<”!=”<<hasil;
return 0;
}

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Subprogram x pangkat n dengan Cara Rekursif


#include <iostream.h>
Long L(Int n)
{ if ((n==0 || (n==1)) return(1);
Else return (n*L(n-1)+1);
}

main (){
int n;
long hasil;
cout<<”input n:”;
cin>>n;
hasil=L(n);
cout<<”Nilai”<<n<<”!=”<<hasil;
return 0;
}

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Mencetak bilangan 1-10 secara Iteratif


#include <iostream.h>
Main(){
Int I;
For(i=1;i<=10;i++)
Cout<<” “<<i;
Return 0;
}

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

Bilangan Fibonaci dengan Cara Iteratif


#include <cstdlib>
#include <iostream>

using namespace std;


    int fibonacci(int n)
{
  int u = 0;
  int v = 1;
  int i, t;

  for(i = 2; i <= n; i++)
  {
    t = u + v;
    u = v;
    v = t;
  }
   system("PAUSE");
  return v;
}

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS