Recent questions tagged stack

+2 votes

1 answer

1

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

asked Jan 13 in DS by Satbir Boss (24.2k points) | 96 views

+1 vote

1 answer

2

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.

asked Jun 28, 2019 in Algorithms by akash.dinkar12 Boss (42.5k points) | 84 views

0 votes

0 answers

3

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.

asked Jun 28, 2019 in Algorithms by akash.dinkar12 Boss (42.5k points) | 31 views

0 votes

1 answer

4

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]$

asked Jun 28, 2019 in Algorithms by akash.dinkar12 Boss (42.5k points) | 47 views

0 votes

0 answers

5

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)$

asked May 22, 2019 in DS by srestha Veteran (119k points) | 123 views

+1 vote

2 answers

6

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

asked May 6, 2019 in DS by srestha Veteran (119k points) | 196 views

0 votes

0 answers

7

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

asked Apr 3, 2019 in Algorithms by srestha Veteran (119k points) | 77 views

0 votes

0 answers

8

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

asked Apr 1, 2019 in Compiler Design by aditi19 Loyal (5.2k points) | 125 views

0 votes

2 answers

9

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

asked Mar 1, 2019 in Programming by srestha Veteran (119k points) | 151 views

0 votes

0 answers

10

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

asked Jan 10, 2019 in Compiler Design by amit166 Junior (775 points) | 62 views

0 votes

1 answer

11

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

asked Jan 6, 2019 in DS by amit166 Junior (775 points) | 58 views

0 votes

1 answer

12

# 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, 2019 in DS by amit166 Junior (775 points) | 66 views

0 votes

0 answers

13

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, 2019 in Programming by Gurdeep Saini Boss (10.6k points) | 167 views

+1 vote

0 answers

14

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

asked Dec 27, 2018 in DS by Ruturaj Mohanty Active (2.7k points) | 258 views

0 votes

0 answers

15

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

asked Dec 25, 2018 in Compiler Design by anurag sharma (301 points) | 187 views

0 votes

1 answer

16

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 (119k points) | 215 views

0 votes

0 answers

17

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 Junior (551 points) | 153 views

0 votes

1 answer

18

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.5k points) | 97 views

+1 vote

0 answers

19

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 (217 points) | 97 views

+1 vote

2 answers

20

NIELIT 2018-54
______ 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 (431k points) | 80 views

+1 vote

0 answers

21

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.8k points) | 108 views

+1 vote

1 answer

22

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 (7.5k points) | 155 views

0 votes

1 answer

23

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 (119k points) | 184 views

0 votes

2 answers

24

Stack Memory

asked Nov 7, 2018 in CO and Architecture by Na462 Loyal (7k points) | 82 views

+1 vote

1 answer

25

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) top-i<N$ $B) top-i+1<=N$ $C) top-i<=0$ $D) top-i+1<=0$

asked Oct 22, 2018 in DS by Lakshman Patel RJIT Veteran (59.3k points) | 182 views

0 votes

0 answers

26

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 (36.6k points) | 170 views

0 votes

1 answer

27

nptel lecture on stacks
While calculating the cost of growable array-based 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 (67 points) | 86 views

0 votes

0 answers

28

Subroutine Call

asked Sep 24, 2018 in CO and Architecture by Na462 Loyal (7k points) | 67 views

0 votes

1 answer

29

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 (775 points) | 68 views

0 votes

0 answers

30

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 (775 points) | 97 views

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 questions tagged stack

Recent Posts

Recent Blog Comments