P15CS34 Page No...

1
U.S.N

P.E.S. College of Engineering, Mandya - 571 401

(An Autonomous Institution affiliated to VTU, Belagavi)
Third Semester, B.E. - Computer Science and Engineering
Semester End Examination; March - 2021
Discrete Mathematical Structures
Time: 3 hrs Max. Marks: 100
Note: Answer FIVE full questions, selecting ONE full question from each unit.
UNIT - I
1 a. Find the number of license plates created which contains two English alphabets followed by
6
four digits, i) With repetition and ii) Without repetition.
b. How many arrangements are these of all the letters in MASSASAUGA such that four A’s
6
are together?
c. i) Determine the coefficient of x 2 y z 2 in the expansion (2 x + y + 3 z )5
8
ii) Determine the coefficient of x 2 y 2 z 3 in the expansion of (3 x − 2 y − 4 z )7

2 a. Use the laws of set theory, simplify the expression ( A ∪ B) ∩ C ∪ B. 3

b. Over the internet data are transmitted in structured blocks of bits called datagram’s?
i) In how many ways can the letters in DATAGRAM be arranged? 4
ii) For the arrangements of part (i) how many have all three ‘A’ together?
c. The board of directors of pharmaceutical corporations has 10 members. An upcoming stock
holders meeting is scheduled to approve a new state of company officers (chosen from the
10 board members):
I) How many different slates consisting of a president, vice-president, secretary and treasurer
6
can be the board present to the stock holders for their approval?
II) Three members of the board of directors are physicians. How many slates from part (I)
have; i) A physician nominated for presidency
ii) Exactly one physician appearing on the state
d. A manufacturer of 2000 automobile batteries is carried about defective terminals and
defective plates. If 1920 of batteries have neither defect, 60 have defective plates and 20 have 7
both defects. How many batteries have defective terminals?
UNIT - II
3 a. Prove the following logical equivalence:
6
( p → q ) ∧ [¬ q ∧ (r ∨ ¬ q )] ≡ (q ∨ p )
b. Find whether the following argument is valid: 8
If a triangle has two equal sides, then it is isosceles,
If a triangle is isosceles, thus it has two equal angle,
The triangle ABC does not have two equal angles.
∴ ABC does not have two equal sides.
Contd... 2
 P15CS34 Page No... 2
c. Convert the following statement to symbolic form and also write its negation:
6
“For all x, if x is odd, then x2−1 is even”.
4 a. Using the laws of logic, simplify the given statement (p → q ) ∧ [¬ q ∧ (r ∨ ¬ q )]. 6
b. Establish the validity of the following argument:
p∧q
p → (r ∧ q)
r → (s ∨ t) 8
¬s
_______________
∴t
c. Prove that the following argument is valid where in c is specified element of the universe.
∀x[ p ( x) → q ( x)]
∀x[q ( x) → r ( x)]
6
¬r (c)
____________
∴ ¬p ( c )
UNIT - III
1
5 a. Prove by mathematical induction that 12 + 32 + 52 + − − − − + (2n − 1) 2 = n(2n − 1)(2n + 1) . 6
3
b. A sequence {cn} is defined recursively by cn = 3cn −1 − 2cn − 2 for all n ≥ 3 with C1 = 5 and
6
C2 = 3 as initial conditions. Show that cn = −2n + 7.
c. If A = {1, 2, 3, 4}, B = {2, 5}, C = {3, 4, 7}
8
Determine AXB, BXA, A ∪ ( BXC ), ( A ∪ B ) XC , ( AXC ) ∪ ( BXC ) .
6 a. i) For n ≥ 2 any sets A1 , A2 , − − − − − An ∈ U

Prove that A1 ∪ A2 − − − − ∪ An = A1 ∩ A2 ∩ − − − ∩ An .
7
ii) The Fibonacci numbers are defined recursively by F0 = 0, F1 = 1 and Fn = Fn-1+Fn-2
for n ≥ 2 . Evaluate F2, F5, and F7.
b. Define permutation function, hashing function and characteristic function. 7
c. i) Let f, g: R→R where g(x) = 1−x +x2 and f(x) = ax + b. If gof (x) = 9x2− 9x +3, determine
a, b.
6
1 2 3 4 5 6 -1 2
ii) Given p =   . Compute p , p .
 2 4 3 1 5 6 
UNIT - IV
7 a. Let A = {1, 2, 3, 4} and R = {(1, 1), (1, 2), (2, 1), (3, 1), (3, 3), (1, 3), (4, 1), (4, 4)} be a
6
relation on A. Is R is an equivalence relation?
b. Draw Hasse diagram for divisors of 36. 8
c. Let A = {1, 2, 3, 4, 6} and R be a relation defined by aRb if and only if a is multiple of b. 6
Represent the relation R as matrix and draw its digraph.
Contd... 3
 P15CS34 Page No... 3
8 a. Consider the following relation on set A= (1, 2, 3}, R1 = {(1, 1), (1, 2), (1, 3), (3, 3)} and
R2 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}. Which of these are; 6
i) Reflexive ii) Symmetric iii) Transitive iv) Anti symmetric
b. The digraph for a relation on the set A = {1, 2, 3, 4} is shown in Fig. 8(b).
i) Verify that (A, R) is a Poset and find its Hasse diagram ii) Topological sort (A, R)

c. For the posets shown in the following Fig.8(c) find:

i) All upper bounds ii) L∪B and GLB of the set B = {3, 4, 5}

UNIT - V
9 a. Define cyclic group and show that (G, *) whose multiplication table is given is cyclic.
* a b c d e f
a a b c d e f
b b c d e f a 6
c c d e f a b
d d e f a b c
e e f a b c d
f f a b c d e
b. Explain Lagragis theorem. If G is a group of order n and a ∈G, prove that an = e. 6
c. Define the following terms with respect to coding theory:
8
i) Parity checkcode ii) Hamming distance iii) Group code iv) Generator matrix
10 a. The parity-check matrix for an encoding function Z 23 → Z 26 is given by
1 0 1 1 0 0
H = 1 1 0 0 1 0
1 0 1 0 0 1 
6

i) Determine associated gennerator matrix

ii) Does this code correct all single error in transmission
b. Let G is a group and a, b ∈G, prove that
6
i ) ( a −1 ) −1 = a ii ) (ab) −1 = b −1 a −1
c. Define Sub group. If H, K are sub group of G, prove that H ∧ K is also subgroup. 8

***