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 :
TAMPILAN SETELAH DI KLIK BUY
sourcode :
TAMPILAN SETELAH DIKLIK BAYAR
Sourcode :
Read more
#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);
glClear(GL_COLOR_BUFFER_BIT);
glLoadIdentity();
glTranslatef(0.0,0.0,-4.5);
glColor3f(0.8, 0.6, 0.8);
glRotatef(xRotated,1.0,0.0,0.0);
glRotatef(yRotated,0.0,1.0,0.0);
glRotatef(zRotated,0.0,0.0,1.0);
glScalef(1.0,1.0,1.0);
glutSolidTorus(innerRaidus,outterRaidus,sides,rings);
glFlush();
}
void tengil(int x, int y)
{
if (y == 0 || x == 0) return;
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
gluPerspective(40.0,(GLdouble)x/(GLdouble)y,0.5,20.0);
glViewport(0,0,x,y);
}
void idleTorus(){
glPushMatrix();
glRotated(i, 8, 1, 0);
donat();
i = i + 0.1;
a = a + 0.1;
yRotated += 0.08;
}
void geser(){
glPushMatrix();
glRotated(90,1,0,0);
//glTranslated(k,0,0);
donat();
glPopMatrix();
}
int main (int argc, char **argv)
{
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);
glutInitWindowSize(400,350);
glutCreateWindow("1500018153");
glPolygonMode(GL_FRONT_AND_BACK,GL_LINE);
xRotated = yRotated = zRotated = 10.0;
xRotated=33;
yRotated=40;
glClearColor(0.0,0.0,0.0,0.0);
glutDisplayFunc(donat);
glutReshapeFunc(tengil);
glutIdleFunc(idleTorus);
glutMainLoop();
return 0;
}
Read more
#include <iostream>
#include <windows.h>
#include <stdio.h>
#define maks 5
using 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 variabel prioritaas kecil
int maxsi();//deklrasi variabel max
int indeksMak();//deklrasi variabel indek max
int min();//deklrasi variabel min
int indeksMin();//deklrasi variabel index min
private :
int A[maks];///deklarasi array A (maks)
int banyak;//deklarasi varibael banyak
};
//menampilkan isi antrian
ostream& operator<<(ostream& out, const Queue& s){
cout << "\nIsi Queue : ";
for (int i=s.banyak-1; i>=0; i--)
out << s.A[i] << " ";
}
//operasi antrian
Queue::Queue() {
banyak = 0;//variabel bnayak sama dengan 0
for (int i=0; i<maks; i++)
A[i] = '0';
}
//operasi kondisi saat penuh
int Queue::penuh(int s){
return s == maks ? 1 : 0;
}
//operasi kondisi saat kosong
int Queue::kosong(int s) {
return s == 0 ? 1 : 0;
}
//operasi fungsi cetak antrian
void Queue::print(){
cout << "\nIsi Queue : ";
for (int i=0; i<banyak; i++)
cout << A[i] << " ";
}
//operasi fungsi masuk antrian
void Queue::enqueue(int x){
cout << x << " MASUK";
if (penuh(banyak)) cout << "queue penuh";
else {
A[banyak] = x;
banyak++;
}
}
//operasi keluar antrian
int Queue::dequeue() {
if(banyak == 0) cout<<"Data masih kosong."<<endl;
else {
int temp=A[0];
cout << "\nDequeue elemen --> " << temp;
banyak--;
for(int i=0;i<5;i++){
A[i] = A[i+1];
}
return temp;
}
}
//operasi antrian bilangan besar
int Queue::maxsi(){
int mak;
for(int i=0;i<banyak;i++){
if(i==0){
mak = A[i];
} else {
if(mak < A[i]){
mak = A[i];
}
}
}
return mak;
}
//operasi indek ke antrian
int Queue::indeksMak(){
int dek;
for(int i=0;i<banyak;i++){
if(A[i] == maxsi()){
dek = i;
break;
}
}
return dek;
}
//operasi antrian bilangan prioritas besar
int Queue::PrioritasMax(){
int dequeue;
int ind;
if(banyak == 0)cout<<"DATA KOSONG"<<endl;
else {
dequeue = maxsi();
ind = indeksMak();
for(int i=0;i<banyak;i++){
if(i>=ind){
A[i] = A[i+1];
}
}
banyak--;
}
return dequeue;
}
//operasi antrian kecil
int Queue::min(){
int min;
for(int i=0;i<banyak;i++){
if(i==0){
min = A[i];
} else {
if(min > A[i]){
min = A[i];
}
}
}
return min;
}
//operasi memnentukan indek bilangan kecil
int Queue::indeksMin(){
int dek;
for(int i=0;i<banyak;i++){
if(A[i] == min()){
dek = i;
break;
}
}
return dek;
}
int Queue::PrioritasMin(){//prioritas kecil
int dequeue;
int ind;
if(banyak == 0)cout<<"Data masih kosong."<<endl;
else {
dequeue = min();
ind = indeksMin();
for(int i=0;i<banyak;i++){
if(i>=ind){
A[i] = A[i+1];
}
}
banyak--;
}
return dequeue;
}
int main() {
int r;//deklrasi variabel r
int m;//deklarasi variabel m
Queue q;
home :
//MENU UTAMA
cout<<endl<<"Pilih menu utama: "<<endl<<endl;
cout<<"1. ASCENDING PRIORITAS ";
cout<<"2. DESCENDING PRIORITAS ";
cout<<endl<<endl;
cout<<"pilih menu : "; cin>>r;//input pilihan ke menu dengan variabel x
switch(r){
case 1 : //pemilihan 1
goto ascending;//masuk ascending
break;
case 2 ://pemilihan 2
goto descending;//masuk descending
break;
case 3 ://pemilihan 3
goto ext;//keluar
break;
default :
goto home;//masuk awal utama
break;
}
descending :
cout<<endl<<"DESCENDING PRIORITAS QUEUE: "<<endl;
cout<<"1. ENQUE"<<endl;
cout<<"2. DENQUE"<<endl;
cout<<"3. TAMPILKAN"<<endl;
cout<<"4. EXIT"<<endl;
cout<<"masukkan menu ke : "; cin>>r;//input elemen ke variabel x
switch(r){
case 1 :
cout<<"Masukkan data : "; cin>>m;//input elemen ke m
q.enqueue(m);//varibael q sama dengan m
goto descending;//masuk descending
break;
case 2 :
cout<<"Yang di dequeue adalah "<<q.PrioritasMax()<<endl;//menampilkan hasil deque variabel q
goto descending;//masuk deqending
break;
case 3 :
q.print();//mencetak variabel q
goto descending;//masuk desecending
break;
case 4 ://pemilihan 4
goto home;//masuk menu awal
break;
default :
goto descending;//masuk descending
break;
}
//min
ascending :
cout<<endl<<"ASCENDING PRIORITAS : "<<endl;
cout<<"1. ENQUE"<<endl;//Outtput Enque
cout<<"2. DEQUE"<<endl;//output DEque
cout<<"3. TAMPILKAN"<<endl;//output tampilkan
cout<<"4. EXIT"<<endl;//output keluar
cout<<"masukkan menu ke : "; cin>>r;//pemilihan dengan input var.x
switch(r){
case 1 : //pemilihan 1
cout<<"MASUK ANTRIAN : "; cin>>m;//input antrian ke variabel m
q.enqueue(m);//antrian q sama dengan m
goto ascending;//masuk ke ascending
break;
case 2 :
cout<<"YANG KELUAR = "<<q.PrioritasMin()<<endl;//menampilkan elemen keluar prio.kecil
goto ascending;//masuk ke ascending
break;
case 3 ://pemilihan 3
q.print();//mencetak variabel q
goto ascending;//masuk ke ascending
break;
case 4 ://pemilihan 4
goto home;//masuk ke menu awal home
break;
default :
goto ascending;//masuk ke ascending
break;
}
ext :
system("PAUSE");
return 0;
}
hasil Compile :
Read more
#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;
}
}
if (cek == 2){
cout<<x<<", ";
}
}
return 0;
}
HASIL COMPILE :
Read more
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);
//1
glBegin(GL_LINE_LOOP);
glVertex2f(-0.4,-0.6);
glVertex2f(-0.4,0.2);
glVertex2f(-0.1,0);
glVertex2f(-0.1,-0.8);
glEnd();
glFlush();
//2
glBegin(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();
//3
glBegin(GL_LINE_LOOP);
glVertex2f(-0.2,-0.4);
glVertex2f(-0.2,0.4);
glVertex2f(0,0.4);
glVertex2f(0,-0.4);
glEnd();
glFlush();
//4
glBegin(GL_LINE_LOOP);
glVertex2f(0,-0.4);
glVertex2f(0,0.4);
glVertex2f(0.2,0.2);
glVertex2f(0.2,-0.6);
glEnd();
glFlush();
//5
glBegin(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
//1
glBegin(GL_LINE_LOOP);
glVertex2f(-0.4,0.2);
glVertex2f(-0.1,0.9);
glVertex2f(-0.1,0);
glEnd();
glFlush();
//2
glBegin(GL_LINE_LOOP);
glVertex2f(-0.2,0.4);
glVertex2f(-0.1,0.9);
glVertex2f(-0.4,0.2);
glEnd();
glFlush();
//3
glBegin(GL_LINE_LOOP);
glVertex2f(-0.2,0.4);
glVertex2f(-0.1,0.9);
glVertex2f(0,0.4);
glEnd();
glFlush();
//4
glBegin(GL_LINE_LOOP);
glVertex2f(0,0.4);
glVertex2f(-0.1,0.9);
glVertex2f(0.2,0.2);
glEnd();
glFlush();
//5
glBegin(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
#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;
if(jml==0){
link = temp;
link->next = NULL;
}else{
temp->next = link;
link = temp;
}
jml++;
}
void Linkedlist::hapusBelakang(){
node *temp;
node *prev;
prev=link;
temp=link->next;
if(jml==0){
cout<<"data masih kosong"<<endl;
}else{
while(temp->next!=NULL){
temp = temp->next;
prev=prev->next;
}
prev->next=NULL;
delete temp;
}
}
void Linkedlist::hapusTengah(int y){
node *after;
node *prev;
node *del;
prev=link;
int i=1;
if(jml==0){
cout<<"data masih kosong"<<endl;
}else{
while(i!=y){
prev=prev->next;
i++;
}
del=prev->next;
after=del->next;
prev->next=after;
delete del;
}
}
void Linkedlist::cetak(){
node *temp;
temp = link;
cout<<"Banyak data di Linked List : "<<jml<<endl;
while(temp!=NULL){
cout<< temp->data <<" -> ";
temp = temp->next;
}
cout<<endl;
}
int main(int argc, char *argv[])
{ Linkedlist newLink;
newLink.tambahDepan(1);
newLink.tambahDepan(2);
newLink.tambahDepan(3);
newLink.tambahDepan(4);
newLink.tambahDepan(5);
newLink.tambahDepan(6);
cout<<endl;
newLink.cetak();
cout<<endl;
cout<<"hapus data dibelakang"<<endl;
newLink.hapusBelakang();
newLink.cetak();
cout<<endl;
cout<<"hapus data ditengah"<<endl;
newLink.hapusTengah(2);
newLink.cetak();
cout<<endl;
system("PAUSE");
return 0;
}
Read more
#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;
}
banyak++;
if(x>5){
cout<<x<<" ";
}
}
void stack3(int x,int banyak,node *temp,node *top,node *isi){
stack1(x,banyak,temp,top,isi);
stack2(x,banyak,temp,top,isi);
}
int main(){
int banyak,x;
banyak=0;
node *isi;
node*top;
node *temp;
temp =new node;
temp->data=x;
temp->next=NULL;
top=temp;
cout<<"Stack 1 = ";
for(int i=1;i<=10;i++){
stack1(i,banyak,temp,top,isi);
}
cout<<endl<<endl<<"Stack 2 = ";
for(int i=1;i<=10;i++){
stack2(i,banyak,temp,top,isi);
}
cout<<endl<<endl<<"Stack 3 = ";
for(int i=1;i<=10;i++){
stack3(i,banyak,temp,top,isi);
}
getch();
}
Read more
03.32
By
Unknown
sourcode :
Sourcode :
