The five items P, Q, R, S and T are pushed in a stack, one after another starting from P. The stack is popped four times, and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. The contents of the stack is (in the order of bottom to top)
Asked in Meghalaya PSC QUESTION BOOKLET: SERIES I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- When a new element is inserted in the middle of linked list, then the references of which node/nodes are to be adjusted/updated?
- In a priority queue, the element to be deleted first is the element
- The average case time complexity of heap sort is
- The result of evaluating the postfix expression 10 5 + 60 6 / * 8 – is
- What is the maximum height of any AVL tree with 7 nodes assuming that the height of a tree with a single node is 0?
- A full binary tree with n internal nodes contains
- The postfix form of the expression (A + B) * (C - D) / E is
- Arrange the following orders of growth in ascending order.