FUNGSI, CLASS, REKURSIF, FAKTORIAL, QUEUE, DAN STACK

#include #include #define nil NULL #define max 5 #define stack_max 5 #include using namespace std; //FAKTORIAL===================================================================// int faktorial(int f){ int rumus; if(f==0) return 1; else rumus = f*faktorial(f-1); cout<<" "<l='A'; head=data1; data2=(struct linked*)malloc(sizeof(struct linked)); data2->l='B'; data1->next=data2; data3=(struct linked*)malloc(sizeof(struct linked)); data3->l='C'; data2->next=data3; data3->next=nil; //LINKED LIST=================================================================// for(char ulang='y'; ulang=='y' || ulang=='Y';){ cout<<"================================================================================"<>pilih; system("cls"); switch(pilih){ case 1: cout<<"================================================================================"<>r; cout<<" = "<>f; cout<<" = "<>sisi; cout<<"MASUKAN PANJANG : "; cin>>panjang; cout<<"MASUKAN LEBAR : "; cin>>lebar; cout<<"LUAS PERSEGI : "<l<l<l<>kode; switch(kode){ case 1: if(antri.belakang==(max-1)) { cout<<"ANTRIAN PENUH"<>x; antri.data[antri.belakang]=x; cout<<"DATA "<<" "<>x; antri.belakang++; antri.data[antri.belakang]=x; cout<<"DATA "<<" "<0 && kode<4); return 0; break; case 6: do{ cout<>pilihan; switch(pilihan){ case 1: if(tumpuk.top==(stack_max-1)) { cout<<"TUMPUKAN PENUH"<>x; tumpuk.top++; tumpuk.data[tumpuk.top]=x; } break; case 2: if(tumpuk.top==-1) { cout<<"TUMPUKAN KOSONG"<=0; i--) { cout<<"TUMPUKAN : "<0 && pilihan<4); break; case 7: cout<<"ANDA TELAH KELUAR DARI PROGRAM"< : "; cin>>ulang; system("cls"); } }

Read More

FUNGSI, CLASS, REKURSIF, FAKTORIAL, QUEUE, DAN STACK

#include #include #define nil NULL #define max 5 #define stack_max 5 #include using namespace std; //FAKTORIAL===================================================================// int faktorial(int f){ int rumus; if(f==0) return 1; else rumus = f*faktorial(f-1); cout<<" "<l='A'; head=data1; data2=(struct linked*)malloc(sizeof(struct linked)); data2->l='B'; data1->next=data2; data3=(struct linked*)malloc(sizeof(struct linked)); data3->l='C'; data2->next=data3; data3->next=nil; //LINKED LIST=================================================================// for(char ulang='y'; ulang=='y' || ulang=='Y';){ cout<<"================================================================================"<>pilih; system("cls"); switch(pilih){ case 1: cout<<"================================================================================"<>r; cout<<" = "<>f; cout<<" = "<>sisi; cout<<"MASUKAN PANJANG : "; cin>>panjang; cout<<"MASUKAN LEBAR : "; cin>>lebar; cout<<"LUAS PERSEGI : "<l<l<l<>kode; switch(kode){ case 1: if(antri.belakang==(max-1)) { cout<<"ANTRIAN PENUH"<>x; antri.data[antri.belakang]=x; cout<<"DATA "<<" "<>x; antri.belakang++; antri.data[antri.belakang]=x; cout<<"DATA "<<" "<0 && kode<4); return 0; break; case 6: do{ cout<>pilihan; switch(pilihan){ case 1: if(tumpuk.top==(stack_max-1)) { cout<<"TUMPUKAN PENUH"<>x; tumpuk.top++; tumpuk.data[tumpuk.top]=x; } break; case 2: if(tumpuk.top==-1) { cout<<"TUMPUKAN KOSONG"<=0; i--) { cout<<"TUMPUKAN : "<0 && pilihan<4); break; case 7: cout<<"ANDA TELAH KELUAR DARI PROGRAM"< : "; cin>>ulang; system("cls"); } }

Read More

QUEUE LINKED LIST

#include #include #include #include #include struct node{ int data; struct node *link; }; struct node *cur,*first,*last; int create(); int insert(); int delte(); int display(); int create() { printf("\nENTER THE FIRST ELEMENT: "); cur=(struct node *)malloc(sizeof(struct node)); scanf("%d",&cur->data); cur->link=NULL; first=cur; last=cur; } int insert() { printf("\nENTER THE NEXT ELEMENT: "); cur=(struct node *)malloc(sizeof(struct node)); scanf("%d",&cur->data); cur->link=NULL; last->link=cur; last=cur; } int delte() { if(first==NULL) { printf("\t\nQUEUE IS EMPTY\n"); } else { cur=first; first=first->link; cur->link=NULL; printf("\n DELETED ELEMENT IS %d\n",cur->data); free(cur); } } int display() { cur=first; printf("\n"); while(cur!=NULL) { printf("\t%d",cur->data); cur=cur->link; } } int main() { int ch; while(1) { printf("\nPROGRAM QUEUE LINKED LIST\n"); printf("\n 1. CREATE \n 2. INSERT \n 3. DELETE \n 4. DISPLAY \n 5. EXIT \n"); printf("\nENTER YOUR CHOICE : "); scanf("%d",&ch); system("cls"); switch(ch) { case 1: create(); display(); cout<

