Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged stack
1
votes
1
answer
1
GATE CSE 2024 | Set 2 | Question: 38
Let $\mathrm{S} 1$ and $\mathrm{S} 2$ be two stacks. $\mathrm{S} 1$ has capacity of $4$ elements. $\mathrm{S} 2$ has capacity of $2$ elements. $\text{S1}$ already has $4$ elements: $100,200,300$, and $400$ ... output sequences can be generated by using the above operations? $100,200,400,300$ $200,300,400,100$ $400,200,100,300$ $300,200,400,100$
Let $\mathrm{S} 1$ and $\mathrm{S} 2$ be two stacks. $\mathrm{S} 1$ has capacity of $4$ elements. $\mathrm{S} 2$ has capacity of $2$ elements. $\text{S1}$ ...
Arjun
2.2k
views
Arjun
asked
Feb 16
DS
gatecse2024-set2
data-structures
stack
multiple-selects
+
–
7
votes
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 45
Consider a stack whose elements are unsigned integers and support the following operations: PUSH a: Pushes the element 'a' onto the stack. ADD: Adds the two topmost elements, removes them, and pushes the result. SQR: ... once, count it as many times as it is used. Your final count should include initial 3 PUSH instructions.
Consider a stack whose elements are unsigned integers and support the following operations:PUSH a: Pushes the element 'a' onto the stack.ADD: Adds the two topmost element...
GO Classes
567
views
GO Classes
asked
Feb 5
DS
goclasses2024-mockgate-14
numerical-answers
data-structures
stack
2-marks
+
–
0
votes
1
answer
3
Memory Based GATE DA 2024 | Question: 40
Match the following: $ \begin{array}{|p{0.3\linewidth}|p{0.6\linewidth}|} \hline \textbf{Technique} & \textbf{Characteristic} \\ \hline FIFO & (ii) Queue \\ \hline Look Up & (i) Hash Table\\ \hline LIFO & (iii) Stack \\ \hline \end{array} $
Match the following:$$\begin{array}{|p{0.3\linewidth}|p{0.6\linewidth}|} \hline \textbf{Technique} & \textbf{Characteristic} \\ \hline FIFO & ...
GO Classes
200
views
GO Classes
asked
Feb 4
DS
gate2024-da-memory-based
goclasses
data-structures
stack
+
–
2
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 4
What are the sequence of popped-out values if the sequence of operations - $\textsf{push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop}$ are performed on a stack? $2, 2, 1, 1, 2$ $2, 2, 1, 1, 1$ $2, 1, 2, 2, 1$ $2, 1, 2, 2, 2$
What are the sequence of popped-out values if the sequence of operations - $\textsf{push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop}$ are performed o...
GO Classes
369
views
GO Classes
asked
Jan 21
DS
goclasses2024-mockgate-12
goclasses
data-structures
stack
1-mark
easy
+
–
0
votes
1
answer
5
What is the infix to postfix evaluation of (A+B)*(C*D - E)*F / G
According to my knowledge, it should be AB+CD*E-*F*G/ And, here is the step-wise explanation of it Converting the bracket of (A+B) - AB+ There is operator but the next operand is entire bracket term, it has to be ... Please confirm if my logic and answer is correct or not. Note Mind the space around / operator. It is there on purpose.
According to my knowledge, it should be AB+CD*E-*F*G/And, here is the step-wise explanation of itConverting the bracket of (A+B) – AB+There is operator but the next ope...
tbhaxor
966
views
tbhaxor
asked
Nov 24, 2023
DS
stack
infix-prefix
+
–
1
votes
1
answer
6
GO Classes 2024 | IIITH Mock Test 5 | Question: 29
Which of the following can't be the contents of the stack from bottom to top at a time instant in evaluating the postfix expression $: 863 /+32 *-$ (where $*$ is the multiplication operator)? $10,6$ $10,3$ $10,3,2$ $10,5$
Which of the following can't be the contents of the stack from bottom to top at a time instant in evaluating the postfix expression $: 863 /+32 *-$ (where $*$ is the mult...
GO Classes
84
views
GO Classes
asked
Apr 30, 2023
DS
goclasses2024-iiith-mock-5
goclasses
data-structures
stack
infix-prefix
1-mark
+
–
6
votes
3
answers
7
GATE CSE 2023 | Question: 49
Consider a sequence $a$ of elements $a_{0}=1, a_{1}=5, a_{2}=7, a_{3}=8, a_{4}=9$, and $a_{5}=2$. The following operations are performed on a stack $S$ and a queue $Q,$ both of which are initially empty. $\textsf{push}$ the ... $S$. $\textsf{pop}$ an element from $S$. The top element of $S$ after executing the above operations is ______________.
Consider a sequence $a$ of elements $a_{0}=1, a_{1}=5, a_{2}=7, a_{3}=8, a_{4}=9$, and $a_{5}=2$. The following operations are performed on a stack $S$ and a queue $Q,$ b...
admin
7.0k
views
admin
asked
Feb 15, 2023
DS
gatecse-2023
data-structures
stack
numerical-answers
2-marks
easy
+
–
3
votes
1
answer
8
Number of possible permutations that can be obtained using stack for input seq
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
h4kr
666
views
h4kr
asked
Jan 31, 2023
Algorithms
algorithms
stack
+
–
1
votes
0
answers
9
DRDO CSE 2022 Paper 1 | Question: 26 (a)
Provide the correct data structures for the following: ________ is used for delimiter checking and recursion.
Provide the correct data structures for the following:________ is used for delimiter checking and recursion.
admin
531
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
stack
1-mark
fill-in-the-blanks
+
–
1
votes
2
answers
10
DRDO CSE 2022 Paper 1 | Question: 29
Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inserted into a queue. Next, two items are deleted from the queue, ... deleted items are pushed back onto the stack. Now, one item is popped from the stack. Which item is at the top of the stack.
Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inse...
admin
551
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
stack
5-marks
descriptive
+
–
0
votes
3
answers
11
Stacks
The maximum size of the operator stack when converting the following infix to postfix expression a ^ b * c * d + e * f ^ g (assume that “^” has highest precedence and right associativity) and also output the postfix expression.
The maximum size of the operator stack when converting the following infix to postfix expressiona ^ b * c * d + e * f ^ g (assume that “^” has highest precedence and ...
vivek1211
780
views
vivek1211
asked
Nov 6, 2022
Programming in C
data-structures
stack
infix-prefix
+
–
0
votes
1
answer
12
Ace Test Series Data Structure Q9
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristics Singly link list with head and tail pointer Doubly link list with only head pointer Binary tree Array
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristicsSingly link list with head and tail pointerDoubly l...
Souvik33
885
views
Souvik33
asked
Nov 2, 2022
DS
data-structures
linked-list
test-series
stack
queue
+
–
Page:
1
2
3
4
5
6
...
9
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
