GO Classes DPP | PYTHON & DSA |Stack

Answer 1

Option D

After inserting all the elements into stack the stack looks like  A B C D E  top of stack is E

Step 2: now popped 4 elements from the stack and inserted into queue each . E,D,C,B are popped and

Queue contains E,D,C,B front is E and rear is B

Step 3 : two elements are deleted from. Queue so E,D ARE deleted and pushed into stack

So now stack contains  A,E,D

NOW again one element from stack is popped out

And the popped element is D

Answer 2

Basic Operations on Stack: 

    Push   - New element in inserted.

    Pop     - Last recently inserted element is retrieved. 

 

Basic Operations on Queue:

    Enqueue   - Inserting a new element.

    Dequeue   - Retrieving a new element, that was inserted the first.

 

Basic Principle behind 

Stack - LIFO

Queue- FIFO

 

After the above operations as per the question, the Stack would be 

---------------

       D

       E

       A

---------------

 

hence D- top of the stack, so when pop() operation is done on the stack, we get 'D'.