You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?
(a) Dynamic programming
(b) Recursion
(c) Brute force
(d) Dynamic programming, Recursion and Brute force
I have been asked this question by my school teacher while I was bunking the class.
I want to ask this question from Counting Boolean Parenthesizations in chapter Dynamic Programming of Data Structures & Algorithms II
