Scribd
Upload
17 views2 pages

Discrete Mathematics 20CSC09

This document is an examination paper for Discrete Mathematics from Chaitanya Bharathi Institute of Technology for B.E. III Semester students. It consists of two parts: Part A with five questions worth 15 marks and Part B with five questions worth 45 marks, covering topics such as logic, set theory, graph theory, and algebraic structures. Students are required to answer all questions in the same order and internal choices are provided.

Uploaded by

sowmyadell680
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 views2 pages

Discrete Mathematics 20CSC09

This document is an examination paper for Discrete Mathematics from Chaitanya Bharathi Institute of Technology for B.E. III Semester students. It consists of two parts: Part A with five questions worth 15 marks and Part B with five questions worth 45 marks, covering topics such as logic, set theory, graph theory, and algebraic structures. Students are required to answer all questions in the same order and internal choices are provided.

Uploaded by

sowmyadell680
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/ 2

Code No.

: 20CSC09

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)


B.E. III Sem (Main) Examination February/March 2022
Discrete Mathematics
(Common to CSE, CSE - AI&ML, CSE - IoT&CS Including BCT)
Time: 3 Hours Max Marks: 60
Note: Answer ALL questions from Part-A & Part –B (Internal Choice) at one place in the
same order
Part - A
(5Q X 3M = 15 Marks)
M CO BT
1 Write the Converse, Inverse and Contra positive of the following statement (3) 1 3
along with their symbolic representation.
“If the sun is shining then I shall play tennis this afternoon”.
2 Define lattice and mention its properties. (3) 2 1
3 State product rule and explain with an example. (3) 3 2
4 Differentiate Euler’s circuit and Hamiltonian cycle with examples. (3) 4 4
5 Define algebraic structure. Give any two examples. (3) 5 1

Part – B
(5Q X 9M = 45 Marks)
M CO BT
6 (a) Construct truth table for the following compound statement: (5) 1 3
[(P→Q)Λ(Q→R)] →(P→R)
(b) Show that ┐(P→Q) → ┐Q is a tautology. (4) 1 2
(OR)
7 (a) Show that SVR follows logically from the premises CVD, (5) 1 3
(CVD)→~H, ~H→(A ~B) and (A ~B)→(RVS)
(b) Explain about quantifiers and use of quantifiers with suitable (4) 1 2
examples.

8 (a) Determine the sets A, B where A-B = {1,3,7,11}, B-A = {2,6,8} and (5) 2 2
A∩B = {4,9} and also express A-B in terms of Ս and
–(complementary).
(b) Define inverse function. Find inverse function of given function (4) 2 2
f(x)=3x+2/ 4x-1.
(OR)
9 (a) Let A be a given finite set and (A) its power set. Let  be the (5) 2 3
inclusion relation on the elements of (A). Draw Hasse diagram of
< (A),  > for A={a, b, c}.
(b) Explain the properties of binary relations. If A={1,2,3,4} give an (4) 2 1
example of relation R on A that is a reflexive and symmetric but not
transitive.

Page 1 of 2
Code No.: 20CSC09

10 (a) In how many ways can 8 men and 8 women be seated in a row if (5) 3d 3
i) any person may sit next to each other
ii) Men and women must occupy alternate seats.
(b) State binomial theorem. Expand (4x+5y)8 using binomial theorem. (4) 3 2
(OR)
11 (a) Solve the recurrence relation, an-6an-1+9an-2 =0, n>=2, a0=5, a1=12. (5) 3 3
(b) Solve the recurrence relation using generating function, an=n.an-1 where (4) 3 3
n>=1 and a0=1.

12 (a) Explain about graph isomorphism with suitable examples. (5) 4 2


(b) Define planar graph. Prove that K5 graph is non planar graph. (4) 4 1
(OR)
13 (a) Define graph colouring and chromatic number. Find chromatic number (5) 4 3
of C5, W5, Kn and Peterson graph.
(b) Explain about Kruskal’s algorithm to find the minimal cost spanning (4) 4 2
tree with an example.

14 (a) Discuss about the general properties of an algebraic system. A binary (5) 5 1
composition *in R is defined by a*b = a.b2 for all a, b ∈ R. Determine
whether * is associative or not.
(b) Define homomorphism, show that the function f from (N,+) to (N,*), (4) 5 4
where N is a set of all natural numbers defined by f(x)=2x for all x ∈ N.
(OR)
15 (a) Define semigroups and monoids consider the algebraic system (Z,*) (5) 5 2
where * is defined by a*b=a+b-ab, state whether (Z,*) is a group or
monoid justify your answer.
(b) What is a cyclic group? Given group G = {1, -1, i, -i} under usual (4) 5 4
multiplication is cyclic group? Justify your answer.

******

Page 2 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy