Stacks In Data Structures — Part 2 MCQs with Explanations

Maintaining a history of visited pages is the correct answer to “What is a common use case for a stack in web browsers”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

Adds an element to the top of the stack is the correct answer to “Which of the following correctly describes a stack's push operation in terms of its effect on the stack”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

20 is the correct answer to “What is the maximum number of elements that can be held in a stack if it has a capacity of 20 and 5 elements are pushed and then 3 elements are popped”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

Dynamic array implementation is the correct answer to “What type of stack implementation allows for the stack to grow dynamically as needed”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

4 is the correct answer to “Evaluate the following and choose the correct answer. a/b+c*d where a=4, b=2, c=2, d=1.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

|&-+ab/cdef is the correct answer to “What would be the Prefix notation for the given equation? a+b-c/d&e|f”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

O (N) is the correct answer to “What is the time complexity of balancing parentheses algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

6 is the correct answer to “Using the evaluation of infix expression, evaluate a^b+c and choose the correct answer. (a=2, b=2, c=2)”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

6 is the correct answer to “Evaluate the postfix expression ab + cd/- where a=5, b=4, c=9, d=3.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

abcd^e-fgh*+^*+i- is the correct answer to “What is the correct postfix expression for the following expression? a+b*(c^d-e)^(f+g*h)-i”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

2 is the correct answer to “What would be the solution to the given prefix notation? / / / 16 4 2 1”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

O(N) is the correct answer to “What is the time complexity of an infix to postfix conversion algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

++ABC and AB+C+ is the correct answer to “What would be the Prefix notation and Postfix notation for the given equation? A+B+C”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

False is the correct answer to “Is the given statement ((A+B) + [C-D]] valid with respect to balancing of symbols”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

+A*B^CD is the correct answer to “What would be the Prefix notation for the given equation? A+B*C^D”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

5*4=20 is pushed into the stack is the correct answer to “Consider the stack | 5 | | 4 | | 3 | | 2 |. At this point, '*' is encountered. What has to be done”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

-6 is the correct answer to “What would be the solution to the given prefix notation? - + 1 2 * 3 / 6 2”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

False is the correct answer to “Parentheses are simply ignored in the conversion of infix to postfix expression.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

O(logn) is the correct answer to “What is the time complexity for converting decimal to binary numbers”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

push it on to the stack is the correct answer to “What should be done when an opening parentheses is read in a balancing symbols algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

25 is the correct answer to “What is the value of the postfix expression 2 3 + 4 5 6 - - *”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

True is the correct answer to “Evaluation of infix expression is done based on precedence of operators.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

If the precedence of operator is higher, pop two operands and evaluate is the correct answer to “Which of the following statement is incorrect with respect to evaluation of infix expression algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

False is the correct answer to “Reverse Polish Notation is the reverse of a Polish Notation.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

14 is the correct answer to “Using the evaluation of prefix algorithm, evaluate +-9 2 7.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

([ )] is the correct answer to “Which of the following statement is incorrect with respect to balancing symbols algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

True is the correct answer to “An error is reported when the stack is not empty at the end.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

one is the correct answer to “How many stacks are required for reversing a word algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

6 is the correct answer to “Evaluate the following infix expression using algorithm and choose the correct answer. a+b*c-d/e^f where a=1, b=2, c=3, d=4, e=2, f=2.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

O(n) where n is the length of the equation is the correct answer to “The time complexity of converting a prefix notation to infix notation is . . . . . . . .”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

aidni olleh is the correct answer to “What will be the output of the following program? main() { char str[]="hello india"; int len = strlen(str); int i; for(i=0;i<len;i++) push(str[i]); // pushes an element into stack for(i=0;i<len;i++) pop(); //pops an element from the stack }”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

stack is the correct answer to “Which is the most appropriate data structure for reversing a word”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

a-(b+c)*(d/e) is the correct answer to “The postfix expression abc+de/*- is equivalent to which of the following infix expression”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

false is the correct answer to “An error is thrown if the character '\n' is pushed in to the character stack.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

a b op is the correct answer to “Which of the following is valid reverse polish expression”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

*+AB-CD is the correct answer to “The prefix expression of the postfix expression AB+CD-* is . . . . . . . .”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

'~' and '^' is the correct answer to “Which of these operators have the highest order of precedence”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

12 is the correct answer to “From the given expression tree, identify the infix expression, evaluate it and choose the correct result.”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

15 is the correct answer to “What would be the solution to the given prefix notation? + 9 * 3 / 8 4”. This question is standard in competitive examination syllabi for Stacks In Data Structures.

two is the correct answer to “How many stacks are required for applying evaluation of infix expression algorithm”. This question is standard in competitive examination syllabi for Stacks In Data Structures.