Scribd
Upload
4 views2 pages

Python

The document is a question bank for Discrete Mathematics and Statistics, containing various problems related to set theory, relations, mathematical induction, and combinatorial principles. It includes tasks such as drawing Venn diagrams, finding transitive closures, proving equivalence relations, and applying the Pigeonhole principle. Additionally, it requires symbolic representation of statements and derivation of canonical forms.

Uploaded by

sandesh.pdeacoem
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views2 pages

Python

The document is a question bank for Discrete Mathematics and Statistics, containing various problems related to set theory, relations, mathematical induction, and combinatorial principles. It includes tasks such as drawing Venn diagrams, finding transitive closures, proving equivalence relations, and applying the Pigeonhole principle. Additionally, it requires symbolic representation of statements and derivation of canonical forms.

Uploaded by

sandesh.pdeacoem
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Discrete Mathematics and Statistic

Question Bank

1 100 Sportsmen were asked whether they play which game: cricket,
Hockey, Football. The results are: [6]
45 play cricket, 38 play Hockey, 21 play Football, 18 play Cricket and
Hockey, 9 play Cricket and Football, 4 play Football and Hockey and
23 play none of these.
Draw a Venn diagram that will show the results of the survey and
The number of sportsmen who play:
i) Exactly one of the games
ii) Exactly two of the games
2 Given a relation R= {(1, 2), (2, 3), (3, 4), (2, 1)} on A= {1, 2, 3, 4}. Find
The transitive closure of R by Warshall’s algorithm.
3 if x = {1, 2, 3.......7} and R = {(x, y) | x–y is divisible by 3}. Show that R
Is an equivalence relation. Draw the digraph of R.
4 Prove the following statement by mathematical induction.
P (n): (13+ 23+...............+n3) = n2 (n+1)2 /4
5 Out of integers 1 to 1000.
i) How many are not divisible by 3 nor by 7?
ii) How many are not divisible by 5 & 7 but divisible by 3?
6 By mathematical induction prove that,
P (n):1+4+7+…..+ (3n-2) =n (3n-1)/2
7 Among 50 students in a class, 26 got an A in the first examination and 21
Got an A in the second examination. If 17 students did not get an A in
Either examination, how many students got an A in both examinations?
8 Prove that the relation R “a – b is divisible by 5” for all a & b which are
Belongs to set off +ve integers is an equivalence relation.
9 Let A= {1, 2, 3, 4} and Let
R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (3, 1), (2, 3), (3, 2), (3, 3), (4, 4)}.
Show that R is an equivalence relation and determine the equivalence
Classes and hence find the rank of R.
10 Prove by Mathematical induction.
0.2+1.2+2.2+3.2+……+n2^n= (n-1)2^n+1 +2 for n > =0

11 obtain CNF and DNF Of


i) (p → q) ∨ (q → p)
ii) (p∧( p → q)) → q
12 Write the following statement in symbolic form.
i) At least one integer is even
ii) There exists an even integer divisibly by 5
iii) If x is even and x is perfect square, then x is divisible by 4
iv) No even integer is divisible by 5

13 Find the transitive closure of R by Warshall’s algorithms where


A={1,2,3,4,5,6} and R ={(x,y)||x-y| =2}
14 Explain Pigeonhole principle using pigeonhole principle show that if
7 colours are used to paint 50 bicycles, at least 8 bicycles well have the
Same colour
15 Explain with example, notation used and mathematical expression
To describe the following terms:
i) Universal set
ii) Subset
iii) Union of sets
iv) Power set

You might also like