Vidyalelo
Data Structure · Q91

Dynamic Programming in Data Structures

Programming · Data Structure · question 91

Q91

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?

A.
nth catalan number
Answer
B.
n factorial
C.
n cube
D.
n square

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board