Selasa, 11 Juni 2013

Struktur Data 4nd


#include<stdio.h>
#include<conio.h>
void insert(int);
int delet(int);
void display(void);
int queue[5];
int rear=-1;
int front=-1;

void main()
{
int n=5;
char op;
clrscr();
do
{
printf("\n\npilihan");
printf("\n1. Tambah Data");printf("\n2.Hapus Data");
printf("\n3. Tampilkan Data");
printf("\nTekan e untuk keluar");
printf("\nPilihan Anda :"); op=getche(); switch(op)
{
case '1':insert(n);break;
case '2':delet(n) ;break;
case '3':display();break;
default : printf ("\nwrong operator");}
}
while(op!='e');getch();
}
void insert(int n)
{
int item;
if((front==0&&rear==n)||(front==rear+1))
{printf("\nQueue over flow");
return;
}
if(front==-1)
{front=0 ; rear=0;}

else if (rear==n)
rear=0;
rear=rear+1;

printf("nMasukan Data : ");scanf("%d",&item);
queue[rear]=item;
}
int delet(int n)
{
int item;
if(front==-1)
{printf("\nQueue is empty");
}
printf("\nKamu Menghapus : %d",queue [front]);
queue[front] = 0;
if(front==rear)
{
front=-1;
rear=-1;
}
else if (front==n)
front=0;
else
front=front+1;
}
//////////////////////////////////////////////
void display(void)
{
int i;
printf("\nTampilkan Queue\n");
for(i=0;i<6;i++)
printf("%d ",queue[i]);
}

Selasa, 04 Juni 2013

Struktur Data 3nd


#include<stdio.h>
#include<conio.h>
//deklarasi 'stack' dengan struck dan array
typedef struct STACK
{
int data[5];
int atas;
};
//deklarasi variable 'tumpuk' dari struct
STACK tumpuk;
void main()
{
clrscr();
int pilihan, baru,i;
//inisialisasi awal
tumpuk.atas=-1;
do
{
clrscr();
printf("1.pust data\n");
printf("2.pop data\n");
printf("3.print data\n");
printf("\npilihan");
scanf("%i",&pilihan);
switch (pilihan)
{
case 1 :
{
if(tumpuk.atas==5-1)
{
printf("tumpukan penuh");
getch();
}
else
{
printf("data yang akan di-push=");
scanf("%d",&baru);
tumpuk.atas++;
tumpuk.data[tumpuk.atas]=baru;
}
break;
}

case 2 :
{
if (tumpuk.atas==-1)
{
printf("Tumpukan kosong");
getch();
}
else
{
printf("Data yang akan di -pop = %d", tumpuk.data[tumpuk.atas]);
tumpuk.atas--;
getch();
}
break;
}

case 3:
{
if (tumpuk.atas==-1)
{
printf("Tumpuk Kosong");
getch();
}
else
{
printf("Data = ");
for(i=0; i<=tumpuk.atas; i++)
{
printf("%d ",tumpuk.data[i]);
}
getch();
}
break;
}
defaul:
{
printf("\nTidak ada pilihan");
}
}
}
while(pilihan>=1 && pilihan<=3);
getch();
}

Selasa, 28 Mei 2013

Struktur Data 2nd

#include<stdio.h>
typedef struct Tnode
{
int value;
Tnode *next;
Tnode *back;
};

Tnode *baru, *bantu, *head, *tail;
void tambah (int value)
{
baru= new Tnode;
baru->next = baru;
baru->back = baru;
baru->value = value;
}
void tambahbelakang(int value)
{
tambah (value);
if(head==NULL)
head = tail = baru;
else {
tail->next = baru;
baru->back = tail;
tail=baru;
}
}

void tambahdepan (int value)
{
tambah (value);
if(head == NULL)
head = tail = baru;
else {
baru->next = head;
head->back = baru;
head=baru;
}
tail->next = head;
head->back = tail;
}

void cetak()
{
bantu = head;
do{
printf ("%d",bantu->value);
bantu= bantu->next;
}
while(bantu!=head);
}

void menu()
{
int pil;
int isi;
do{
printf("\nMenu : \n1. Masuk dari depan \n2. Masuk dari belakang \n3. Cetak \n4. Exit \n Masukan Pilihan anda : ");
scanf ("%d",&pil);
switch (pil){
case 1:
printf("Masukan nilai: ");scanf("%d",&isi);
tambahdepan (isi);
break;
case 2:
printf("Masukan nilai: ");scanf("%d",&isi);
tambahbelakang (isi);
break;
case 3 : cetak ();
break;
case 4:
printf ("Tidak Ada Pilihan Tersebut, Masukan Anka dari 1 sampai 3");
}
}
while (pil!=4);
}
int main ()
{
menu ();
return 0;
}

