Scribd
Upload
67 views

Question Paper Code:: Reg. No.

This document is an exam for a Discrete Mathematics course covering topics like logic, sets, functions, relations, and graph theory. It contains 15 multiple choice and written response questions testing students' knowledge of concepts like truth tables, logical deduction, induction, counting, groups, lattices, and graphs. Students are asked to complete truth table proofs, solve recurrence relations, identify properties of mathematical structures, and prove statements about graphs. The exam aims to evaluate students' understanding of core discrete mathematics concepts.

Uploaded by

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

Question Paper Code:: Reg. No.

This document is an exam for a Discrete Mathematics course covering topics like logic, sets, functions, relations, and graph theory. It contains 15 multiple choice and written response questions testing students' knowledge of concepts like truth tables, logical deduction, induction, counting, groups, lattices, and graphs. Students are asked to complete truth table proofs, solve recurrence relations, identify properties of mathematical structures, and prove statements about graphs. The exam aims to evaluate students' understanding of core discrete mathematics concepts.

Uploaded by

Sneghaa P
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Reg. No.

Question Paper Code : 83450

B.E./B.Tech. DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2021.

Second Semester

Computer Science and Engineering

MA 035 – DISCRETE MATHEMATICS

(Regulations 2001)

Time : Three hours Maximum : 100 marks


Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Make a truth table for the statement ( p ∧ q ) ∨ (~ p ) .

2. Express the biconditional p ↔ q in any form using only disjuction ( ∨ ),

conjunction ( ∧ ) and negation (~).

3. State the principle of mathematical induction.

4. ( )
3
Find the coefficient of x 10 in 1 + x 5 + x 10 + ∧ .

5. Show that the identity element of a group (G ,* ) is unique.

6. What is meant by ring with unity?

7. Draw the Hasse diagram of the set of all positive divisors of 36.

8. Show that absorption laws are valid in a Boolean algebra.

9. Find the number of connected simple graph with four vertices.

10. Define a Hamiltonian path of G.


PART B — (5 × 16 = 80 marks)

11. (a) (i) Show that the expression

(P ∧ Q ) ∨ (¬P ∧ Q ) ∨ (P ∧ ¬Q ) ∨ (¬P ∧ ¬Q ) is a tautology by using


truth tables. (8)

(ii) Show that (∃X )M (x ) follows logically from the premises


(x )(H (x ) → M (x )) and (∃x )H (x ) . (8)

Or

(b) (i) Obtain the product of sums canonical form for

(P ∧ Q ∧ R ) ∨ (¬P ∧ Q ∧ R ) ∨ (¬P ∧ ¬Q ∧ ¬R ) . (8)

(ii) Show that J ∧ S logically follows from the premises


P → Q , Q → ¬R, R, P ∨ (J ∧ S ) . (8)

n
n(n + 1)(2n + 1)
12. (a) (i) Prove by induction for n ≥ 1 k
k =1
2
=
6
. (6)

(ii) Solve the recurrence relation (10)

F (n ) − F (n − 1) − F (n − 2) = 0, F (0 ) = 1, F (1) = 1 .

Or

(b) (i) In a survey of 100 students, it was found that 40 studied


Mathematics, 64 studied Physics 35 studied Chemistry, 1 studied
all the three subjects 25 studied Mathematics and Physics, 3
studied Mathematics and Chemistry and 20 studied Physics and
Chemistry. Find the number of students who studied Chemistry
only. (6)

(ii) Using the generating function method solve the difference equation

yn + 2 − yn +1 − 6 yn = 0 given that y1 = 1, y0 = 2. (10)

13. (a) (i) If every element in a group is its own inverse, then show that G is
an abelian group. (4)

(ii) Show that the order of a subgroup of a finite group G divides the
order of the group G. (12)

Or

2 83450
(b) (i) Show that the set of all permutations of three distinct elements
with right composition of permutation is a permutation group. (10)

(ii) Show that the Kernel of a group homomorphism is a normal


subgroup of a group. (6)

14. (a) (i) In an arbitrary Lattice (L, ≤ ) , prove that

x ∨ ( y ∧ z ) ≤ (x ∨ y ) ∧ (x ∨ z ) . (8)

(ii) Let D70 = {1, 2, 5, 7, 10, 14, 35, 70} and define m ≤ n if m divides n.
Show that (D70 , ≤ ) is a Boolean algebra. (8)

Or

(b) (i) Let N be set of all natural numbers and define m ≤ n if n − m is a


non-negative integer. Show that (N , ≤ ) is a poset. (8)

(ii) If x,y are elements in a Boolean algebra, the prove that


x ≤ y  x ' ≥ y'. (8)

15. (a) (i) Define the degree of a vertex and prove that the number of vertices
of odd degree is always even. (2+6)

(ii) Define a simple graph and prove that the maximum number of
edges in a simple graph with n vertices and k components is
(n − k )(n − k + 1) / 2. (2+6)

Or
(b) Prove that a nonempty connected graph is Eulerian if and only if its
vertices are all of even degree. (16)

—————————

3 83450

You might also like