Scribd
Upload
8K views3 pages

Discrete Mathematics Question Paper

This document contains a past exam for a Discrete Mathematics course. It includes 15 multiple choice and written response questions covering topics like: propositional logic, graph theory, number theory, groups, rings, and lattices. Students are asked to prove statements, find recurrence relations, draw graphs, and verify properties of mathematical structures.

Uploaded by

Rajkumar Raaz
Copyright
© Attribution Non-Commercial (BY-NC)
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
8K views3 pages

Discrete Mathematics Question Paper

This document contains a past exam for a Discrete Mathematics course. It includes 15 multiple choice and written response questions covering topics like: propositional logic, graph theory, number theory, groups, rings, and lattices. Students are asked to prove statements, find recurrence relations, draw graphs, and verify properties of mathematical structures.

Uploaded by

Rajkumar Raaz
Copyright
© Attribution Non-Commercial (BY-NC)
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

B.E./B.Tech.

DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010 Fifth Semester Computer Science and Engineering MA2265 DISCRETE MATHEMATICS (Regulation 2008) Time : Three hours Answer ALL questions PART A (10 x 2 = 20 Marks) 1. When do you say that two compound propositions are equivalent? 2. Prove that p, p q , q r r . 3. State Pigeonhole principle. 4. Find the recurrence relation satisfying the equation yn = A(3)n + B( 4)n . 5. Define strongly connected graph. 6. State the necessary and sufficient conditions for the existence of an Eulerian path in a connected graph. 7. State any two properties of a group. 8. Define a commutative ring. 9. Define Boolean algebra. 10. Define sub-lattice. Maximum : 100 Marks

PART B (5 x 16 = 80 Marks) 11. (a) (i) Prove that the premises a (b c ), d (b c ) and (a d ) are inconsistent. (ii) Obtain the principal disjunctive normal form and principal conjunction form of the statement

p p ( q ( q r ) ) .
Or (b) (i) Prove that x ( P ( x ) Q ( x ) ) , x ( R( x ) Q ( x ) ) x ( R( x ) P ( x ) ) . (ii) Without using the truth table, prove that p ( q r ) q ( p r ) . 12. (a) (i) Prove, by mathematical induction, that for all n 1, n 3 + 2n is a multiple of 3. (ii) Using the generating function, solve the difference equation

yn + 2 yn+1 6 yn = 0, y1 = 1, y0 = 2 .
Or (b) (i) How many positive integers n can be formed using the digits 3,4,4,5,5,6,7 if n has to exceed 5000000? (ii) Find the number of integers between 1 and 250 both inclusive that are divisible by any of the integers 2,3,5,7. 13. (a) (i) Draw the complete graph K 5 with vertices A, B , C , D, E . Draw all complete sub graph of

K 5 with 4 vertices.
(ii) If all the vertices of an undirected graph are each of degree k , show that the number of edges of the graph is a multiple of k . Or (b) (i) Draw the graph with 5 vertices, A, B , C , D , E such that deg( A) = 3 , B is an odd vertex,

deg(C ) = 2 and D and E are adjacent.

(ii) The adjacency matrices of two pairs of graph as given below. Examine the isomorphism of G

0 0 1 0 1 1 0 0 1 , A = 1 0 0 . and H by finding a permutation matrix. AG = H 1 1 0 1 0 0


14. (a) (i) If ( G ,* ) is an abelian group, show that ( a * b ) = a 2 * b 2 .
2

(ii) Show that ( Z , + , ) is an integral domain where Z is the set of all integers. Or (b) (i) State and prove Lagranges theorem. (ii) If ( Z , + ) and ( E , + ) where Z is the set all integers and E is the set all even integers, show that the two semi groups ( Z , + ) and ( E , + ) are isomorphic. 15. (a) (i) Show that ( N , ) is a partially ordered set where N is set of all positive integers and is defined by m n iff n m is a non-negative integer. (ii) In a Boolean algebra, prove that ( a b ) = a b . Or (b) (i) In a Lattice ( L, ) , prove that x ( y z ) ( x y ) ( x z ) . (ii) If S42 is the set all divisors of 42 and D is the relation divisor of on S42 , prove that

{ S42 , D} is a complemented Lattice.

You might also like