Stack - Free MCQ Practice Test with solutions, GATE CSE (CSE) Programming
MCQ Practice Test & Solutions: Test: Stack (10 Questions)
You can prepare effectively for Computer Science Engineering (CSE) Programming and Data Structures with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Stack". These 10 questions have been designed by the experts with the latest curriculum of Computer Science Engineering (CSE) 2026, to help you master the concept.
Test Highlights:
- - Format: Multiple Choice Questions (MCQ)
- - Duration: 30 minutes
- - Number of Questions: 10
Sign up on EduRev for free to attempt this test and track your preparation progress.
Consider the following pseudo-code to perform push and pop operation on a stack using enqueue(EQ) and dequeue(DQ) operations on 2 queues q1 and q2. Let x be an element to be pushed in the stack. answer the following questions.
push(q1,q2,x)
{
if(q1 is empty)
{
EQ(q2,x);
}
Else
{
EQ(q1,x);
}
}
pop(q1, q2)
{
if (q1 is empty)
{
if (q2 is empty)
{
print “stack underflow”;
Exit;
}
else
{
while(q2 does not contain one element)
{
k= DQ(q2);
EQ(q1,k);
}
Return (DQ(q2));
}
}
Else
{
while(q1 does not contain one element)
{
k= DQ(q1);
EQ(q2,k);
}
Return (DQ(q1));
}
}
If we perform 8 push and 2 pop operations on the above algorithm then total how many enqueue and dequeue operations are performed on queues?
{
if(q1 is empty)
{
EQ(q2,x);
}
Else
{
EQ(q1,x);
}
}
pop(q1, q2)
{
if (q1 is empty)
{
if (q2 is empty)
{
print “stack underflow”;
Exit;
}
else
{
while(q2 does not contain one element)
{
k= DQ(q2);
EQ(q1,k);
}
Return (DQ(q2));
}
}
Else
{
while(q1 does not contain one element)
{
k= DQ(q1);
EQ(q2,k);
}
Return (DQ(q1));
}
}
Detailed Solution: Question 1
You are given two stacks with the element 1,2,3,4,5, which must be placed in the same sequence in both stacks. Once an element is added to a stack, it can only be popped and displayed (but it cannot be pushed onto the other stack again). So the possible actions are s.pop(), s.push(), and s.top() (to return the stack's top element), and the method display(int) outputs an integer result. Both stacks have access to these three operations. If it is not empty, you can do a pop operation whenever you want. Which of the following sequences cannot be produced with the aforementioned constraints?
Detailed Solution: Question 2
What is the postfix representation of the following infix expression?
(A + B) * C – D * E / F
Detailed Solution: Question 3
Detailed Solution: Question 4
In stack, memory allocation and deallocation is performed in ________.
Detailed Solution: Question 5
A stack can be implemented using queue, but then we need to use atleast:
Detailed Solution: Question 6
Detailed Solution: Question 7
A stack is implemented with an array of ‘A [0..N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code.
push(x)
A[pos] ← x
pos ← pos – 1
end push
pop( )
pos ← pos + 1
return A[pos]
end pop
Q. Which of the following will initialize an empty stack with capacity N for the above implementation?
pos ← pos – 1
return A[pos]
Detailed Solution: Question 8
A recursive problem like tower of hanoi can be rewritten without recursion using:
Detailed Solution: Question 9
The queue data structure is to be realized by using stack. The number of stacks needed would be
Detailed Solution: Question 10
161 docs|30 tests |
