Scribd
Upload
108 views2 pages

Time: 3 Hours Total Marks: 100: Printed Page 1 of 2 Sub Code:CS302

The document is a past exam paper for a Discrete Structures course. It contains 7 sections with multiple choice and multi-part questions testing concepts like sets, Boolean algebra, logic, graphs, groups, and number theory. The paper tests fundamental concepts in discrete mathematics and ability to apply logical reasoning to solve problems.

Uploaded by

Saloni Jain
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
108 views2 pages

Time: 3 Hours Total Marks: 100: Printed Page 1 of 2 Sub Code:CS302

The document is a past exam paper for a Discrete Structures course. It contains 7 sections with multiple choice and multi-part questions testing concepts like sets, Boolean algebra, logic, graphs, groups, and number theory. The paper tests fundamental concepts in discrete mathematics and ability to apply logical reasoning to solve problems.

Uploaded by

Saloni Jain
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

Printed Page 1 of 2 Sub Code:CS302

Paper Id: 230151 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B. TECH.
(SEM-III) THEORY EXAMINATION 2019-20
DISCRETE STRUCTURES
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.
SECTION – A
1. You are required to answer all the parts of this question. 2×10=20
(a) Define power set.
(b) Find 𝐴 △ 𝐵 𝑖𝑓 𝐴 = {1,2,5}, 𝐵 = {3,4,5,8}
(c) What is order of an element in a Group?
(d) Define Ring.
(e) In an integral domain D, show that if xy = xz with x≠0 then y=z.
(f) In any Boolean algebra, show that (a + b). (a ′ + c) = a ′. b + ac + bc
(g) Define quantifiers.
(h) Draw truthtable of proposition𝑝 ∨ ∽ 𝑝.
(i) Explain conditional proposition.
(j) What is Hamiltonian cycle?
SECTION – B
2. Attempt any three parts of the following: 10×3=30
www.aktuonline.com

(a) What are ordered pair and Cartesian product? Prove that
𝐴 × (𝐵 ∩ 𝐶 ) = (𝐴 × 𝐵) ∩ (𝐴 × 𝐶)
(b) Explain Groupoid and Monoid with necessary conditions and example.
(c) How are sequential circuits different from combinational circuits? Draw the logic
circuit corresponding to Boolean expression Y = A + BC + B.
(d) Prove that the following propositions are tautology
i.∽ (𝑝 ∧ 𝑞 ) ∨ 𝑞
ii.𝑝 → (𝑝 ∨ 𝑞)
(e) Solve the following recurrence relation:
i.𝑎 + 𝑎 = 3𝑛2
ii.𝑎 = 2𝑎 + 3 , 𝑛 ≥ 1𝑎𝑛𝑑 𝑎 = 1 (by iterative method)
SECTION – C
3. Attempt any one part of the following: 10×1=10
(a) What is recursion? Explain any recursively defined function with suitable
example.
(b) What is closure of relation? Explain Symmetric and transitive closure in detail.

4. Attempt any one part of the following: 10×1=10


(a) Prove that inverse of each element in a group is unique.
(b) Let 𝐺 = (1, −1, 𝑖, −𝑖} with the binary multiplication be an algebraic structure,
where 𝑖 = −1,
(i) Determine whether G is an Abelian
(ii) If G is cyclic group, then determine the generator of G

http://www.aktuonline.com
Printed Page 2 of 2 Sub Code:CS302
Paper Id: 230151 Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

5. Attempt any one part of the following: 10×1=10


(a) Draw hasse diagram for divisibility relation on following set 𝐴 =
{3, 4, 12, 24, 48, 72}
(b) Simplify the following Boolean functions using three variable maps
F(x,y,z)=∑(0,1,5,7)
F(x,y,z)=∑(1,2,3,6,7)

6. Attempt any one part of the following: 10×1=10


(a) Prove by mathematical Induction
i. 6 +7 is divisible by 43 for every positive integer n.
ii. 𝑛! ≥ 2 for 𝑛 ≥ 1
(b) What is normal form? Find principal disjunctive normal form of
i. 𝑝→𝑞
ii. 𝑞 ∨ (𝑝 ∨∽ 𝑞)

7. Attempt any one part of the following: 10×1=10


(a) Determine the GF of a numeric function 𝑎 where
2 𝑖𝑓 𝑟 𝑖𝑠 𝑒𝑣𝑒𝑛
𝑎 =
−2 𝑖𝑓 𝑟 𝑖𝑠 𝑜𝑑𝑑
www.aktuonline.com

(b) Explain the following:


i. Directed Graph
ii. Weighted Graph
iii. Bipartite Graph
iv. Null Graph
v. Complete Graph

http://www.aktuonline.com

You might also like