Selasa, 21 Mei 2013

Struktur Data 1nd


#include <iostream.h>
#include <conio.h>
struct Mahasiswa
{
int No;
char Nama [20];
char Nim [15];
float Tugas ;
float UTS;
float UAS;
char Nilai;
};
void input(Mahasiswa *mhs, int jumData)
{
cout<<endl;
for(int i=0; i<jumData; i++)
{
mhs[i]. No=i+1;
cout<<"No :"<<mhs[i].No<<endl;
cout<<"Nama :";
cin>>mhs[i].Nama;
cout<<"Nim :";
cin>>mhs[i].Nim;
cout<<"Nilai Tugas :";
cin>>mhs[i].Tugas;
cout<<"Nilai UTS:";
cin>>mhs[i].UTS;
cout<<"Nilai UAS:";
cin>>mhs[i].UAS;
cout<<endl;
}}
void prosesData(Mahasiswa *mhs, int jumData)
{
float nilai;
for(int i=0; i<jumData; i++)
{
nilai=(mhs[i].Tugas*0.3)+(mhs[i].UTS*0.3)+(mhs[i].UAS*0.4);
if(nilai>85)
mhs[i].Nilai='\A';
else if(nilai<85 && nilai>=75)
mhs[i].Nilai='\B';
else if(nilai<75 && nilai>=60)
mhs[i].Nilai='\C';
else if(nilai<60 && nilai>=50)
mhs[i].Nilai='\D';
else if(nilai<50)
mhs[i].Nilai='\E';
}
}
void cetak(Mahasiswa *mhs, int jumData)
{
clrscr();
cout<<"-----------------------------------------------------\n";
cout<<"No Nim Nama Tugas UTS UAS Nilai\n";
cout<<"-----------------------------------------------------\n";
int y=4;
for(int i=0; i<jumData; i++)
{
cout<<mhs[i].No;              gotoxy(5,y);
cout<<mhs[i].Nim;             gotoxy(15,y);
cout<<mhs[i].Nama;            gotoxy(30,y);
cout<<mhs[i].Tugas;           gotoxy(38,y);
cout<<mhs[i].UTS;             gotoxy(46,y);
cout<<mhs[i].UAS;             gotoxy(54,y);
cout<<mhs[i].Nilai<<endl;     y++;
}
cout<<"----------------------------------------------------\n";
}
void main()
{
int jumData;
Mahasiswa*mhs;
cout<<"Masukan jumlah data :";
cin>>jumData;
mhs=new Mahasiswa[jumData];
input(mhs,jumData);
prosesData(mhs,jumData);
cetak(mhs,jumData);
}

Minggu, 21 April 2013

Movie Cinema Tiga Satu










A -----------------------------------------------------------------------------------------------------------


B -----------------------------------------------------------------------------------------------------------

C -----------------------------------------------------------------------------------------------------------

D -----------------------------------------------------------------------------------------------------------

E -----------------------------------------------------------------------------------------------------------

F ------------------------------------------------------------------------------------------------------------

G ------------------------------------------------------------------------------------------------------------

H ------------------------------------------------------------------------------------------------------------

I ------------------------------------------------------------------------------------------------------------

J ------------------------------------------------------------------------------------------------------------

K ------------------------------------------------------------------------------------------------------------

L ------------------------------------------------------------------------------------------------------------

M ------------------------------------------------------------------------------------------------------------

N ------------------------------------------------------------------------------------------------------------

O ------------------------------------------------------------------------------------------------------------

P ------------------------------------------------------------------------------------------------------------

Q ------------------------------------------------------------------------------------------------------------

R ------------------------------------------------------------------------------------------------------------

S ------------------------------------------------------------------------------------------------------------

T ------------------------------------------------------------------------------------------------------------

U ------------------------------------------------------------------------------------------------------------

V ------------------------------------------------------------------------------------------------------------

W ------------------------------------------------------------------------------------------------------------

X ------------------------------------------------------------------------------------------------------------

Y ------------------------------------------------------------------------------------------------------------

Z ------------------------------------------------------------------------------------------------------------

0-9 -----------------------------------------------------------------------------------------------------------