edited by
2,019 views
0 votes
0 votes

https://gateoverflow.in/?qa=blob&qa_blobid=11435838562783483664

Approach for Q9 please .

(Please note: it is the last question on left hand side, and part of it is written on right hand side)

Answer is d, but according to me it should be b as in 3 situation when C is a queue and D is a stack, then it will count the no. Of elements but won't be restored in it's original state as mentioned in question. 

So only 1 and 2 is possible.

Is it correct?

edited by

1 Answer

Related questions

2 votes
2 votes
3 answers
1
0 votes
0 votes
1 answer
2
manvi_agarwal asked Jul 29, 2018
320 views
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
0 votes
0 votes
1 answer
3
Shraddha dwevedi asked Nov 24, 2021
340 views
Q.which of the following data structure cannot be used for efficient implementation of Priority Queue?a. Binary heapb. Height balanced binary tree.c. Sorted array
0 votes
0 votes
0 answers
4
Badayayash asked Jan 20, 2019
422 views
Is anyone giving made easy test series for 2019 gatei would like to discuss some questions.because i feel like there are many questions in the test series which are wrong...