Balanced Parenthesis Multiple choice Questions and Answers (MCQs)
What is the time complexity of balancing parentheses algorithm?
O (N log N)
O (M log N)
Question 1 Explanation:
The time complexity of balancing parentheses algorithm is mathematically found to be O (N).
Which application of stack is used to ensure that the pair of parentheses is properly nested?
Reversing a stack
Conversion of an infix to postfix expression
Conversion of an infix to prefix expression
Question 2 Explanation:
Balancing symbols application ensures that the pair of parentheses are properly nested while reversing stack reverses a stack.
In balancing parentheses algorithm, the string is read from?
right to left
left to right
center to right
center to left
Question 3 Explanation:
Any string is read by the compiler from left to right and not from right to left.
Which is the most appropriate data structure for applying balancing of symbols algorithm?
Question 4 Explanation:
Stack is the most appropriate data structure for balancing symbols algorithm because stack follows LIFO principle (Last In First Out).
Which of the following does the balancing symbols algorithm include?
balancing double quotes
balancing single quotes
balancing operators and brackets
balancing parentheses, brackets and braces
Question 5 Explanation:
The balancing symbols algorithm using stack only includes balancing parentheses, brackets and braces and not any other symbols.
There are 5 questions to complete.