Recent questions tagged stack

Recent questions tagged stack

3 votes

3 answers

1

GATE CSE 2021 Set 1 | Question: 21
Consider the following sequence of operations on an empty stack.$\textsf{push}(54);\textsf{push}(52);\textsf{pop}();\textsf{push}(55);\textsf{push}(62);\textsf{s}=\textsf{pop}();$ ... $\textsf{s+q}$ is ___________.

Arjun asked in DS Feb 18, 2021

by Arjun

3k views

1 vote

2 answers

2

NIELIT 2016 DEC Scientist B (IT) - Section B: 17
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$ $^*/\%+-=$ $=^*/\%+-$ $/^*\%-+=$ $^*\% /-+=$

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

1k views

1 vote

1 answer

3

NIELIT 2016 DEC Scientist B (IT) - Section B: 30
What data structures is used for depth first traversal of a graph? Queue Stack List None of the above

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

474 views

2 votes

2 answers

4

NIELIT 2016 DEC Scientist B (IT) - Section B: 42
In the ________ traversal we process all of a vertex's descendants before we move to an adjacent vertex. Depth First Breadth First Width First Depth Limited

Lakshman Patel RJIT asked in DS Mar 31, 2020

by Lakshman Patel RJIT

1.3k views

2 votes

2 answers

5

NIELIT 2017 July Scientist B (CS) - Section B: 6
Assume that the operators $+,-,\times$ are left associative and $\wedge$ is right associative. The order of precedence(from highest to lowest) is $\wedge,\times, +,-$ ... $abc\times+de\wedge f\wedge-$ $ab+c\times d-e\wedge f\wedge $ $-+a\times bc\wedge\wedge def$

Lakshman Patel RJIT asked in DS Mar 30, 2020

by Lakshman Patel RJIT

568 views

1 vote

1 answer

6

UGCNET-Jan2017-II: 22
The seven elements $A, B, C, D, E,F$ and $G$ are pushed onto a stack in reverse order, i.e., starting from $G$. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ___________. $A$ $B$ $F$ $G$

jothee asked in DS Mar 24, 2020

by jothee

587 views

3 votes

3 answers

7

ISRO2020-72
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 ... an empty stack with capacity $N$ for the above implementation $pos \leftarrow -1$ $pos\leftarrow 0$ $pos\leftarrow 1$ $pos\leftarrow N-1$

Satbir asked in DS Jan 13, 2020

by Satbir

1.4k views

4 votes

2 answers

8

Cormen Edition 3 Exercise 10.1 Question 7 (Page No. 236)
Show how to implement a stack using two queues. Analyze the running time of the stack operations.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

589 views

1 vote

1 answer

9

Cormen Edition 3 Exercise 10.1 Question 2 (Page No. 235)
Explain how to implement two stacks in one array $A[1...n]$ in such a way that neither stack overflows unless the total number of elements in both stacks together is $n$.The $PUSH$ and $POP$ operations should run in $O(1)$ time.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

519 views

1 vote

1 answer

10

Cormen Edition 3 Exercise 10.1 Question 1 (Page No. 235)
STACK-EMPTY(S) 1 if S.top == 0 2 return TRUE 3 else return FALSE PUSH(S , x) 1 S.top = S.top + 1 2 S[S.top] = x POP(S) 1 if STACK-EMPTY(S) 2 error underflow 3 else S.top = S.top - 1 4 return S[S.top + 1] illustrate the result of ... $S$ stored in array $S[1...6]$

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

231 views

1 vote

1 answer

11

Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$

srestha asked in DS May 22, 2019

488 views

2 votes

2 answers

12

Made Easy Test Series:Data Structure-Stack
There is given a infix expression: ${\color{Red} {1}}$ $A+B\times C/\left ( \left ( D+E \right )+F\times G \right )$ While converting infix expression to postfix expression number of symbols in the stack at indicated ... $5$, but is it correct? Can anyone give some explanation??

srestha asked in DS May 6, 2019

571 views

1 vote

0 answers

13

Stack-DS(Conceptual Doubt)
Is it TRUE or FALSE? Stack allocation can allocate and deallocate dynamic variables and can manage runtime storage

srestha asked in Algorithms Apr 3, 2019

346 views

0 votes

0 answers

14

Ullman(2e) Exercise-8.3.2 page no-524 Code Generation
Generate code for the following three-address statements assuming stack allocation where register SP points to the top of the stack x = 1 x=a x = a + 1 x = a+b The two statements x = b * c y = a + x

aditi19 asked in Compiler Design Apr 1, 2019

632 views

2 votes

3 answers

15

Programming Stack (ACE)
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address

srestha asked in Programming Mar 1, 2019

505 views

0 votes

1 answer

16

# stack
infix ,postfix ,prefix expression evalution stack use as operator or operand?

amit166 asked in Compiler Design Jan 10, 2019

203 views

1 vote

1 answer

17

# stacks
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n element initially?

amit166 asked in DS Jan 6, 2019

531 views

1 vote

1 answer

18

# 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

amit166 asked in DS Jan 4, 2019

258 views

0 votes

1 answer

19

UGCNET-DEC2018-II: 24
Consider the following postfix expression with single digit operands : $6 \; 2 \: 3 \: ^* \: / \: 4 \: 2 \: ^* \; + \: 6 \: 8 \: ^* \: -$ The top two elements of the stack after the second $^*$ is evaluated, are : $8,2$ $8,1$ $6,2$ $6,3$

Arjun asked in Unknown Category Jan 2, 2019

by Arjun

4.5k views

1 vote

2 answers

20

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.

Gurdeep Saini asked in Programming Jan 2, 2019

by Gurdeep Saini

742 views

2 votes

0 answers

21

GO2019-FLT1-43
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

Ruturaj Mohanty asked in DS Dec 27, 2018

by Ruturaj Mohanty

608 views

1 vote

0 answers

22

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/(9-2^2) + 6*4 ??

anurag sharma asked in Compiler Design Dec 25, 2018

by anurag sharma

525 views

1 vote

1 answer

23

Stack
If two stack is growing two opposite end of array. Then which logic works and how?

srestha asked in DS Dec 24, 2018

949 views

1 vote

1 answer

24

Number of subnets can be formed by using the subnet mask 255.255.248.0 in a class B network _________

rahuljai asked in Computer Networks Dec 15, 2018

539 views

1 vote

2 answers

25

Stack
Every recursive program uses strictly more stack space compared to its iterative equivalent. This statement is false. Please explain with examples

Shamim Ahmed asked in Programming Dec 11, 2018

by Shamim Ahmed

364 views

2 votes

0 answers

26

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!!!

CHïntän ÞäTël asked in Programming Dec 7, 2018

by CHïntän ÞäTël

269 views

Page:

1
2
3
4
5
6
next »

Follow @gateoverflow

GATE Overflow

Recent questions tagged stack

Search GATE Overflow