Have an account?
Skip to Content
Build your own quiz
Suggestions for you
10 questions
Show Answers
See Preview
- 1. Multiple Choice
In a stack, if a user tries to remove an element from empty stack it is called _________
Underflow
Empty collection
Overflow
Garbage Collection
- 2. Multiple Choice
Process of inserting an element in stack is called ____________
Create
Push
Evaluation
Pop
- 3. Multiple Choice
Consider the usual algorithm for determining whether a sequence of parentheses is balanced.
Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order).
The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
1
2
3
4 or more
- 4. Multiple Choice
User perform following operations on stack of size 5 then -
push(1);
pop();
push(2);
push(3);
pop();
push(2);
pop();
pop();
push(4);
pop();
pop();
push(5);
Overflow Occurs
Stack Operations will be performed Smoothly
Underflow Occurs
None of these
- 5. Multiple Choice
What is the value of the postfix expression 6 3 2 4 + – *
1
40
74
-18
- 6. Multiple Choice
The following postfix expression with single digit operands is evaluated using a stack:
8 2 3 ^ / 2 3 * + 5 1 * -
6,1
5,7
3,2
1,5
- 7. Multiple Choice
To evaluate an expression without any embedded function calls:
One stack is enough
Two stacks are needed
As many stacks as the height of the expression tree are needed
A Turing machine is needed in the general case
- 8. Multiple Choice
What will be the postfix form of the above expression -
(A+B)∗(C∗D-E)∗F/G
None of these
A B + C D ∗ E − F G ∗ / ∗
A B + C D E ∗ − F G / ∗ ∗
A B + C D ∗ E − F G / ∗ ∗
- 9. Multiple Choice
Which one of the following is an application of Stack Data Structure?
Managing function calls
The stock span problem
Arithmetic expression evaluation
All of the above
- 10. Multiple Choice
List of data in which element can be inserted and removed at the same end is called as __________.
array
stack
linked list
queue
- Answer choicesTagsAnswer choicesTags