Scribd
Upload
17 views4 pages

Discrete Mathematics

This document is an examination paper for the 3rd semester B.Tech students in various computer science and engineering disciplines, covering topics in Discrete Mathematics and Graph Theory. It consists of two parts: Part A with 15 questions requiring short answers and Part B with additional problems to solve. The exam is 3 hours long and has a maximum score of 100 marks.

Uploaded by

Subhankar Sahu
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
17 views4 pages

Discrete Mathematics

This document is an examination paper for the 3rd semester B.Tech students in various computer science and engineering disciplines, covering topics in Discrete Mathematics and Graph Theory. It consists of two parts: Part A with 15 questions requiring short answers and Part B with additional problems to solve. The exam is 3 hours long and has a maximum score of 100 marks.

Uploaded by

Subhankar Sahu
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/ 4

Registration no:

Total Number of Pages: 4 B.TECH


MTH21105/MA21112

3rd SEMESTER (REGULAR/BACK) EXAMINATION – 2021


CSE/CSIT/CSSE/CSSYE/CS/CC/DS/WT/CSFE/CE/AIML
DISCRETE MATHEMATICS/DISCRETE MATHEMATICS AND GRAPH THEORY
Time – 3 Hours
Max Marks: 100

Answer all Questions from Part – A and Part – B


The figures in the right hand margin indicate marks.
PART – A

Q1 Answer the following questions: [2 x 15]


(a) Draw the Hasse diagram for the partial ordering  A, B  | A  B on the
power set P(S), where S = {a,b,c}.
(b) Prove by principle of mathematical induction that

1 + 3 + 5 + ... + 2n – 1 = n2
(c) Which elements of the poset 2, 4,5,10,12, 20, 25, ,| are maximal and
minimal?
(d) What is the general solution of a linear homogeneous recurrence relation if
its characteristic equation has the roots 1, 2, 2, 5, 5, 7?

(e) A survey shows that 76% of the Indians like oranges, where as 62% like
bananas. What percentage of the Indians like both oranges and bananas?
(f) What is the generating functions of the sequences,
{a n}; a n = n + 1?
(g) Examine whether the graph G given below is bipartite.

(h) Prove that a simple graph is bipartite if an only if it is possible to assign one
of two different colors to each vertex of the graph so that no two adjacent
vertices are assigned the same colour.
1
(i) What is the chromatic number of a cyclic graph?
(j) Draw all the spanning trees of the following graph.

(k) Define a complete m– ary tree. Construct a complete binary tree of height 3.
(l) Evaluate the number of edges of a binary tree with 10 vertices.
(m) Prove that the identity element of a Sub Group is the same as that of the
group.
(n) Prove the following statement: The intersection of any two subgroup of a
group (G,*) is again a subgroup of (G,*).
(o) Define Hamming Distance. What is the distance between x and y if
x=11001110, y= 00010100.
PART - B
2. Answer any two: [7 x 2]
(a) Show that the following argument is valid. “If today is Tuesday, I have a
test in Mathematics or Economics. If my Economics Professor is sick I will
not have a test in Economics. Today is Tuesday and my Economics
Professor is sick. Therefore, I have a test in Mathematics.
(b) Show that pq and (pq)  (qp) are equivalent.
(c) Using Warshall’s algorithm, compute the adjacency matrix of the transitive
closure of the digraph given below:

3. Answer any two: [7 x 2]


(a) Solve the following recurrence relation.

an  6 an 1  9 an  2   n 2  1 3n
(b) In a class of 40 students, 13 have taken mathematics, 9 have taken
mathematics but not Biology. Find the number of students who have taken
mathematics and Biology and those who have taken Biology but not
Mathematics.

(c) Using generating function solve the recurrence relation −2 +


= 2 + , where one initial value is =3
4. Answer any two: [7 x 2]
(a) Determine whether the following graphs are isomorphic.

2
(b) State Dijkstra’s Algorithm. Using Dijkstra’s Algorithm find the shortest
path from the vertex a to the vertex z of the following weighted graph.

(c) Write down Fleury’s algorithm and using it find the Euler circuits of the
following graphs

5. Answer the followings: [7 x 2]


(a) Write the Breadth-First search (BFS) algorithm and use BFS algorithm to
find a spanning tree of the graph K5.
(b) Using Kruskal’s algorithm find a minimal spanning tree for the graph

3
6. Answer the followings: [7 x 2]
(a) Prove that two left cosets of a subgroup (H, *) of a group (G, *) are either
disjoint or identical.

(b) Show that the (3,7) encoding function e : B 3  B 7 defined by

e(000) 0000000

e(001) 0010110

e(010) 0101000

e(011) 0111110

e(100) 1000101

e(101) 1010011

e(110) 1101101

e(111) 1111011

Is a group code.

Course Outcome Assessment Scheme

COs Questions Total Mark

CO1 Q.1(a),(b),(c)+Q.2(a),(b),(c) 27

CO2 Q.1(d),(e),(f)+Q.3(a),(b),(c) 27

CO3 Q.1(g),(h),(i)+Q.4(a),(b),(c) 27

CO4 Q.1(j),(k),(l)+Q.5(a),(b) 20

CO5 Q.1(m),(n),(o)+Q.6 20

You might also like