Implement a stack using an array as discussed in class. Make your stack size 5.

Question

Implement a stack using an array as discussed in class. Make your stack size 5. Stack() creates an empty stacks, stacks is new and empty. push(item) adds a new item to the stacks, stacks is modified. pop() removes and returns an item, stacks is modified. isEmpty() returns a boolean and tests for an empty stacks, stacks is not modified. size() returns the int size of the stacks, stacks is not modified print() prints the stacks from front to rear, stacks is not modified. top() prints the front element, stacks is not modified. Driver should print the results of the following push("dog") push("cat") push("mouse") push("pig") push("bird") size() push("puppy") size() PoP() PoP() size() PoP() top() PoP() PoP() size() isEmpty()

Explanation / Answer

import java.util.*;

/* Class arrayStack */
class arrayStack
{
protected int arr[];
protected int top, size, len;
/* Constructor for arrayStack */
public arrayStack(int n)
{
size = n;
len = 0;
arr = new int[size];
top = -1;
}
/* Function to check if stack is empty */
public boolean isEmpty()
{
return top == -1;
}
/* Function to check if stack is full */
public boolean isFull()
{
return top == size -1 ;
}
/* Function to get the size of the stack */
public int getSize()
{
return len ;
}
/* Function to check the top element of the stack */
public int top()
{
if( isEmpty() )
throw new NoSuchElementException("Underflow Exception");
return arr[top];
}
/* Function to add an element to the stack */
public void push(int i)
{
if(top + 1 >= size)
throw new IndexOutOfBoundsException("Overflow Exception");
if(top + 1 < size )
arr[++top] = i;
len++ ;
}
/* Function to delete an element from the stack */
public int pop()
{
if( isEmpty() )
throw new NoSuchElementException("Underflow Exception");
len-- ;
return arr[top--];
}
/* Function to display the status of the stack */
public void display()
{
System.out.print(" Stack = ");
if (len == 0)
{
System.out.print("Empty ");
return ;
}
for (int i = top; i >= 0; i--)
System.out.print(arr[i]+" ");
System.out.println();
}
}

/* Class StackImplement */
public class StackImplement
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.println("Stack Test ");
System.out.println("Enter Size of Integer Stack ");
int n = scan.nextInt();
/* Creating object of class arrayStack */
arrayStack stk = new arrayStack(n);
/* Perform Stack Operations */
char ch;
do{
System.out.println(" Stack Operations");
System.out.println("1. push");
System.out.println("2. pop");
System.out.println("3. top");
System.out.println("4. check empty");
System.out.println("5. check full");
System.out.println("6. size");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println("Enter integer element to push");
try
{
stk.push( scan.nextInt() );
}
catch (Exception e)
{
System.out.println("Error : " + e.getMessage());
}   
break;   
case 2 :
try
{
System.out.println("Popped Element = " + stk.pop());
}
catch (Exception e)
{
System.out.println("Error : " + e.getMessage());
}
break;   
case 3 :   
try
{
System.out.println("top Element = " + stk.top());
}
catch (Exception e)
{
System.out.println("Error : " + e.getMessage());
}
break;   
case 4 :
System.out.println("Empty status = " + stk.isEmpty());
break;
case 5 :
System.out.println("Full status = " + stk.isFull());
break;   
case 6 :
System.out.println("Size = " + stk.getSize());
break;   
default :
System.out.println("Wrong Entry ");
break;
}
/* display stack */
stk.display();
System.out.println(" Do you want to continue (Type y or n) ");
ch = scan.next().charAt(0);

} while (ch == 'Y'|| ch == 'y');   
}
}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.