DM Unit Test I - 2021-22

(SEIT_SEM1_214441_DM_2021-22)
1. All questions are compulsory.

2. There are 30 question of 1 mark each.

3. Mark for the most relevant answer will be considered.

All the best .....

1. Roll No.(5 Digits) *

23313

2. Name of Student *

Kiran Pacharne

3. If two events X and Y are considered as partially overlapping events then rule of
addition can be written as *
(1 Point)

P(X or Y) = P(X) + P(Y) + P(X - Y)

P(X or Y) = P(X) + P(Y) - P(X and Y)

P(X or Y) = P(X) - P(Y) + P(X and Y)

P(X or Y) = P(X) * P(Y) + P(X - Y)

4. Which of the following option is true? *
(1 Point)

3 +2 = 8 if 5-2 = 3

1 > 3 and 3 is a positive integer

-2 > 3 or 3 is a negative integer

If the moon is a planet, lions will fly

5. {x: x is a real number between 1 and 2} is an *

(1 Point)

Power set

Infinite set

Empty set

Finite set

6. The difference of {1, 2, 3} and {1, 2, 5} is the set ____________ *

(1 Point)

{2}

{3}

{5}

{1}

7. In probability theories, events which can never occur together are classified as *
(1 Point)

collectively exclusive events

mutually exhaustive events

mutually exclusive events

collectively exhaustive events

 8. If v,e and r are the total number of vertices, edges and regions in the graph,
then for any connected planar graph, which condition is satisfied? *
(1 Point)

v+e+r=2

v-e+r=2

v+e-r=2

v-e-r=2

9. There are 7 men and 8 women and you need to form a committee of 4 men
and 5 women. In how many ways can the committee be formed? *
(1 Point)

91

7560

5644800

1960

10. A box contains 4 red, 3 white and 5 blue balls. Three balls are drawn at random.
Find out the number of ways of selecting the balls of different colours? *
(1 Point)

12

120

220

60

11. The compound proposition ((p ∨ (r ∨ q)) ∧ ∼(∼q ∧ ∼r) is equivalent to *

(1 Point)

(p ∧ r) ∨ (p ∧ q)
 q∨r

(p ∨ q) ∧ ∼(p ∨ r)

((p ∨ r) ∨ q)) ∧ (p ∨ r)

12. A graph is know as null graph if *

(1 Point)

it has no vertices

it has no edges

at least one vertex is isolated

it has no edges and no vertices

13. The number of colours required to colour the wheel graph with n vertices
where n is odd is *
(1 Point)

n-1

14. Let C = {1,2,3,4} and D = {1, 2, 3, 4} then which of the following hold not true in
this case? *
(1 Point)

C∩D=C–D

CUD=C∩D

C–D=Φ

C–D=D–C
15. An undirected graph possesses an Eulerian path if *
(1 Point)

it is connected and has even no. of vertices ( > 2 ) of odd degree.

it is connected with at least 2 pendant vertices

it is connected and has all vertices of odd degree.

it is connected and has either zero or two vertices of odd degree.

16. Write set {1, 5, 15, 25,…} in set-builder form. *

(1 Point)

{x: either x=1 or x=5n, where n is a real number}

{x: either x=1 or x=5n, where n is an odd natural number}

{x: x=5n, where n is a natural number}

{x: either x=1 or x=5n, where n is a integer}

17. In how many different ways can 4 girls and 4 boys form a circle such that the
boys and the girls alternate? *
(1 Point)

48

576

144

30

18. A subgraph G᾽ of G is known as spanning subgraph if *

(1 Point)

only if G' contains Eulerian path

G' contains all the edges of G

 G contains all the vertices of G

only if G' contains Hamiltonian path

19. How many 4 digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9
which are divisible by 5 and none of the digits is repeated? *
(1 Point)

10

120

20

60

20. Complete graph with n vertices has _________ edges *

(1 Point)

n-1

n(n-1)

n(n-1)/2

21. In a survey of 150 people it is found that 61 like to drink milk, 73 like coffee and
59 like tea. Also 33 like both milk and tea, 25 like milk and coffee, 40 like tea
and coffee and 22 like none of the three drinks. Find the number of people who
like all the three drinks. *
(1 Point)

33

55

22

95
22. In how many different ways can the letters of the word 'PICTPUNE' be arranged
so that the vowels always come together? *
(1 Point)

120

720

360

60

23. If A is {{Φ}, {Φ, {Φ}}}, then the power set of A has how many element? *
(1 Point)

24. A path in a connected graph G is Hamiltonian path if *

(1 Point)

it contains every vertex of G exactly once

G has even number of vertices

G has odd number of vertices

it contains every edge of G exactly once

25. How many edges are there in the graph K4,5? *

(1 Point)

10
 20

40

26. The graph with n vertices, if the degree of each vertex is k(<n-1), then the
graph is called  *
(1 Point)

simple

regular

connected

complete

27. If a person buys a lottery, chance of winning a Toyota car is 60%, chance of
winning Hyundai car is 70% and chance of winning both is 40% then
probability of winning Toyota or Hyundai is *
(1 Point)

1.3

0.9

0.6

1.7

28. Which of the following statement is a proposition? *

(1 Point)

The only odd prime number is 2

God bless you!

Get me a glass of milkshake.

What is the time now?

29. A = {∅,{∅},2,{2,∅},3}, which of the following is true? *
(1 Point)

{{∅,{∅}} ∈ A

{∅} ⊂ A

{2} ∈ A

3⊂A

30. The maximum degree of any vertex in a simple graph with n vertices is *
(1 Point)

n-1

31. If a bag contains three fruits, 16 percent are apples, 30 percent are oranges and
20 percent some other fruit that is neither oranges nor apples then probability
of selecting an orange randomly is *
(1 Point)

0.66

0.70

0.30

0.26

32. A bag contains 6 white balls, 5 black balls and 4 red balls. In how many ways
can 3 balls be drawn from the bag, if at least one black ball is to be included in
the draw? *
(1 Point)

455
 2730

120

335

This content is created by the owner of the form. The data you submit will be sent to the form owner. Microsoft is
not responsible for the privacy or security practices of its customers, including those of this form owner. Never give
out your password.

Powered by Microsoft Forms |

The owner of this form has not provided a privacy statement as to how they will use your response data. Do not
provide personal or sensitive information.
| Terms of use