Register

Recent questions tagged stack

0 votes
0 answers
181
Ace Graph Theory
How many times * is pushed into stack ? a detail answer will be welcomed.
How many times * is pushed into stack ? a detail answer will be welcomed.
User Avatar
0 votes
2 answers
184
GATE Overflow | Data Structures | Test 1 | Question: 3
Which of the following permutation can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $1, 2, 3, 4$ in that order? 3, 4, 1, 2 4, 3, 1, 2 1, 2, 3, 4 none
Which of the following permutation can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $1, 2, 3, 4$ in that order?3, 4...
User Avatar
0 votes
1 answer
186
GATE Overflow | Data Structures | Test 1 | Question: 4
The postfix expression for the infix expression $A + B*C/D +E$ is AB+*CD/E+ ABC*D/+E+ AB+C*D/E+ A+*BCD/E+
The postfix expression for the infix expression$$A + B*C/D +E$$isAB+*CD/E+ABC*D/+E+AB+C*D/E+A+*BCD/E+
User Avatar
2 votes
1 answer
187
Programming stack
User Avatar
4 votes
1 answer
188
DS test
User Avatar
9 votes
1 answer
189
DS+Permutation
An item that is read as input can either be pushed to the stack and later popped and printed or printed directly. Number of print permutations that can be obtained using stack, if the input sequence is $1, 2, 3, 4, 5$ in that order is __________.
An item that is read as input can either be pushed to the stack and later popped and printed or printed directly. Number of print permutations that can be obtained using ...
User Avatar
2 votes
2 answers
190
Infix to postfix
Convert the infix to postfix and prefix expression 1) log3! ^log4 *log log 6/7*4! 2)log3!^sin 2*cos 3
Convert the infix to postfix and prefix expression1) log3! ^log4 *log log 6/7*4!2)log3!^sin 2*cos 3
User Avatar
1 votes
1 answer
194
stack_time_complexity
Is any operations in stack array implementation is linear time complexity? If there what is operation and explain abt that?
Is any operations in stack array implementation is linear time complexity?If there what is operation and explain abt that?
User Avatar
3 votes
2 answers
195
UGC NET CSE | June 2016 | Part 2 | Question: 24
Which of the following is not an inherent application of stack? Implementation of recursion Evaluation of a postfix expression Job scheduling Reverse a string
Which of the following is not an inherent application of stack?Implementation of recursionEvaluation of a postfix expressionJob schedulingReverse a string
User Avatar
2 votes
2 answers
197
UGC NET CSE | December 2014 | Part 2 | Question: 21
Convert the following infix expression into its equivalent post fix expression $ (A + B$^$ D) / (E – F) + G $ $ABD$^ $+EF – / G+$ $ABD + $^$EF – / G+$ $ABD +$ ^$EF / – G+$ $ABD$^ $+ EF / – G+$
Convert the following infix expression into its equivalent post fix expression $ (A + B$^$ D) / (E – F) + G $$ABD$^ $+EF – / G+$$ABD + $^$EF – / G+$$ABD +$ ^$EF / �...
User Avatar
2 votes
1 answer
199
Expression Tree
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with each operator and operand along the way of push and pop operation
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with...
User Avatar
1 votes
2 answers
200
UGC NET CSE | December 2012 | Part 3 | Question: 17
Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5? 3, 2, 1, 5, 4 5, 4, 3, 2, 1 3, 4, 5, 2, 1 3, 4, 5, 1, 2
Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5?3, 2, 1, 5, 45, 4, 3, 2,...
User Avatar
0 votes
2 answers
201
UGC NET CSE | December 2012 | Part 2 | Question: 40
Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is the value of the top of the stack? 4 3 2 1
Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is the value of the top of the stack?4321
User Avatar
1 votes
1 answer
202
UGC NET CSE | June 2014 | Part 3 | Question: 41
The reverse polish notation equivalent to the infix expression $((A + B) ^{*} C + D)/(E + F + G)$ $A B + C ^{*} D + EF + G + /$ $A B + C D ^{*} + E F + G + /$ $A B + C ^{*} D + E F G + +/$ $A B + C ^{*} D + E + F G + /$
The reverse polish notation equivalent to the infix expression $((A + B) ^{*} C + D)/(E + F + G)$$A B + C ^{*} D + EF + G + /$ $A B + C D ^{*} + E F + G + /$ $A B + C ^{*...
User Avatar
1 votes
2 answers
203
UGC NET CSE | June 2012 | Part 3 | Question: 38
The following postfix expression is evaluated using a stack. 823^/23*+51*- . The top two elements of the stack after first * is evaluated 6,1 5, 7 3,2 1, 5
The following postfix expression is evaluated using a stack. 823^/23*+51*- . The top two elements of the stack after first * is evaluated6,15, 73,21, 5
User Avatar
2 votes
2 answers
204
UGC NET CSE | June 2012 | Part 2 | Question: 1
The postfix expression AB + CD -* can be evaluated using a stack tree queue linked list
The postfix expression AB + CD -* can be evaluated using astacktreequeuelinked list
User Avatar
9 votes
2 answers
205
ISRO2015-15
The queue data structure is to be realized by using stack. The number of stacks needed would be It cannot be implemented 2 stacks 4 stacks 1 stack
The queue data structure is to be realized by using stack. The number of stacks needed would beIt cannot be implemented2 stacks4 stacks1 stack
User Avatar
7 votes
1 answer
206
ISRO2015-11
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values 2,2,1,1,2 2,2,1,2,2 2,1,2,2,1 2,1,2,2,2
If the sequence of operations - push (1), push (2), pop, push (1), push (2), pop, pop, pop, push (2), pop are performed on a stack, the sequence of popped out values2,2,1...
User Avatar
4 votes
2 answers
207
ISRO2009-28
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as $A+B-C^*D$ $+A^*-BCD$ $ABC-D^*+$ $A+BC-D^*$
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as$A+B-C^*D$$+A^*-BCD$$ABC-D^*+$$A+BC-D^*$
User Avatar
Page: