Q141
Open questionWhich of the following statement is incorrect?
Select an option to see the answer and solution.
Data Structure · all questionsStacks in Data Structures
Stacks in Data Structures
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
159
Questions
8/8
Page
Pick an option on a question to see the right answer and solution.
Q142
Open questionWhat is the postfix expression for the following infix expression?
a/b^c-d
Select an option to see the answer and solution.
Q143
Open questionWhat is the other name for a postfix expression?
Select an option to see the answer and solution.
Q144
Open questionGiven a prefix and a postfix notation what are the difference between them?
Select an option to see the answer and solution.
Q145
Open questionWhat is the result of the following postfix expression?
ab*cd*+ where a=2,b=2,c=3,d=4.
ab*cd*+ where a=2,b=2,c=3,d=4.
Select an option to see the answer and solution.
Q146
Open questionFrom the given Expression tree, identify the correct postfix expression from the list of options.
Select an option to see the answer and solution.
Q147
Open questionWhat would be the Prefix notation for the given equation?
A+(B*C)
Select an option to see the answer and solution.
Q148
Open questionWhat is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.
Select an option to see the answer and solution.
Q149
Open questionWhat will be output if the following sequence of operations are executed?
Push(a,s); Push(b,s); Pop(b); Push(c,s);
Select an option to see the answer and solution.
Q150
Open questionWhat is the time complexity of evaluation of postfix expression algorithm?
Select an option to see the answer and solution.
Q151
Open questionWhich application of stack is used to ensure that the pair of parentheses is properly nested?
Select an option to see the answer and solution.
Q152
Open questionWhat are the set of functions that are to be executed to get the following output?
cat
cat
Select an option to see the answer and solution.
Q153
Open questionWhat will be result if the given stack is popped?
Select an option to see the answer and solution.
Q154
Open questionWhat is the time complexity of the following code?
public boolean isBalanced(String exp)
{
int len = exp.length();
Stack<Integer> stk = new Stack<Integer>();
for(int i = 0; i < len; i++)
{
char ch = exp.charAt(i);
if (ch == '(')
stk.push(i);
else if (ch == ')')
{
if(stk.peek() == null)
{
return false;
}
stk.pop();
}
}
return true;
}Select an option to see the answer and solution.
Q155
Open questionWhat data structure is used when converting an infix notation to prefix notation?
Select an option to see the answer and solution.
Q156
Open questionIf the corresponding end bracket/braces/parentheses is encountered, which of the following is done?
Select an option to see the answer and solution.
Q157
Open questionWhich is the most appropriate data structure for applying balancing of symbols algorithm?
Select an option to see the answer and solution.
Q158
Open questionWhat would be the Prefix notation for the given equation?
a|b&c
Select an option to see the answer and solution.
Q159
Open questionOut of the following operators (|, *, +, &, $), the one having lowest priority is . . . . . . . .
Select an option to see the answer and solution.