## MCQ - Stack in Data Structure

11. Process of removing an element from stack is called __________

View Answer

12.Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

View Answer

13. Which of the following applications may use a stack?

View Answer

14.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: (()(())(())) are:

View Answer

15.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?

View Answer

16. The data structure required to check whether an expression contains balanced parenthesis is?

View Answer

17. 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?

View Answer

18. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

View Answer

19.The process of accessing data stored in a serial access memory is similar to manipulating data on a ________

View Answer

20.The postfix form of A*B+C/D is?

View Answer

**Also Check : **