Modern Futuristic Unique Design

latest articles

Transaksi & Report pada Aplikasi OnlineShop

Assalamualaikum.Wr.Wb   pada matakuliah Pemrograman Web Dinamis kami mendapatkan tugas proyek yang dikerjakan secara berkelompok dan kelompok kami mengambil tema OnlineShop , disni saya mendapatkan bagian tentang Transaksi dan Report . TAMPILAN AWAL PEMBELIAN  sourcode : <div class="col-sm-4"> <div class="panel panel-primary"> <div class="panel-heading"> <?php echo $value['nama_produk']; ?></div> <div class="panel-body">...

Read more

MEMBUAT DONAT 3D BERGERAK OPENGL VS 2008

#include <iostream> #include <windows.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stdarg.h> #include <glut.h> #include <math.h> GLfloat xRotated, yRotated, zRotated; GLdouble innerRaidus=0.5; GLdouble outterRaidus=1; GLint sides =30; GLint rings =30; int i=0; int a=0; float j=0; float k=0; bool ket = true; void donat(void) {     glMatrixMode(GL_MODELVIEW);    ...

Read more

PROGRAM ENQUEUE DAN DEQUEUE DENGAN PRIORITAS

#include <iostream>#include <windows.h>#include <stdio.h>#define maks 5using namespace std;class Queue {            friend ostream& operator<<(ostream&, const Queue&);      public :                     Queue();             void print();//deklrasi fungsi cetak             void enqueue(int);//deklrasi fungsi enqueue             int penuh(int); //deklrasi variabel  penuh             int kosong(int);//deklrasi variabel  kosong             int dequeue();//deklrasi variabel  dequeue             int PrioritasMax();//deklrasi variabel prioritas besar             int PrioritasMin();//deklrasi...

Read more

MENAMPILKAN DERET BILANGAN PRIMA DARI YANG TERBESAR

#include <iostream>using namespace std;int main(){  int batas, x, cek, i;cout<<"Batas atas dari Deret Bilangan Prima : ";cin>>batas;cout<<endl;cout<<"Deret Bilangan Prima "<<batas<<" adalah: "<<endl<<endl;  for ( x=batas; x>=2; x--){   cek = 2;   for (i = 2; i < x; i++){    if (x % i == 0){     cek = 1;     }     }   ...

Read more

Membuat BENTUK Kerucut 3D VS 2008

Dengan menggunakan format Cpp. #include<windows.h>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<stdarg.h>#include<glut.h>void kerucut(){glClear(GL_COLOR_BUFFER_BIT);//1glBegin(GL_LINE_LOOP);glVertex2f(-0.4,-0.6);glVertex2f(-0.4,0.2);glVertex2f(-0.1,0);glVertex2f(-0.1,-0.8);glEnd();glFlush();//2glBegin(GL_LINE_LOOP);glVertex2f(-0.4,-0.6);glVertex2f(-0.4,0.2);glVertex2f(-0.2,0.4);glVertex2f(-0.2,-0.4);glEnd();glFlush();//3glBegin(GL_LINE_LOOP);glVertex2f(-0.2,-0.4);glVertex2f(-0.2,0.4);glVertex2f(0,0.4);glVertex2f(0,-0.4);glEnd();glFlush();//4glBegin(GL_LINE_LOOP);glVertex2f(0,-0.4);glVertex2f(0,0.4);glVertex2f(0.2,0.2);glVertex2f(0.2,-0.6);glEnd();glFlush();//5glBegin(GL_LINE_LOOP);glVertex2f(-0.1,-0.8);glVertex2f(-0.1,0);glVertex2f(0.2,0.2);glVertex2f(0.2,-0.6);glEnd();glFlush();//segitiga//1glBegin(GL_LINE_LOOP);glVertex2f(-0.4,0.2);glVertex2f(-0.1,0.9);glVertex2f(-0.1,0);glEnd();glFlush();//2glBegin(GL_LINE_LOOP);glVertex2f(-0.2,0.4);glVertex2f(-0.1,0.9);glVertex2f(-0.4,0.2);glEnd();glFlush();//3glBegin(GL_LINE_LOOP);glVertex2f(-0.2,0.4);glVertex2f(-0.1,0.9);glVertex2f(0,0.4);glEnd();glFlush();//4glBegin(GL_LINE_LOOP);glVertex2f(0,0.4);glVertex2f(-0.1,0.9);glVertex2f(0.2,0.2);glEnd();glFlush();//5glBegin(GL_LINE_LOOP);glVertex2f(-0.1,0);glVertex2f(-0.1,0.9);glVertex2f(0.2,0.2);glEnd();glFlush();}int main(int argc, char**argv){glutCreateWindow("");glutDisplayFunc(kerucut);glutMainLoop();} Hasil compile ...

Read more

PROGRAM LINKED LIST MENGHAPUS BELAKANG DAN TENGAH

#include <cstdlib>#include <iostream>using namespace std;struct node{   int data;   node *next;       };class Linkedlist{    public:       Linkedlist();       void tambahDepan(int x);       void hapusBelakang();       void hapusTengah(int x);       void cetak();    private:       node *link;       int jml;};Linkedlist::Linkedlist(){   cout<<"Program Linked List"<<endl;   jml = 0;}void Linkedlist::tambahDepan(int x){   node *temp;   temp = new node;   temp->data = x;   temp->next = NULL;  ...

Read more

PROGRAM MENGGABUNGKAN 2 STACK MENJADI 1

#include <iostream>#include <conio.h>using namespace std;struct node{char data;node *next;};   void stack1(int x,int banyak,node *temp,node *top,node *isi){   //stack3(x,banyak,temp,top,isi);    if(banyak==0){        isi=temp;        isi->next=NULL;    }else{        temp->next=isi;        isi=temp;    }    banyak++;   if(x<=5){  cout<<x<<" ";  }}void stack2(int x,int banyak,node *temp,node *top,node *isi){   if(banyak==0){        isi=temp;        isi->next=NULL;    }else{        temp->next=isi;        isi=temp;    }   ...

Read more