×
Yes, you can do it.

# Previous Year Exam Questions for Discrete Mathematics - DMS of 2019 - BPUT by Bput Toppers

• Discrete Mathematics - DMS
• 2019
• PYQ
• Biju Patnaik University of Technology Rourkela Odisha - BPUT
• Computer Science Engineering
• B.Tech
• 21 Views
Page-1

#### Previous Year Exam Questions for Discrete Mathematics - DMS of 2019 - BPUT by Bput Toppers / 2

0 User(s)

#### Text from page-1

Registration No : Total Number of Pages : 02 B.Tech BSCM1211 4th Semester Back Examination 2018-19 DISCRETE MATHEMATICS BRANCH : CSE, IT, ITE Time : 3 Hours Max Marks : 70 Q.CODE : F1006 Answer Question No.1 which is compulsory and any FIVE from the rest. The figures in the right hand margin indicate marks. Q1 a) b) c) d) e) f) g) h) i) j) Q2 a) b) Answer the following questions : Write contrapositive of the statement: “G is tree if G is connenected and G does not contain any cycles”. Write the following statement in symbolic form using quantifiers: “All the world respects some selfless leaders.” Let = {1,2,3,4} and = {( , )| + > 4} be a relation on A. Find partition of A corresponding to R. Can a complete graph be a regular graph? Justify. Draw , and , graphs. When is a graph called Hamiltonian graph? State a few properties of a tree. State the four basic properties of a lattice. When is a lattice sais to be (a) bounded (b) distributive? How will you find minimum distance between any two code words in group code? (2 x 10) Check whether the hypothesis “It is not sunny this afternoon and it is colder than yesterday. We will go swimming only if it is sunny. If we do not go swimming, then we will take a canoe trip. If we take a canoe trip, then we will be home by sunset.” lead to the conclusion: We will be home by the sunset. Without constructing truth table prove that the following is a tautology : (( ∨ ) ∧∼ (∼ ∧ (∼ ∨∼ ))) ∨ (∼ ∧∼ ) ∨ (∼ ∧∼ ) (5) (5) Q3 a) b) Using mathematical induction show that 11 − 4 is divisible by 7, for ≥ 1. Find the number of integers between 1 and 250 that are divisible by any of the integers 2, 3, 5 and 7. (5) (5) Q4 a) Let R be a relation defined on a set of ordered pairs of positive integers such that for all ( , ), ( , ) ∈ × , ( , ) ( , ) if and only if = . Detrmine (5) b) whether is an equivalence relation. Solve the following recurrence relation: −7 + 10 = 0 given that = 0, (5) =3

#### Text from page-2

Q5 a) b) Prove that a connected multigraph with at least two vertices has an Euler circuit if and only if each of its verices has even degree. Prove that a disconnected simple graph G with n vertices and k components can have at most Q6 a) b) Q7 Q8 a) b) c) ( )( ) (5) (5) edges. Prove that a Ring is commutative if and only if ( + ) = +2 + for , ∈ . Show that = {1, −1, , − } where = √− is an abelian group with respect to multiplication as a binary operation. (5) Give the step by step procedure of Prim’s algorithm. Find minimal spanning tree of the following connected graph by using Prim’s algorithm. (10) Write short answer on any TWO : Boolean Algebra Group Code Group isomorphism. (5) (5 x 2)