Register

UGC NET CSE | June 2016 | Part 2 | Question: 22

• retagged by
4,968 views
4 votes
4 votes

Consider the following operations performed on a stack of size 5:

Push (a); Pop(); Push(b); Push(c); Pop();

Push(d); Pop(); Pop(); Push(e)

Which of the following statements is correct?

  1. Underflow occurs
  2. Stack operations are performed smoothly
  3. Overflow occurs
  4. None of the above
• retagged by
User Avatar

1 Answer

2 votes
2 votes
Given stack size = 5

Operation                                Stack contents

push(a)                                            a

pop()                                                -

push(b)                                            b

push(c)                                            b,c

pop()                                               b

push(d)                                           b,d

pop()                                              b

pop()                                               -

push(e)                                          e       

Option B.
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Aug 16, 2016
3,736 views
UGC NET CSE | June 2016 | Part 2 | Question: 24
Which of the following is not an inherent application of stack? Implementation of recursion Evaluation of a postfix expression Job scheduling Reverse a string
Which of the following is not an inherent application of stack?Implementation of recursionEvaluation of a postfix expressionJob schedulingReverse a string
User Avatar
3 votes
3 votes
3 answers
2
go_editor asked Aug 16, 2016
14,261 views
UGC NET CSE | June 2016 | Part 2 | Question: 23
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be $\frac{n}{2}-1$ $\frac{n}{2}+1$ $(n-1)/2$ $(n+1)/2$
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be$\frac{n}{2}-1$$\frac{...
User Avatar
7 votes
7 votes
1 answer
3
go_editor asked Aug 14, 2016
5,374 views
UGC NET CSE | June 2016 | Part 2 | Question: 5
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below? 2 4 5 6
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
User Avatar
3 votes
3 votes
2 answers
4
go_editor asked Aug 14, 2016
5,559 views
UGC NET CSE | June 2016 | Part 2 | Question: 2
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively. 14, 14 16, 14 16, 4 14, 4
The number of different spanning trees in complete graph, $K_4$ and bipartite graph, $K_{2,2}$ have ____ and ___ respectively.14, 1416, 1416, 414, 4
User Avatar
Link Copied!