The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged stack
0
votes
2
answers
1
Programming Stack (ACE)
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address
asked
Mar 1
in
Programming
by
srestha
Veteran
(
108k
points)

71
views
stack
+1
vote
2
answers
2
GATEBOOK2019 Mock Test128
If the expression $((2 + 3) * 4 + 5 * (6 + 7) * 8) + 9$ is evaluated with $*$ having precedence over $+$, then the value obtained is the same as the value of which of the following prefix expressions? $+ + * + 2 3 4 * * 5 + 6 7 8 9$ $+ * + + 2 3 4 * * 5 + 6 7 8 9$ $* + + 2 3 4 * * 5 + + 6 7 8 9$ $* + + + 2 3 4 * * 5 + 6 7 8 9$
asked
Jan 19
in
DS
by
GATEBOOK
Boss
(
15.3k
points)

139
views
gb2019mock1
stack
prefixnotation
0
votes
0
answers
3
# stack
infix ,postfix ,prefix expression evalution stack use as operator or operand?
asked
Jan 10
in
Compiler Design
by
amit166
Junior
(
713
points)

39
views
stack
0
votes
1
answer
4
# stacks
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n element initially?
asked
Jan 6
in
DS
by
amit166
Junior
(
713
points)

31
views
stack
0
votes
0
answers
5
# iit goa data strructre
5. Assume I have a stack s, a queue q, and a binary search tree t. Initially all of them are empty. Indicate the state of the data structures at line number 7 and at the end. What is the maximum height each of the data structures had during the execution? 1 i $\rightarrow$ 0 ... 0 8 while i <= 9 do 9 t.insert(s.pop()) 10 t.insert(q.get()) 11 i $\rightarrow$ i + 1 12 end
asked
Jan 4
in
DS
by
amit166
Junior
(
713
points)

29
views
queue
stack
0
votes
0
answers
6
Stack implementation by using queue
true/false ? ) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time. )if stack is implemented as a linked list ,all operation ,is emptystack(),delete stack() can be performed in constant time.
asked
Jan 2
in
Programming
by
Gurdeep Saini
Loyal
(
9.1k
points)

83
views
datastructure
queues
stack
0
votes
0
answers
7
GO2019FLT143
Ginmans Stack are a kind of special data structure in which if there are odd number of elements then the middle most element is popped out and printed on the screen. In case of even number of elements the recently popped out element is again pushed back either on the top or bottom of the stack randomly. ... i, ii ii, iii iii, iv ii, iv
asked
Dec 27, 2018
in
DS
by
Ruturaj Mohanty
Active
(
2.9k
points)

191
views
go2019flt1
datastructure
stack
0
votes
0
answers
8
stack activation records
What is the maximum number of activation records inserted into stack while converting following infix expression to postfix expression is Infix expression: 7+5*3^2/(92^2) + 6*4 ??
asked
Dec 25, 2018
in
Compiler Design
by
anurag sharma
(
223
points)

98
views
compilerdesign
stack
activationrecords
0
votes
1
answer
9
Stack
If two stack is growing two opposite end of array. Then which logic works and how?
asked
Dec 24, 2018
in
DS
by
srestha
Veteran
(
108k
points)

91
views
stack
datastructure
0
votes
0
answers
10
Number of subnets can be formed by using the subnet mask 255.255.248.0 in a class B network _________
asked
Dec 15, 2018
in
Computer Networks
by
rahuljai
(
437
points)

103
views
computernetworks
datastructure
stack
0
votes
1
answer
11
Stack
Every recursive program uses strictly more stack space compared to its iterative equivalent. This statement is false. Please explain with examples
asked
Dec 11, 2018
in
Programming
by
Shamim Ahmed
Active
(
2.3k
points)

66
views
stack
datastructure
0
votes
0
answers
12
MadeEasy Subject Test 2019: Programming & DS  Stack
I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2… TRY AND CORRECT IF I M WRONG !!!! THANKS IN ADVANCE!!!
asked
Dec 7, 2018
in
Programming
by
CHïntän ÞäTël
(
275
points)

60
views
madeeasytestseries
datastructure
stack
infixpostfix
0
votes
1
answer
13
NIELIT 201854
______ to evaluate an expression without any embedded function calls. Two stacks are required one stack is needed Three stacks are required More than three stacks are required
asked
Dec 7, 2018
in
DS
by
Arjun
Veteran
(
386k
points)

29
views
nielit2018
stack
expressionevaluation
+1
vote
0
answers
14
MadeEasy Test Series: Programming & DS  Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown. The number of elements that will remain in the stack after the parsing of the input string according to the above SDT rules is _______ I think the answer should be 5 but 4 is provided as answer.
asked
Dec 7, 2018
in
DS
by
Gupta731
Active
(
4.5k
points)

48
views
madeeasytestseries
datastructure
stack
0
votes
0
answers
15
MadeEasy Test Series: Programming & DS  Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
asked
Dec 1, 2018
in
DS
by
jatin khachane 1
Loyal
(
6.4k
points)

75
views
madeeasytestseries
datastructure
stack
infixpostfix
0
votes
0
answers
16
Multiple Stacks in Single Array
Consider the implementation of multiple stacks in single array S of size P from index 0 to P – 1. Number of stack Q each of size P/Q. Now, how push() and pop() implemented in it. Can somebody give some insight on this implementation
asked
Nov 21, 2018
in
Computer Networks
by
srestha
Veteran
(
108k
points)

