1
GATE CSE 2022
Numerical
+1
-0.33

Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q). The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is ______________.

2
GATE CSE 2016 Set 1
+1
-0.3
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($$n$$ refers to the number of items in the queue)?
A
Both operations can be performed in $$O\left( 1 \right)$$ time
B
At most one operation can be performed in $$O\left( 1 \right)$$ time but the worst case time for the other operation will be $$\Omega \left( n \right)$$
C
The worst case time complexity for both operations will be $$\Omega \left( n \right)$$
D
Worst case time complexity for both operations will be $$\Omega \left( {\log n} \right)$$
3
GATE CSE 2015 Set 3
+1
-0.3
The result evaluating the postfix expression $$10\,\,5\, + 60$$ $$\,\,6/\, * \,8\, -$$ is
A
$$284$$
B
$$213$$
C
$$142$$
D
$$71$$
4
GATE CSE 2005
+1
-0.3
A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) + i for all stacks S and integers i. If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top, what is f(S)?
A
6
B
4
C
3
D
2
GATE CSE Subjects
EXAM MAP
Medical
NEET