Data Structures | Stack | Question 4

Consider the following pseudocode that uses a stack 

C

declare a stack of characters
while ( there are more characters in the word to read )
{
   read a character
   push the character on the stack
}
while ( the stack is not empty )
{
   pop a character off the stack
   write the character to the screen
}

What is output for input \”geeksquiz\”?

(A)

geeksquizgeeksquiz

(B)

ziuqskeeg

(C)

geeksquiz

(D)

ziuqskeegziuqskeeg

Answer: (B)
Explanation:

Since the stack data structure follows LIFO order. When we pop() items from stack, they are popped in reverse order of their insertion (or push())

Quiz of this Question
Please comment below if you find anything wrong in the above post