JAVA program

Question

Write a java program that if the STACK is full it wont add element and display the msg that STACK is full. and Write a program when the Stack is empty display the msg stack is empty.

Shweta Lodha · Answer

package algorithm.stack; public class TNStack { private int size; private int [] stackArr; private int top = - 1 ; public TNStack( int size) { this .size = size; stackArr = new int [size]; } /** * increment the ctr and push element into stack * @param i element to be pushed */ public void push( int i) { top++; System.out.println( "Pushing " +i); stackArr[top] = i; } /** * pop the element from stack and decrement the ctr * @return the popped element */ public int pop() { int i = stackArr[top]; top--; System.out.println( "Popping " +i); return i; } public int peek() { System.out.println( "Peek " +stackArr[top]); return stackArr[top]; } public boolean isFull() { return (top == size- 1 ); } public boolean isEmpty() { return (top == - 1 ); } } package algorithm.stack; /** * @author ntallapa * */ public class TNStackClient { /** * @param args */ public static void main(String[] args) { TNStack tns = new TNStack( 3 ); // push some elements if (!tns.isFull()) tns.push( 4 ); if (!tns.isFull()) tns.push( 5 ); if (!tns.isFull()) tns.push( 3 ); if (!tns.isFull()) tns.push( 6 ); else System.out.println( "Stack is full, cannot push element" ); // pop some elements if (!tns.isEmpty()) tns.pop(); if (!tns.isEmpty()) tns.pop(); if (!tns.isEmpty()) tns.pop(); if (!tns.isEmpty()) tns.pop(); else System.out.println( "Stack is empty, cannot pop element" ); //reinsert to verify peek method if (!tns.isFull()) tns.push( 6 ); // peek couple of times; result should be same tns.peek(); tns.peek(); } } Original link: http://tekmarathon.wordpress.com/2013/03/12/stack-implementation-in-java/comment-page-1/

Abhishek Jaiswal · Answer

no there is no limit but u can define.

Lakshmanan Sethu Sankaranarayan · Answer

Hi Abhi Do you have any limit on the no of the items to be inserted in the stack?