DSA:STACK

/**
* @(#)Stackx.java
*
*
* @author
* @version 1.00 2008/9/3
*/

import java.io.*;
class Mstack {
int maxsize;
String[] stack;
int top;
public Mstack(int s)
{
maxsize=s;
stack=new String[maxsize];
top=-1;
}
public void push(String j)
{
stack[++top]=j;
}
public String pop()
{
return (stack[top--]);
}
public String peek()
{
return (stack[top]);
}
public boolean isEmpty()
{
return(top==-1);
}
public boolean isFull()
{
return(top==maxsize-1);
}
public static void main (String[] args)
{
Mstack stk=new Mstack(10);
int j=0;
String a;
try {
DataInputStream x=new DataInputStream(System.in);
while(j<5)
{
System.out.println("Please enter ur choice:");
System.out.println("1.PUSH AN ITEM ");
System.out.println("2.POP AN ITEM ");
System.out.println("3.PEEK AN ITEM ");
System.out.println("4.DISPLAY THE WHOLE STACK ");
System.out.println("5.EXIT");

j=Integer.parseInt(x.readLine());
switch(j)
{
case 1:
System.out.println("ENTER THE ITEM: ");
a=x.readLine();
stk.push(a);
break;
case 2:
System.out.println("THE ITEM IS: "+stk.pop());

break;

case 3:
System.out.println("THE ITEM IS: "+stk.peek());

break;

case 4:
System.out.println("THE ITEMS IN LIFO ORDER IS:" );
while (!stk.isEmpty())
{
System.out.print("-->"+ stk.pop());
}
System.out.println("" );
break;
case 5:
System.out.println("THANK U: ");
break;
}
}
}
catch(Exception e) {}
}
}