Home
MODUL 7 : STACK
Disusun Oleh :
Kristianus Unang
201101018
Dosen :
Yosef Murya Kusuma Ardhana, S.T
Jurusan Sistem Informasi
Sekolah Tinggi Ilmu Komputer ( STIKOM )
" Yos Sudarso "
Purwokerto
---------------------------------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------------------------------
Laporan Praktikum 7.1 (borland edition)
script
#include <iostream.h>
#include <conio.h>
#include <string.h>
#define MAX_STACK 10
struct STACK {
int top;
char data[10][10];
};STACK tumpuk;
int inisialisasi()
{
tumpuk.top=-1;
}
int IsFull()
{
if(tumpuk.top== MAX_STACK-1) return 1; else return 0;
}
int IsEmpty()
{
if(tumpuk.top==-1) return 1; else 0;
}
int Push(char d[10])
{
tumpuk.top++;
strcpy(tumpuk.data[tumpuk.top],d);
}
int Pop()
{
cout<<"Data yang terambil = "<<tumpuk.data[tumpuk.top];
tumpuk.top--;
}
int TampilStack()
{
for(int i=tumpuk.top;i>=0;i--)
{
cout<<"Data: "<<tumpuk.data[i]<<endl;
}
}
int Clear()
{
tumpuk.top=-1;
}
main()
{
int pil;
inisialisasi();
char dt[10];
do{
cout<<"1. push\n";
cout<<"2. pop\n";
cout<<"3. clear\n";
cout<<"4. exit\n";
cout<<"Pilihan: ";
cin>>pil;
switch(pil)
{
case 1 : if(IsFull()!=1){
cout<<"Data = ";
cin>>dt;
Push(dt);
}
else
cout<<"\n STACK PENUH\n";
break;
case 2 : if(IsEmpty()!=1){
Pop();
}else
cout<<"\n STACK KOSONG\n";
break;
case 3 : if(IsEmpty()!=1){
TampilStack();
}else
cout<<"\n STACK KOSONG\n";
break;
case 4 : Clear();
cout<<"\n STACK SUDAH KOSONG\n";
break;
}
getche();
}while(pil !=5);
getche();
}
#include <conio.h>
#include <string.h>
#define MAX_STACK 10
struct STACK {
int top;
char data[10][10];
};STACK tumpuk;
int inisialisasi()
{
tumpuk.top=-1;
}
int IsFull()
{
if(tumpuk.top== MAX_STACK-1) return 1; else return 0;
}
int IsEmpty()
{
if(tumpuk.top==-1) return 1; else 0;
}
int Push(char d[10])
{
tumpuk.top++;
strcpy(tumpuk.data[tumpuk.top],d);
}
int Pop()
{
cout<<"Data yang terambil = "<<tumpuk.data[tumpuk.top];
tumpuk.top--;
}
int TampilStack()
{
for(int i=tumpuk.top;i>=0;i--)
{
cout<<"Data: "<<tumpuk.data[i]<<endl;
}
}
int Clear()
{
tumpuk.top=-1;
}
main()
{
int pil;
inisialisasi();
char dt[10];
do{
cout<<"1. push\n";
cout<<"2. pop\n";
cout<<"3. clear\n";
cout<<"4. exit\n";
cout<<"Pilihan: ";
cin>>pil;
switch(pil)
{
case 1 : if(IsFull()!=1){
cout<<"Data = ";
cin>>dt;
Push(dt);
}
else
cout<<"\n STACK PENUH\n";
break;
case 2 : if(IsEmpty()!=1){
Pop();
}else
cout<<"\n STACK KOSONG\n";
break;
case 3 : if(IsEmpty()!=1){
TampilStack();
}else
cout<<"\n STACK KOSONG\n";
break;
case 4 : Clear();
cout<<"\n STACK SUDAH KOSONG\n";
break;
}
getche();
}while(pil !=5);
getche();
}
screenshoot program
 |
| 7.1 |
Laporan Praktikum 7.1 (eclipse edition )
script
#include <iostream>
#include <string.h>
using namespace std;
#define MAX_STACK 10
struct STACK
{
int top;
char data[10][10];
};STACK tumpuk;
void inisialisasi()
{
tumpuk.top=-1;
}
int IsFull()
{
if(tumpuk.top== MAX_STACK-1) return 1; else return 0;
}
int IsEmpty()
{
if(tumpuk.top==-1) return 1; else 0;
}
int Push(char d[10])
{
tumpuk.top++;
strcpy (tumpuk.data[tumpuk.top],d);
}
int Pop()
{
cout<<"Data yang terambil = "<<tumpuk.data[tumpuk.top]<<endl;
tumpuk.top--;
}
int TampilStack()
{
for(int i=tumpuk.top;i>=0;i--)
{
cout<<"Data: "<<tumpuk.data[i]<<endl;
}
}
void Clear()
{
tumpuk.top=-1;
}
main()
{
int pil;
inisialisasi();
char dt[10];
do{
cout<<"++++++++++++++\n";
cout<<"1. push\n";
cout<<"2. pop\n";
cout<<"3. print\n";
cout<<"4. clear\n";
cout<<"5. exit\n";
cout<<"---------------\n";
cout<<"Pilihan: ";
cin>>pil;
cout<<"---------------\n";
cout<<"++++++++++++++\n";
cout<<endl;
switch(pil)
{
case 1 : if(IsFull()!=1){
cout<<"Data = ";
cin>>dt;
Push(dt);
cout<<"\n";
}
else
cout<<"STACK PENUH\n\n";
break;
case 2 : if(IsEmpty()!=1){
Pop();
cout<<"\n";
}else
cout<<"STACK KOSONG\n\n";
break;
case 3 : if(IsEmpty()!=1){
TampilStack();
cout<<"\n";
}else
cout<<"STACK KOSONG\n\n";
break;
case 4 : Clear();
cout<<"STACK SUDAH KOSONG\n\n";
break;
}
}while(pil !=5);
return 0;
}
screenshoot program
 |
| 7.1 |
--------------------------------------------------------------------------------------------------------------------- ---------------------------------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------------------------------
Tidak ada komentar:
Posting Komentar