ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the maximum number of ways in which a boolean expression with n + 1 terms can be parenthesized, such that the output is true?
Correct Answer: A — nth catalan number
The number of ways will be maximum when all the possible parenthesizations result in a true value. The number of possible parenthesizations is given by the nth catalan number.