Aspire Faculty ID #19321 · Topic: UGC NET Computer Science Dec 2018 (Paper II) · Just now
UGC NET Computer Science Dec 2018 (Paper II)

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 will be red and two will be green?

Solution

Total balls are

$6+4=10$

Number of ways to select $4$ balls from $10$ balls is

${}^{10}C_4$

We need exactly $2$ red balls and $2$ green balls.

Number of ways to select $2$ red balls from $6$ red balls is

${}^{6}C_2$

Number of ways to select $2$ green balls from $4$ green balls is

${}^{4}C_2$

So, required probability is

$\dfrac{{}^{6}C_2 \times {}^{4}C_2}{{}^{10}C_4}$

$=\dfrac{15 \times 6}{210}$

$=\dfrac{90}{210}$

$=\dfrac{3}{7}$

Previous 10 Questions — UGC NET Computer Science Dec 2018 (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science Dec 2018 (Paper II)

Ascending by ID
1
A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train or Automobile …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
2
Which of the following statements are true? $(i)$ Every logic network is equivalent to one using just NAND gates or jus…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
3
The relation $\leq$ and $<$ on a Boolean algebra are defined as: $x\leq y$ if and only if $x\vee y=y$ $x<y$ means…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
4
The Boolean expression $\overline{A}\cdot B+A\cdot \overline{B}+A\cdot B$ is equivalent to:
Topic: UGC NET Computer Science Dec 2018 (Paper II)
5
In PERT/CPM, the merge event represents _____ of two or more events.
Topic: UGC NET Computer Science Dec 2018 (Paper II)
6
Use Dual Simplex Method to solve the following problem: Maximize $z=-2x_1-3x_2$ subject to: $x_1+x_2\geq 2$ $2x_1+x_2\l…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
7
In computers, subtraction is generally carried out by:
Topic: UGC NET Computer Science Dec 2018 (Paper II)
8
Consider the following Boolean equations:$(i)\ wx+w(\overline{x}+y)+x(\overline{x}+y)=x+wy$$(ii)\ (w\overline{x}(y+x\ov…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
9
Consider the graph shown below : Use Kruskal's algorithm to find the minimum spanning tree of the graph. The weigh…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
10
Consider the following statements: $(i)$ Auto increment addressing mode is useful in creating self-relocating code. $(i…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
Ask Your Question or Put Your Review.

loading...