/*Contoh double stack*/
#include "stdio.h"
#include "conio.h"
#define MAX 50
#define true 1
#define false 0
char stack[MAX];
int top1, top2;
void init(void);
void push(char data, int nomorstack);
char pop(int nomorstack);
void clear(int nomorstack);
int full(void);
int empty(int nomorstack);
void baca();
main(){
char data;
int pilih, nomorstack;
init();
do{
clrscr();
printf("Contoh program double stack");
printf("\n1. Push");
printf("\n2. Pop");
printf("\n3. Clear");
printf("\n4. Baca");
printf("\n5. Selesai...");
printf("\nPilihan anda : \n");
scanf("%i",&pilih);
switch(pilih){
case 1: printf("Push\n");
printf("Masukkan datanya :\n"); scanf("%s",&data);
printf("Mau dimasukkan ke stack berapa ? 1 atau 2 ? :\n");
scanf("%i",&nomorstack);
push(data, nomorstack);
break;
case 2: printf("Pop\n");
printf("Masukkan nomor stack\n");
scanf("%i",&nomorstack);
data=pop(nomorstack);
printf("\nData yang dikeluarkan adalah %s", data);
break;
case 3: printf("Clear\n");
printf("Nomor Stack yang akan dikosongkan \n");
scanf("%i",&nomorstack);
clear(nomorstack);
break;
case 4: printf("Baca\n");
baca();
break;
case 5: printf("Exit");
break;
default: printf("Pilihan yang anda masukkan tidak ada");
break;
}
}while(pilih!=5);
getch();
}
//init
void init(){
top1=0;
top2=MAX+1;
}
//PUSH
void push(char data, int nomorstack){
if(full()!=true){
switch(nomorstack){
case 1: top1++;
stack[top1]=data;
break;
case 2: top2--;
stack[top2]=data;
break;
default: printf("\nNomor stack salah");
break;
}
}
else
printf("\nStack penuh");
getch();
}
//POP
char pop(int nomorstack){
char data;
if(empty(nomorstack)!=true){
switch(nomorstack){
case 1: data=stack[top1];
top1--;
return data;
break;
case 2: data=stack[top2];
top2++;
return data;
break;
default: printf("\nNomor stack salah");
break;
}
}
else printf("\nStack masih kosong");
getch();
return 0;
}
//cek full
int full(void){
if(top1+1>=top2){
return true;
}
else return false;
}
//cek empty
int empty(int nomorstack){
switch(nomorstack){
case 1: if(top1==0) return true;
else return false;
break;
case 2: if(top2==MAX+1) return true;
else return false;
break;
default: printf("nomor stack salah");
break;
}
}
//clearing
void clear(int nomorstack){
switch(nomorstack){
case 1: top1=0;
break;
case 2: top2=MAX+1;
break;
default: printf("Nomor stack salah");
break;
}
}
void baca(){
int i;
printf("Baca isi stack pertama \n");
for(i=1; i<=top1; i++){
printf(" %c ",stack[i]);
printf("\n");
}
printf("Isi stack kedua\n");
for(i=MAX; i>=top2; i--){
printf(" %c ",stack[i]);
printf("\n");
}
getch();
}
#define MAX 50
#define true 1
#define false 0
char stack[MAX];
int top1, top2;
void init(){
top1=0;
top2=MAX+1;
}
int full(void){
if(top1+1>=top2){
return true;
}
else return false;
}
int empty(int nomorstack){
switch(nomorstack){
case 1: if(top1==0) return true;
else return false;
break;
case 2: if(top2==MAX+1) return true;
else return false;
break;
default: printf("nomor stack salah");
break;
}
}
void clear(int nomorstack){
switch(nomorstack){
case 1: top1=0;
break;
case 2: top2=MAX+1;
break;
default: printf("Nomor stack salah");
break;
}
}
void push(char data, int nomorstack){
if(full()!=true){
switch(nomorstack){
case 1: top1++;
stack[top1]=data;
break;
case 2: top2--;
stack[top2]=data;
break;
default: printf("\nNomor stack salah");
break;
}
}
else
printf("\nStack penuh");
getch();
}
char pop(int nomorstack){
char data;
if(empty(nomorstack)!=true){
switch(nomorstack){
case 1: data=stack[top1];
top1--;
return data;
break;
case 2: data=stack[top2];
top2++;
return data;
break;
default: printf("\nNomor stack salah");
break;
}
}
else printf("\nStack masih kosong");
getch();
return 0;
}
mahasiswa@perpustakaan-desktop:~$python
print "Hello HellKnight ^_^"
a= 5 (enter)
b= 6 (enter)
a+b (enter)
https://addons.mozilla.org/en-US/firefox/addon/public-fox/
/*------------------------------*/
/* Contoh Program Stack Tunggal*/
/* Pratama Nur Wijaya */
/*-----------------------------*/
#include "stdio.h"
//GLOBAL VARIABLE
#define MAX 50
#define true 1
#define false 0
char stack[MAX];
int top;
//inisialisasi fungsi
void init(void);
int full(void);
int empty(void);
char pop(void);
void clear(void);
void push(char info);
void baca(void);
//main function
main(){
//local variable
char pilih, elm;
printf("--- Contoh Program Single Stack --\n");
init(); //jalankan fungsi init
do{
printf("Operasi Single Stack :\n");
printf("1. PUSH\n");
printf("2. POP\n");
printf("3. CLEAR\n");
printf("4. BACA\n");
printf("5. Selesai\n");
printf(" Pilihan anda :");
scanf("%s", &pilih);
switch(pilih){
case '1' : printf("PUSH ");
scanf("%s",&elm);
push(elm);
break;
case '2' : elm=pop();
printf("POP %c\n", elm);
break;
case '3' : clear();
break;
case '4' : baca();
break;
case '5' : break;
default : printf("Salah Pilih. . . \n");
break;
}
printf("\n");
}while(pilih!='5');
}
//end main function
void init(){
top=0;
}
void push(char info){
if(full()!=true){
top++;
stack[top]=info;
}
else
printf("Stack overflow. . . . \n");
}
char pop(){
char info;
if(empty()!=true){
info=stack[top];
top--;
return(info);
}
else printf("stack underflow. . . \n");
}
void clear(){
top=0;
}
int full(){
if(top==MAX){
return(true);
}
else {
return(false);
}
}
int empty(){
if(top==0) return(true);
else return(false);
}
void baca(){
int i;
printf("Isi stack. . . \n");
if(top>0){
for(i=1; i<=top; i++)
printf("%c", stack[i]);
}
else
printf("Stack kosong. . .\n");
}
cd /etc/default/
gedit console-setup
XKBMODEL=”SKIP”
XKBLAYOUT=”us”
XKBVARIANT=”U.S. English”
XKBOPTIONS=”"
XKBMODEL=”pc105?
XKBLAYOUT=”us”
XKBVARIANT=”"
XKBOPTIONS=”"
sudo reboot
http://www.mediafire.com/?5k4525h9p8syad1
Dalam ilmu komputer, stack atau tumpukan merupakan sebuah koleksi objek yang menggunakan prinsip LIFO (Last In First Out), yaitu data yang terakhr kali dimasukkan akan pertama kali keluar dari stack tersebut. Stack dapat diimplementasikan sebagai representasi berkait atau kontigu (dengan tabel fix
#define MAX 50
#define true 1
#define false 0
char stack[MAX];
int top
void init(void)
{
top=0;
}
int full(void){
if(top==MAX) return(true);
else return(false);
}
int empty(void){
if(top==0) return(true);
else return(false);
}
void clear(void){
top-0;
cout<<"Stack dikosongkan";
}
void push(char info){
if(full()!=true)
{
top++;
stack[top]=info;
}
else cout<<"Stack penuh";
}
char pop(void){
char info;
if(empty()!=true)
{
info=stack[top];
top--;
return[info];
}
else cout<<"Stack kosong";
}
man gcc
gcc -o nama_file nama_file_source.c
./nama_file
<code>
codenya. . . .
</code>
</head>
<body onload="prettyPrint();">
