Testbook Test Series: Programming & DS - Stack [closed]

Question

A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from front

to rear. The following operations are performed in the queue: delete, insert (5), delete, Then how

many total no. of push and pop operations are needed to perform the above operation?

 

a) Push: 12 Pop: 13

b) Push: 15 Pop: 16

c) Push: 11 Pop: 10

d) Push: 12 Pop: 11

Comments

thank you bro, for correcting me...

Moreover see this question ( not answer ) https://gateoverflow.in/1826/gate2006-49

---

@Shaik Masthan isnt this question a bit ambiguous as we dont know how 1 2 3 4 is placed in the stack

---

@TUSHAR_BHATT

it is upto you that " How to use the stacks. just questioner mentioned that he/she has a queue. "

Answer 1

option B is correct

push: 3+1+4+4+3 = 15

pop: 4+1+3+1+4+3 = 16

Comments

Plz explain?

---

My answer

push 9

Pop 6