Redirected
recategorized by
6,603 views
5 votes
5 votes

In how many ways can the string $A \cap B - A \cap B -A$ be fully paranthesized to yield an infix expression?

  1. 15
  2. 14
  3. 13
  4. 12
recategorized by

3 Answers

2 votes
2 votes
Actually there is a formula
No of ways we can parenthesise n operands(like in matrix multiplication,arithmetic exp )=
                                    Catalan No(n-1)=$1/(n)*\binom{2(n-1)}{(n-1))}$

Here n=5 So no of way would be Catalan No(4)=$1/(5)*\binom{8}{4}$=14
0 votes
0 votes
answer is 14 that is 2 option.
Answer:

Related questions

4 votes
4 votes
1 answer
1
4 votes
4 votes
3 answers
3
go_editor asked Aug 16, 2016
3,996 views
Pipelining improves performance bydecreasing instruction latencyeliminating data hazardsexploiting instruction level parallelismdecreasing the cache miss rate