Corrected version: http://codepad.org/wlvIr0Km
On Fri, Oct 22, 2010 at 9:47 PM, Anand <[email protected]> wrote: > Counting Boolean > Parenthesizations<http://people.csail.mit.edu/bdean/6.046/dp/>. > You are given a boolean expression consisting of a string of the symbols > 'true', 'false', 'and', 'or', and 'xor'. Count the number of ways to > parenthesize the expression such that it will evaluate to true. For example, > there is only 1 way to parenthesize 'true and false xor true' such that it > evaluates to true. > > http://codepad.org/gCSRe9m8. > > > Is the above logic correct? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
