Question

stack.h template class Stack{ public: Stack(int max = 10); ~Stack() {delete [] stack;} bool isEmpty() const { return top == -1; } bool isFull() const { return top == MaxStackSize; } T peek() const; void push(const T& x); void pop(); private: int top; int MaxTop; T * stack; } source.cpp What is printed by the following program segment? Stack s; int n; s.push(4); s.push(6); s.push(8); while(!s.isEmpty()) { n = s.peek(); cout << n << ‘ ‘; s.pop(); } cout<< endl; s.push(4); s.push(6); s.push(8); int n2 = s.peek(); s.pop(); n = s.peek(); s.push(n2); cout<< n << endl; while(!s.isEmpty()) { cout<< s.peek()<<’ ‘; s.pop(); }

What is printed

Answer 1

Mainly the following basic operations are performed in the stack:

• Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.
• Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.
• Peek or Top: Returns top element of stack.
• isEmpty: Returns true if stack is empty, else false.

Output:

 8 6 4 6 8 6 4 

For better debugging try putting a print stack statement after every stack operation is done