Balanced Parenthesis MCQ

Test your knowledge with important Balanced Parenthesis MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Balanced Parenthesis MCQs at Bissoy

• How many passes does the balancing symbols algorithm makes through the input?
  ক

  one

  খ

  two

  গ

  three

  ঘ

  four
• Is the given statement ((A+B) + ] valid with respect to balancing of symbols?
  ক

  ] valid with respect to balancing of symbols? ] True

  খ

  C-D

  গ

  C-D

  ঘ

  C-D
• An error is reported when the stack is not empty at the end.
  ক

  True

  খ

  False
• If the corresponding end bracket/braces/parentheses is encountered, which of the following is done?
  ক

  push it on to the stack

  খ

  pop the stack

  গ

  throw an error

  ঘ

  treated as an exception
• When the corresponding end bracket/braces/parentheses is not found, what happens?
  ক

  The stack is popped

  খ

  Ignore the parentheses

  গ

  An error is reported

  ঘ

  It is treated as an exception
• What should be done when an opening parentheses is read in a balancing symbols algorithm?
  ক

  push it on to the stack

  খ

  throw an error

  গ

  ignore the parentheses

  ঘ

  pop the stack
• 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
• Which is the most appropriate data structure for applying balancing of symbols algorithm?
  ক

  stack

  খ

  queue

  গ

  tree

  ঘ

  graph
• In balancing parentheses algorithm, the string is read from?
  ক

  right to left

  খ

  left to right

  গ

  center to right

  ঘ

  center to left
• Which application of stack is used to ensure that the pair of parentheses is properly nested?
  ক

  Balancing symbols

  খ

  Reversing a stack

  গ

  Conversion of an infix to postfix expression

  ঘ

  Conversion of an infix to prefix expression
• What is the time complexity of balancing parentheses algorithm?
  ক

  O (N)

  খ

  O (N log N)

  গ

  O (M log N)

  ঘ

  O (N2)