Recent questions tagged catalan-number

20 votes

2 answers

GATE CSE 1990 | Question: 3-iii
The number of rooted binary trees with $n$ nodes is, Equal to the number of ways of multiplying $(n+1)$ matrices. Equal to the number of ways of arranging $n$ out of $2 n$ distinct elements. Equal to $\frac{1}{(n+1)}\binom{2n}{n}$. Equal to $n!$.

The number of rooted binary trees with $n$ nodes is,Equal to the number of ways of multiplying $(n+1)$ matrices.Equal to the number of ways of arranging $n$ out of $2 n$ ...

makhdoom ghaya

5.4k views

makhdoom ghaya asked Nov 19, 2016

52 votes

2 answers

GATE CSE 1991 | Question: 16,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$

Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's....

Kathleen

6.5k views

Kathleen asked Sep 12, 2014

To see more, click for the full list of questions or popular tags.

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