Register

UGC NET CSE | December 2007 | Part 2 | Question: 1

• edited by
1,081 views
2 votes
2 votes

A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls are red and two are green ?

  1. $\large\frac{3}{7}$
  2. $\large\frac{4}{7}$
  3. $\large\frac{5}{7}$
  4. $\large\frac{6}{7}$
• edited by
User Avatar

1 Answer

1 votes
1 votes
$4$  balls can be chosen from  $10$  balls in   $^{10}C_4$ ways. (Total number of ways)

The desirable(favourable) case is choosing $2$ red balls from $6$ red balls and choosing $2$ green balls from $4$ green balls.

So the required probability would be:  $\frac{^{6}C_2\times ^{4}C_2}{^{10}C_4}$  $=$  $\frac{3}{7}$

Option A is correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
go_editor asked Mar 28, 2020
1,249 views
UGC NET CSE | December 2007 | Part 2 | Question: 2
The number of edges in a complete graph with $‘n’$ vertices is equal to : $n(n-1)$ $\large\frac{n(n-1)}{2}$ $n^2$ $2n-1$
The number of edges in a complete graph with $‘n’$ vertices is equal to :$n(n-1)$$\large\frac{n(n-1)}{2}$$n^2$$2n-1$
User Avatar
0 votes
0 votes
1 answer
2
go_editor asked Mar 28, 2020
550 views
UGC NET CSE | December 2007 | Part 2 | Question: 3
A context free grammar is : type $0$ type $1$ type $2$ type $3$
A context free grammar is :type $0$type $1$type $2$type $3$
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Mar 28, 2020
567 views
UGC NET CSE | December 2007 | Part 2 | Question: 4
Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to : the maximum weight of a non zero code word the minimum weight of a non zero code word m n
Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to :the maximum weight of a non zero code wordthe minimum weight of a non zero code wordmn
User Avatar
1 votes
1 votes
1 answer
4
go_editor asked Mar 28, 2020
1,448 views
UGC NET CSE | December 2007 | Part 2 | Question: 5
Consider a Moore machine $M$ whose digraph is : Then $L(M)$, the language accepted by the machine M, is the set of all strings having : two or more b’s three or more b’s two or more a’s three or more a’s
Consider a Moore machine $M$ whose digraph is :Then $L(M)$, the language accepted by the machine M, is the set of all strings having :two or more b’sthree or more b’s...
User Avatar
Link Copied!