Register

Recent questions tagged stack

1 votes
1 answer
61
NIELIT Scientific Assistant A 2020 November: 115
A recursive problem like tower of hanoi can be rewritten without recursion using: stack priority queue graph cycles
A recursive problem like tower of hanoi can be rewritten without recursion using:stackpriority queuegraphcycles
User Avatar
1 votes
1 answer
63
GATE Overflow Test Series | Data Structures | Test 1 | Question: 3
What is the value of the postfix expression $8 \ 7 \ 2 \ 4 \ + \ – \ *?$:
What is the value of the postfix expression $8 \ 7 \ 2 \ 4 \ + \ – \ *?$:
User Avatar
1 votes
1 answer
64
GATE Overflow Test Series | Data Structures | Test 1 | Question: 4
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively are Stack and Queue Queue and Stack Stack and Stack Queue and Queue
The data structures most suitable to do an inorder and level order traversals of a binary tree respectively areStack and QueueQueue and StackStack and StackQueue and Queu...
User Avatar
1 votes
1 answer
65
GATE Overflow Test Series | Data Structures | Test 1 | Question: 5
The prefix form of $A/B- (C * D * E)$ is? $-/* * ABCDE$ $-/ABCD**DE$ $-/AB**CDE$ $-A/BC*DE*$
The prefix form of $A/B- (C * D * E)$ is?$-/* * ABCDE$$-/ABCD DE$$-/AB CDE$$-A/BC*DE*$
User Avatar
3 votes
2 answers
68
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$ $^*/\%+-=$ $=^*/\%+-$ $/^*\%-+=$ $^*\% /-+=$
Which of the following is the correct order of evaluation for the below expression? $z=x+y^*z/4\%2-1$$^*/\%+-=$$=^*/\%+-$$/^*\%-+=$$^*\% /-+=$
User Avatar
3 votes
1 answer
69
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
What data structures is used for depth first traversal of a graph?QueueStackListNone of the above
User Avatar
3 votes
2 answers
70
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
In the ________ traversal we process all of a vertex's descendants before we move to an adjacent vertex.Depth FirstBreadth FirstWidth FirstDepth Limited
User Avatar
1 votes
2 answers
72
UGC NET CSE | December 2006 | Part 2 | Question: 23
What is the time required to insert an element in a stack with linked implementation ? $O (\log_2 n)$ $O (n)$ $O (n\log_2 n)$ $O (1)$
What is the time required to insert an element in a stack with linked implementation ?$O (\log_2 n)$$O (n)$$O (n\log_2 n)$$O (1)$
User Avatar
0 votes
1 answer
73
UGC NET CSE | June 2005 | Part 2 | Question: 21
What is the time required to insert an element in a stack with linked implementation? $O \left(\log_{2}n \right)$ $O \left(n \right)$ $O \left(n \log_{2}n \right)$ $O \left(1 \right)$
What is the time required to insert an element in a stack with linked implementation?$O \left(\log_{2}n \right)$$O \left(n \right)$$O \left(n \log_{2}n \right)$$O \left(1...
User Avatar
4 votes
2 answers
76
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.
Show how to implement a stack using two queues. Analyze the running time of the stack operations.
User Avatar
1 votes
0 answers
81
Stack-DS(Conceptual Doubt)
Is it TRUE or FALSE? Stack allocation can allocate and deallocate dynamic variables and can manage runtime storage
Is it TRUE or FALSE?Stack allocation can allocate and deallocate dynamic variables and can manage runtime storage
User Avatar
0 votes
0 answers
82
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
Generate code for the following three-address statements assuming stack allocation where register SP points to the top of the stackx = 1x=ax = a + 1x = a+bThe two stateme...
User Avatar
2 votes
3 answers
83
Programming Stack (ACE)
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address
Runtime stack doesnot contain(A) Local variables(B) Static Variables(C) Parameter Passed(D) Return Address
User Avatar
1 votes
0 answers
86
Applied Course | Mock GATE | Test 1 | Question: 42
What is the maximum number of activation records inserted into stack while converting following infix expression to postfix expression is Infix expression: $\text{7+5*3^2/(9-2^2)+6*4}$
What is the maximum number of activation records inserted into stack while converting following infix expression to postfix expression is Infix expression: $\text{7+5*3^2...
User Avatar
0 votes
0 answers
87
#madeeasy
A stack based CPU executes the instruction. Memory location 500 contain 0×88 and memory location 700 contain 0×37. Stack pointer is at 0×003F. I1: push 500 I2: push 700 I3: add I4: pop 600 I5: push 300 Then after execution of above instruction the memory location 600 contains _
A stack based CPU executes the instruction. Memory location 500 contain 0×88 and memory location 700 contain 0×37. Stack pointer is at 0×003F.I1: push 500I2: push 700I...
User Avatar
0 votes
1 answer
88
# stack
infix ,postfix ,prefix expression evalution stack use as operator or operand?
infix ,postfix ,prefix expression evalution stack use as operator or operand?
User Avatar
1 votes
1 answer
89
# stacks
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n element initially?
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n element initially?
User Avatar
Page: