Data Structure Stack Operations Online Exam Quiz
Data Structure Stack Operations GK Quiz. Question and Answers related to Data Structure Stack Operations. MCQ (Multiple Choice Questions with answers about Data Structure Stack Operations
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?
Options
A : 1
B : 2
C : 3
D : 4 or more
Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))?
Options
A : 1
B : 2
C : 3
D : 4 or more
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
Options
A : 1
B : 2
C : 3
D : 4
What is the value of the postfix expression 6 3 2 4 + – *?
Options
A : 1
B : 40
C : 74
D : -18
Entries in a stack are “ordered”. What is the meaning of this statement?
Options
A : A collection of stacks is sortable
B : Stack entries may be compared with the ‘<‘ operation
C : The entries are stored in a linked list
D : There is a Sequential entry that is one by one
Which of the following is not the application of stack?
Options
A : A parentheses balancing program
B : Tracking of local variables at run time
C : Compiler Syntax Analyzer
D : Data Transfer between two asynchronous process
Process of inserting an element in stack is called ____________
Options
A : Create
B : Push
C : Evaluation
D : Pop
Process of removing an element from stack is called __________
Options
A : Create
B : Push
C : Evaluation
D : Pop
Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________
Options
A : Overflow
B : Crash
C : Underflow
D : User flow
In a stack, if a user tries to remove an element from an empty stack it is called _________
Options
A : Underflow
B : Empty collection
C : Overflow
D : Garbage Collection
Data Structure Adjacency List more Online Exam Quiz
Data Structure Stack Linked List
Data Structure Stack Using Queues
Data Structure String Reversal Recursion