The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged ballsinbins
0
votes
2
answers
1
ISI2017DCG28
A basket contains some white and blue marbles. Two marbles are drawn randomly from the basket without replacement. The probability of selecting first a white and then a blue marble is $0.2$. The probability of selecting a white marble in the first draw is $0.5$. What is the ... blue marble in the second draw, given that the first marble drawn was white? $0.1$ $0.4$ $0.5$ $0.2$
asked
Sep 18, 2019
in
Probability
by
gatecse
Boss
(
17.5k
points)

59
views
isi2017dcg
probability
ballsinbins
+1
vote
1
answer
2
CMI2018A7
Let $C_{n}$ be the number of strings $w$ consisting of $n$ $X's$ and $n$ $Y's$ such that no initial segment of $w$ has more $Y's$ than $X's.$ Now consider the following problem. A person stands on the edge of a swimming pool holding a bag of $n$ red and $n$ blue balls. He draws a ... $\frac{C_{n}}{\binom{2n}{n}}$ $\frac{n\cdot C_{n}}{(2n)!}$ $\frac{n\cdot C_{n}}{\binom{2n}{n}}$
asked
Sep 13, 2019
in
Probability
by
gatecse
Boss
(
17.5k
points)

41
views
cmi2018
conditionalprobability
ballsinbins
+17
votes
3
answers
3
TIFR2017A5
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins? $3^{35}$ $3^{50}2^{50}$ $\binom{35}{2}$ $\binom{50}{15} \cdot 3^{35}$ $\binom{37}{2}$
asked
Dec 21, 2016
in
Combinatory
by
jothee
Veteran
(
105k
points)

1.1k
views
tifr2017
permutationandcombination
discretemathematics
normal
ballsinbins
+23
votes
3
answers
4
TIFR2015A8
There is a set of $2n$ people: $n$ male and $n$ female. A good party is one with equal number of males and females (including the one where none are invited). The total number of good parties is. $2^{n}$ $n^{2}$ $\binom{n}{⌊n/2⌋}^{2}$ $\binom{2n}{n}$ None of the above.
asked
Dec 5, 2015
in
Combinatory
by
makhdoom ghaya
Boss
(
30.8k
points)

1.1k
views
tifr2015
permutationandcombination
discretemathematics
normal
ballsinbins
+19
votes
5
answers
5
TIFR2013A9
There are $n$ kingdoms and $2n$ champions. Each kingdom gets $2$ champions. The number of ways in which this can be done is: $\frac{\left ( 2n \right )!}{2^{n}}$ $\frac{\left ( 2n \right )!}{n!}$ $\frac{\left ( 2n \right )!}{2^{n} . n!}$ $\frac{n!}{2}$ None of the above.
asked
Nov 4, 2015
in
Combinatory
by
makhdoom ghaya
Boss
(
30.8k
points)

963
views
tifr2013
permutationandcombination
discretemathematics
normal
ballsinbins
+17
votes
1
answer
6
TIFR2012A7
It is required to divide the $2n$ members of a club into $n$ disjoint teams of $2$ members each. The teams are not labelled. The number of ways in which this can be done is: $\frac{\left ( 2n \right )!}{2^{n}}$ $\frac{\left ( 2n \right )!}{n!}$ $\frac{\left ( 2n \right )!}{2^n . n!}$ $\frac{n!}{2}$ None of the above.
asked
Oct 26, 2015
in
Combinatory
by
makhdoom ghaya
Boss
(
30.8k
points)

1.3k
views
tifr2012
permutationandcombination
ballsinbins
+28
votes
8
answers
7
GATE2004IT35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$
asked
Nov 2, 2014
in
Combinatory
by
Ishrat Jahan
Boss
(
16.3k
points)

3.3k
views
gate2004it
permutationandcombination
normal
ballsinbins
+16
votes
5
answers
8
GATE200334
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be placed in the bags if each bag must contain at least $k$ ... $\left( \begin{array}{c} m  kn + n + k  2 \\ n  k \end{array} \right)$
asked
Sep 16, 2014
in
Combinatory
by
Kathleen
Veteran
(
52.2k
points)

2.6k
views
gate2003
permutationandcombination
ballsinbins
normal
+22
votes
3
answers
9
GATE200213
In how many ways can a given positive integer $n \geq 2$ be expressed as the sum of $2$ positive integers (which are not necessarily distinct). For example, for $n=3$ the number of ways is $2$, i.e., $1+2, 2+1$. Give only the answer ... integer $n \geq k$ be expressed as the sum of $k$ positive integers (which are not necessarily distinct). Give only the answer without explanation.
asked
Sep 16, 2014
in
Combinatory
by
Kathleen
Veteran
(
52.2k
points)

1.5k
views
gate2002
permutationandcombination
normal
descriptive
ballsinbins
To see more, click for the
full list of questions
or
popular tags
.
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
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged ballsinbins
Recent Blog Comments
@saxena0612 , Sir since they are not considering...
Hey Everyone! Those who think that they are...
Which questions are u challenging..?
ONLY T MADE EASY STUDENTS CAN UNDERSTAND,
Yes and few more questions also
50,737
questions
57,357
answers
198,483
comments
105,254
users