Question

JAVA PLEASE

Exercise 1: Build our own stack Do our own stack data structure for char's Use a simple array to hold the stack(pop, push, peek, search, isEmpty, size)

Answer 1

/*Source code of the above program is given below*/

/*NOTE: If you want to change something or want in a different way, please let me know through comments; I will surely revert back to you.*/

/***************OwnStack.java*******************/

import java.util.EmptyStackException;

public class OwnStack {

public static final int MAXSIZE=500;

  

public OwnStack()

{

topLoc = -1;

item = new char[MAXSIZE];

}

public boolean isEmpty()

{ return (topLoc==-1); }

  

public boolean isFull()

{ return (topLoc==MAXSIZE-1); }

  

public void push(char newVal)

{

if(isFull())

{

System.out.println("Stack is Full!!");

return;

}

topLoc++;

item[topLoc] = newVal;

size++;

}

public char peek()

{

if (isEmpty()) {

throw new EmptyStackException();

}

return item[topLoc];

}

public char pop()

{

if (isEmpty()) {

throw new EmptyStackException();

}

size--;

return item[topLoc--];

}

public int size() {

return size;

}

public boolean search(char c)

{

for(int i=0;i<size;i++)

{

if(item[i]==c)

return true;

}

return false;

}

private int topLoc;

private char[] item;

int size;

}

/***************TestStack.java********************/

public class TestStack {

public static void main(String[] args) {

OwnStack os = new OwnStack();

os.push('a');

os.push('d');

os.push('B');

os.push('N');

System.out.println("The size of the current stack: "+os.size());

System.out.println("The top element in the current stack: "+os.peek());

os.pop();

os.pop();

System.out.println("After 2 pop() the size of the current stack: "+os.size());

System.out.println("The top element in the current stack: "+os.peek());

System.out.println("The element 'a' is present in the current stack: "+os.search('a'));

}

}

/**************OUTPUT************************/

2 public class TestStack { 4 public static void main(String[] args) 6 OwnStack os = new OwnStack(); os.push('a) os.push ('d); os.push ('B; os.push('N'); System.out.println("The size of the current stack:"+os.size) System.out.println("The top element in the current stack: "+os.peek()); os.pop(); os.pop(); System.out.println("After 2 pop() the size of the current stack: "+os.size()); System.out.println("The top element in the current stack: "+os.peek()); System.out.println("The element 'a' is present in the current stack: "+os.search('a')); 7 10 12 13 14 16 18 19 @ Javadoc ® Declaration貝Console X i.Coverage <terminated> TestStack [Java Application C:\Program FilesJavajre1.8.0_161\binjavaw.exe (Apr 12, 2018, 9:29:36 PM) The size of the current stack: 4 The top element in the current stack: N After 2 pop() the size of the current stack: 2 The top element in the current stack: d The element 'a' is present in the current stack: true

/*If this helps you, please let me know by giving a positive thumbs up. In case you have any queries, do let me know. I will revert back to you. Thank you!!*/