queue

Question

 The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

(A) 2 deletions, 3 additions   

(B) 3 deletions, 2 additions

(C) 3 deletions, 4 additions   

(D) 3 deletions, 3 additions

Comments

d) 3 deletion and 3 addition(first delete 3 element from front end after that 3 insertion)

---

if 3 temporary variables are allowed then 3 additions and 3 deletions are sufficient  else no option matches..

---

exactly

but there is nothing ,mentioned about that

---

then assume that, any nos of temporary variables are allowed..

Answer 1

@akankshadewangan24 here answer should be option D. But I would like to say  here that if the queue is implemented using single linked list or in any data structure for that matter, then one could have swapped the FRONT and REAR pointer which would give the desired output. In that case, no addition or deletion is required :D

Comments

There is no standard function that swaps  the FRONT and REAR of a queue and in the question no such type of function is mentioned so we have to use only standard queue functions.