67
views
datastructure
stack
0
votes
2
answers
17
Stack Memory
asked
Nov 7, 2018
in
CO & Architecture
by
Na462
Loyal
(
8.7k
points)

58
views
stack
computerarchitecture
+1
vote
2
answers
18
GATEBOOK2019DS112
Let the minimum number of stack(s) required to evaluate a prefix expression is $A$ and the value of the prefix expression $+2*34+/8215$ (all numbers are unit digit) evaluated using the same number of stack(s) is $B$. What are the values of $A$ and $B$? $1,4$ $2,6$ $1,6$ $2,4$
asked
Oct 27, 2018
in
DS
by
GATEBOOK
Boss
(
15.3k
points)

183
views
gb2019ds1
stack
0
votes
1
answer
19
GATEBOOK2019DS114
The pseudo code of a function is given below which takes an integer $n$ as its argument, and uses a stack $S$ to process the number. void foo(int n) { stack S; while (n >= 1) { push(&S, n%2); n = n/2; } while (!isEmpty(& ... order Prints binary representation of $n$ Prints the binary value of $\log n$ in reverse order Prints the binary value of $2^n$ in reverse order
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
15.3k
points)

67
views
gb2019ds1
stack
+1
vote
1
answer
20
GATEBOOK2019DS125
A stack is implemented using two queues. Initially the stack is empty. Then following sequence of operations are performed on stack: ... to simulate these stack operations is, (assuming $\text{pop}()$ is less costly between the two operations.): $28$ $31$ $35$ $37$
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
15.3k
points)

128
views
gb2019ds1
stack
+1
vote
1
answer
21
stack underflow
A stack of size (1 to N) and the initial position of top pointer is 0. get(i,S) is aroutine to get ith element from stack 'S' with respect to top. then,what is the underflow condition on stack to perform get() operation? $A) topi<N$ $B) topi+1<=N$ $C) topi<=0$ $D) topi+1<=0$
asked
Oct 22, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
29.4k
points)

109
views
datastructure
stack
0
votes
0
answers
22
Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detail void (*bsd_signal(int sig, void (*func)(int)))(int);
asked
Oct 20, 2018
in
Programming
by
Mk Utkarsh
Boss
(
34.2k
points)

103
views
stack
datastructure
infixpostfix
0
votes
1
answer
23
nptel lecture on stacks
While calculating the cost of growable arraybased stack.... the cost of n pushes came out as a series  2 + 4 + 8 + 16 +......+2^(logn + 1) and it equals to 4n  1. I didn't understand how the series sum equals to 4n?
asked
Oct 9, 2018
in
DS
by
himanshu6398
(
37
points)

58
views
datastructure
stack
0
votes
0
answers
24
Subroutine Call
asked
Sep 24, 2018
in
CO & Architecture
by
Na462
Loyal
(
8.7k
points)

57
views
coandarchitecture
stack
0
votes
1
answer
25
work book
pseudo code of stack declare a stack of characters while (there are more character in the word to read) { read a character push the character on the stack } while(the stack is not empty) { pop a character off the stack write the character to the screen } What is the output of input "192761"?
asked
Aug 8, 2018
in
DS
by
amit166
Junior
(
713
points)

57
views
stack
0
votes
0
answers
26
work book
Let S be a stack with operations push, pop, top, empty. What is displayed after following segment of code executes . for(i=1; i<=5; i++) s.push(i); while(!s.empty()) printf("%d", s.top()); ans with explanation
asked
Aug 8, 2018
in
DS
by
amit166
Junior
(
713
points)

78
views
stack
+2
votes
3
answers
27
Ace Test Series: Data Structures  Stack
Which of the following permutations can be obtained in the same order using a stack assuming that input is the sequence 5,6,7,8,9 in that order? A ) 7,8,9,5,6 B ) 5,9,6,7,8 C ) 7,8,9,6,5 D ) 9,8,7,5,6
asked
Jul 29, 2018
in
DS
by
Kalpataru Bose
Junior
(
507
points)

110
views
acetestseries
datastructure
stack
0
votes
1
answer
28
Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
asked
Jul 26, 2018
in
DS
by
kapilbk1996
(
469
points)

104
views
stack
queues
datastructure
pointers
+1
vote
1
answer
29
What is the total number of distinct words that can be formed out of n letters using below operations with stack ?
asked
Jul 24, 2018
in
Programming
by
radha gogia
Loyal
(
8k
points)

141
views
datastructure
stack
0
votes
0
answers
30
Testbook Test Series: Programming & DS  Stack
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from front to rear. The following operations are performed in the queue: delete, insert (5), delete, Then how many total no. of push and pop operations are needed to perform ... ? a) Push: 12 Pop: 13 b) Push: 15 Pop: 16 c) Push: 11 Pop: 10 d) Push: 12 Pop: 11
asked
Jul 24, 2018
in
DS
by
bhavnakumrawat5
(
203
points)

135
views
testbooktestseries
data
datastructure
stack
Page:
1
2
3
4
5
6
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Gandhinagar review
Is DAIICT good for doing MTech ?
AIR175 : GO is enough
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
Follow @csegate
Recent questions tagged stack
Recent Blog Comments
congrats man!!! u surely need guts to leave job...
You won't get M.Tech degree then
I have generic query , not just about iit gn but...
Thank you Abhishek
Heartliest Congratulation Abhishek Bhai. This was...
48,515
questions
52,763
answers
183,377
comments
68,234
users