Register

Recent questions tagged stack

1 votes
1 answer
94
Stack
If two stack is growing two opposite end of array. Then which logic works and how?
If two stack is growing two opposite end of array. Then which logic works and how?
User Avatar
1 votes
2 answers
95
Stack
Every recursive program uses strictly more stack space compared to its iterative equivalent. This statement is false. Please explain with examples
Every recursive program uses strictly more stack space compared to its iterative equivalent.This statement is false. Please explain with examples
User Avatar
5 votes
5 answers
97
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
______ to evaluate an expression without any embedded function calls.Two stacks are requiredone stack is neededThree stacks are requiredMore than three stacks are require...
User Avatar
0 votes
0 answers
99
stack organization
X= (A+B)*(C+D) variable are in the main memory evaluate the statement, using stack organization If the CPU supports an 8-bit opcode of 4 GB memory space, how much (in Bytes) is required to store the program? Please explain a bit.
X= (A+B)*(C+D) variable are in the main memory evaluate the statement, using stack organizationIf the CPU supports an 8-bit opcode of 4 GB memory space, how much (in Byte...
User Avatar
2 votes
2 answers
100
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
User Avatar
1 votes
1 answer
101
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
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() implemen...
User Avatar
1 votes
2 answers
102
Stack Memory
User Avatar
2 votes
1 answer
103
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$
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 underflo...
User Avatar
0 votes
0 answers
104
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);
Please convert it to postfix by using stack and explain in detailvoid (*bsd_signal(int sig, void (*func)(int)))(int);
User Avatar
1 votes
1 answer
105
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?
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 di...
User Avatar
0 votes
0 answers
106
Subroutine Call
User Avatar
1 votes
1 answer
107
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"?
pseudo code of stackdeclare a stack of characterswhile (there are more character in the word to read){read a character push the character on the stack}while(the stack i...
User Avatar
2 votes
0 answers
108
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
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++) ...
User Avatar
3 votes
2 answers
109
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
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,6B ) 5,9,6,7,8...
User Avatar
1 votes
2 answers
110
Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?
User Avatar
1 votes
1 answer
111
What is the total number of distinct words that can be formed out of n letters using below operations with stack ?
Suppose one character at a time comes as an input from a string of letters . There is an option either to 1) print the incoming letter or to 2) put the incoming letter on...
User Avatar
2 votes
1 answer
113
Tower Of Hanoi Problem
a) Wednesday b)Tuesday c)Thursday d)Friday e)None of the above
a) Wednesdayb)Tuesdayc)Thursdayd)Fridaye)None of the above
User Avatar
1 votes
1 answer
114
Entriies in s stack are "ordered".
Entries in a stack are "ordered". What is the meaning of this statement?
Entries in a stack are "ordered". What is the meaning of this statement?
User Avatar
1 votes
2 answers
115
Stack
What is difference between $pop\left ( \right )$,$empty Stack\left ( \right )$,$delete Stack\left ( \right )$? Can all be performed in $O\left ( 1 \right )$ time?
What is difference between $pop\left ( \right )$,$empty Stack\left ( \right )$,$delete Stack\left ( \right )$?Can all be performed in $O\left ( 1 \right )$ time?
User Avatar
2 votes
2 answers
116
data structure
To remove recursion from a program we have to use which of the following data structure? array stack queue list
To remove recursion from a program we have to use which of the following data structure?arraystackqueuelist
User Avatar
Page: