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

A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train or Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows:

Bus $30$ people; Train $35$ people; Automobile $100$ people; Bus and Train $15$ people; Bus and Automobile $15$ people, Train and Automobile $20$ people; and all the three methods $5$ people. How many people completed the survey form?

Solution

Let Bus, Train and Automobile be represented by $B,T,A$ respectively.

Given,

$n(B)=30$

$n(T)=35$

$n(A)=100$

$n(B\cap T)=15$

$n(B\cap A)=15$

$n(T\cap A)=20$

$n(B\cap T\cap A)=5$

Using the formula,

$n(B\cup T\cup A)=n(B)+n(T)+n(A)-n(B\cap T)-n(B\cap A)-n(T\cap A)+n(B\cap T\cap A)$

Now,

$n(B\cup T\cup A)=30+35+100-15-15-20+5$

$=165-50+5$

$=120$

Therefore, $120$ people completed the survey form.

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
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)
2
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)
3
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)
4
In PERT/CPM, the merge event represents _____ of two or more events.
Topic: UGC NET Computer Science Dec 2018 (Paper II)
5
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)
6
In computers, subtraction is generally carried out by:
Topic: UGC NET Computer Science Dec 2018 (Paper II)
7
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)
8
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)
9
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)
10
A computer uses a memory unit with $256K$ words of $32$ bits each. A binary instruction code is stored in one word of m…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
Ask Your Question or Put Your Review.

loading...