Read More

Menghitung Volum Bangun Ruang

sedot lagi gan materi ini #include #include float v_balok(float a, float b, float c){ return (a*b*c); } float v_kubus(float d){ return (d*d*d); } float v_kerucut(float e, float f){ float pi = 3.14; return (pi*e*e*f)/3; } float v_bola(float g){ float pi = 3.14; return (4*pi*g*g*g)/3; } int main(){ char pil; float pi = 3.14; float p, l, t, s, r; int kode; for(char ulang = 'y'; ulang == 'y' || ulang =='Y' ; ){ cout<<" PROGRAM MENGHITUNG BANGUN RUANG "<>ulang; system("cls"); } }

Read More

sedot sedot ilmunya #include using namespace std; class mahasiswa{ public: int algoritma() {return krs_algoritma;} int organisasi() {return krs_organisasi;} int ski() {return krs_ski;} int diskrit(){return krs_diskrit;} int arab(){return krs_arab;} int islam(){return krs_islam;} int so(){return krs_so;} int ppk(){return krs_ppk;} int sks_algoritma(int); void sks_organisasi(int); void sks_ski(int); void sks_diskrit(int); void sks_arab(int); void sks_islam(int); void sks_so(int); void sks_ppk(int); private: int krs_algoritma; int krs_organisasi; int krs_ski; int krs_diskrit; int krs_arab; int krs_islam; int krs_so; int krs_ppk; }; int mahasiswa::sks_algoritma(int x){krs_algoritma=x;} void mahasiswa::sks_organisasi(int x){krs_organisasi=x;} void mahasiswa::sks_ski(int x){krs_ski=x;} void mahasiswa::sks_diskrit(int x){krs_diskrit=x;} void mahasiswa::sks_arab(int x){krs_arab=x;} void mahasiswa::sks_islam(int x){krs_islam=x;} void mahasiswa::sks_so(int x){krs_so=x;} void mahasiswa::sks_ppk(int a){krs_ppk=a;} int main(){ mahasiswa pak_sumar, pak_awik, bu_herawati, pak_landung, tim, pak_mukalam, pak_bambang, tim_ppk; pak_sumar.sks_algoritma(4); pak_awik.sks_organisasi(3); bu_herawati.sks_ski(2); pak_landung.sks_diskrit(2); tim.sks_arab(2); pak_mukalam.sks_islam(2); pak_bambang.sks_so(4); tim_ppk.sks_ppk(1); cout<<"NIM : 12651088"<

Read More

Program Menghitung Volume Bangun Ruang Menggunakan Fungsi

#include #include float v_balok(float a, float b, float c){ return (a*b*c); } float v_kubus(float d){ return (d*d*d); } float v_kerucut(float e, float f){ float pi = 3.14; return (pi*e*e*f)/3; } float v_bola(float g){ float pi = 3.14; return (4*pi*g*g*g)/4; } int main(){ char pil; float pi = 3.14; float p, l, t, s, r; int kode; for(char ulang = 'y'; ulang == 'y' || ulang =='Y' ; ){ cout<<" PROGRAM MENGHITUNG BANGUN RUANG "< ?"; cin>>pil; }else if (kode==5){ cout<<"Terima Kasih"<>ulang; system("cls"); } } Selamat Mencoba dan Semoga Bermanfaat

Read More

Program class dan fungsi

#include using namespace std; class mahasiswa{ public: int algoritma() {return krs_algoritma;} int organisasi() {return krs_organisasi;} int ski() {return krs_ski;} int diskrit(){return krs_diskrit;} int arab(){return krs_arab;} int islam(){return krs_islam;} int so(){return krs_so;} int ppk(){return krs_ppk;} void sks_algoritma(int); void sks_organisasi(int); void sks_ski(int); void sks_diskrit(int); void sks_arab(int); void sks_islam(int); void sks_so(int); void sks_ppk(int); private: int krs_algoritma; int krs_organisasi; int krs_ski; int krs_diskrit; int krs_arab; int krs_islam; int krs_so; int krs_ppk; }; void mahasiswa::sks_algoritma(int x){krs_algoritma=x;} void mahasiswa::sks_organisasi(int x){krs_organisasi=x;} void mahasiswa::sks_ski(int x){krs_ski=x;} void mahasiswa::sks_diskrit(int x){krs_diskrit=x;} void mahasiswa::sks_arab(int x){krs_arab=x;} void mahasiswa::sks_islam(int x){krs_islam=x;} void mahasiswa::sks_so(int x){krs_so=x;} void mahasiswa::sks_ppk(int x){krs_ppk=x;} int main(){ mahasiswa pak_sumar, pak_awik, bu_herawati, pak_landung, tim, pak_mukalam, pak_bambang, tim_ppk; pak_sumar.sks_algoritma(4); pak_awik.sks_organisasi(3); bu_herawati.sks_ski(2); pak_landung.sks_diskrit(2); tim.sks_arab(2); pak_mukalam.sks_islam(2); pak_bambang.sks_so(4); tim_ppk.sks_ppk(1); cout<<"NIM : 12651088"<

Read More