Question

A stack is a kind of data structure which can store elements with the restriction that an element can be added or removed from the top only. 

The details of the class Stack is given below: 

Class name: Stack 

Data members/instance variables: 

st[]: the array to hold the names 

size: the maximum capacity of the string array 

top: the index of the topmost element of the stack

ctr: to count the number of elements of the stack Member functions: 

Stack( ): default constructor 

Stack(int cap): constructor to initialize size = cap and top = -1 

void pushname(String n): to push a name onto the stack. If the stack is full, display 

the message “OVERFLOW” 

String popname(): removes a name from the top of the stack and returns it. 

If the stack is empty, display the message “UNDERFLOW” 

void display(): Display the elements of the stack

Specify class Stack giving details of the constructors(), void pushname(String n), String popname() and void display().

THE MAIN() FUNCTION AND ALGORITHM NEED NOT BE WRITTEN.

Answer 1

Class Stack 

{ 

String ST [ ]; 

int size; 

int top; 

int etr; 

Stack( ) 

{ 

for(int i = 0; 

i <10; i++) St [i] = " "; 

size = 0; 

top = 0; 

ctr = 0; 

Stack(int cap) 

{ 

size = cap 

St [size];

top = -1 ; 

void pushname (String n) 

{ 

if (top = = (size - 1)) 

System.out.println (''overflow''); 

else 

{ 

top ++; 

St [top] = n;

}

} 

String popname( ) 

{ 

String v; 

if(top = = -1) 

System.out.println(''underflow "); 

else 

{ v = St[top]; 

System.out.println("poped element is''+'' : " + v); 

top--; 

} 

} 

void display 

{ 

if(top == -1) 

System.out.println(''empty''); 

else 

{

for (int i = top-1; i > = 0 ; i--) 

{ 

System.out.println(St [i]): 

} 

} 

}

Comments

Thank you