0 of 2 questions completed
Welcome, This quiz is on data structures…
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
0 of 2 questions answered correctly
Time has elapsed
You have reached 0 of 0 points, (0)
Thanks for taking the quiz. Come back for more…
Question 1 of 2
1. Question1 points
When implementing stack using queue, how many queues are required?Correct
Whenever there is a pop, the last element is required to be sent out, However we have a queue, so take all elements from queue to another queue till last element is reached. Push can be done by adding the element to the end of the queueIncorrect
Question 2 of 2
2. Question1 points
How many stacks are required to implement a queueCorrect
During a delete operation on queue, elements from one stack are popped and pushed to the other stack, till the first element is got. This is returned. Insert is just push on stackIncorrect