The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+16 votes
685 views

Match the pairs in the following questions by writing the corresponding letters only.

(A). The number distinct binary trees with $n$ nodes. (P). $\frac{n!}{2}$
(B). The number of binary strings of length of $2n$ with an equal number of $0’s$ and $1’s$. (Q). $ \binom{3n}{n}$
(C). The number of even permutation of $n$ objects. (R). $\binom{2n}{n}$
(D). The number of binary strings of length $6n$ which are palindromes with $2n$  $0’s$. (S). $\frac{1}{1+n}\binom{2n}{n}$
asked in Combinatory by Veteran (59.4k points)
retagged by | 685 views

2 Answers

+20 votes
Best answer

(A) - S Catalyn no  http://gatecse.in/wiki/Number_of_Binary_trees_possible_with_n_nodes

(B) - R. Choosing n locations out of 2n to place 0. Remaining automatically become 1.

(C) -P An even permutation is a permutation obtainable from an even number of two-element swaps, For a set of n elements and n>2, there are n!/2 even permutations. Ref -> http://mathworld.wolfram.com/EvenPermutation.html

(D) -> Q 

Length = 6n, as it is palindrome, we need to only consider half part.

Total Length to consider 3n (Remaining 3n will be revese of this 3n)

now Choosing n 0's out of 3n. So Q is correct for D.

answered by Boss (42.4k points)
selected by
+1 vote
Answer:

A - S
B - R
C - P
D - Q
answered by Boss (34.2k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

34,776 questions
41,742 answers
118,910 comments
41,389 users