GATE DA 2025 Set 1 — Question 64
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumStack Operations & ApplicationsStacks & QueuesProgramming, Data Structures & Algorithms
Programming, Data Structures & Algorithms → Stacks & Queues → Stack Operations & Applications
Last updated
Question
Consider the following pseudocode.The value of
Create empty stack S
Set x=0, flag=0, sum=0
Push x onto S
while (S is not empty){
if (flag equals 0){
Set x = x+1
Push x onto S}
if (x equals 8):
Set flag=1
if (flag equals 1){
x = Pop(S)
if (x is odd):
Pop(S)
Set sum = sum + x}
}
Output sum
sum output by a program executing the above pseudocode is ________ (Answer in integer)Correct answer
24 to 24
Solution
The pseudocode executes as follows:
1.Initialization: Stack , , , .
2.Filling the Stack (flag=0):
- The loop runs with . In each iteration, increments and is pushed onto .
- This continues until reaches 8. The stack becomes .
- When , the condition
if (x equals 8)sets .
- Once , the first
ifblock is skipped. - The code enters the
if (flag equals 1)block. - Iteration with x=8: . is even.
Set sum = sum + x. - Iteration with x=7: . is odd.
Pop(S)removes 6.Set sum = sum + x. - Iteration with x=5: . is odd.
Pop(S)removes 4.Set sum = sum + x. - Iteration with x=3: . is odd.
Pop(S)removes 2.Set sum = sum + x. - Iteration with x=1: . is odd.
Pop(S)removes 0.Set sum = sum + x. - The stack is now empty.
sum is 24.Note: The indentation in the problem image indicates that Set sum = sum + x is outside the if (x is odd) block but inside the if (flag equals 1) block. Thus, it executes for every popped processed in the flag=1 block (8, 7, 5, 3, 1).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 DA 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 1 Q15Consider that the quick sort algorithm is used to sort an array of distinct randomly ordered…2026 Set 1 Q16Consider the given Python program. [code] Which of the following is the correct output of this…2026 Set 1 Q25You are given the following Pre-order and In-order traversals of a Binary Tree T with nodes E, F,…2026 Set 1 Q31Let A be a sorted array containing 1000 distinct integers. You perform a recursive binary search on…2026 Set 1 Q39A recursive function in Python is given. [code] Now, consider the following function call:…