GATE CS 2021 Set 1 — Question 31
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+1 / -0EasyStack OperationsStacks & QueuesProgramming & Data StructuresQueue & Circular Queue
Programming & Data Structures → Stacks & Queues → Queue & Circular Queue
Last updated
Question
Consider the following sequence of operations on an empty stack.Consider the following sequence of operations on an empty queue.The value of s + q is __________.
push(54); push(52); pop(); push(55); push(62); s = pop();
enqueue(21); enqueue(24); dequeue(); enqueue(28); enqueue(32); q = dequeue();
Correct answer
86 to 86
Solution
Stack Operations (LIFO - Last In First Out):
1.
push(54) Stack: [54]2.
push(52) Stack: [54, 52] (Top is 52)3.
pop() Removes 52. Stack: [54]4.
push(55) Stack: [54, 55]5.
push(62) Stack: [54, 55, 62] (Top is 62)6.
Queue Operations (FIFO - First In First Out):s = pop() Removes 62. s = 62. Stack: [54, 55]1.
enqueue(21) Queue: [21]2.
enqueue(24) Queue: [21, 24] (Front is 21)3.
dequeue() Removes 21. Queue: [24]4.
enqueue(28) Queue: [24, 28]5.
enqueue(32) Queue: [24, 28, 32] (Front is 24)6.
Result:q = dequeue() Removes 24. q = 24. Queue: [28, 32]Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Stacks & Queues
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]