This document is a mid-semester exam for a Discrete Mathematical Structures course. It contains 3 questions with multiple parts each. Question 1 covers topics like well-formed formulas, substitution instances, and indexed sets. Question 2 involves converting logical statements between prefix, infix, conjunctive normal form and disjunctive normal form, and using Venn diagrams. Question 3 addresses relation matrices, algebraic concepts like epimorphisms and monomorphisms, and partial ordering relations illustrated with Hasse diagrams. Students are asked to define, explain, and solve problems relating to these discrete math topics.
This document is a mid-semester exam for a Discrete Mathematical Structures course. It contains 3 questions with multiple parts each. Question 1 covers topics like well-formed formulas, substitution instances, and indexed sets. Question 2 involves converting logical statements between prefix, infix, conjunctive normal form and disjunctive normal form, and using Venn diagrams. Question 3 addresses relation matrices, algebraic concepts like epimorphisms and monomorphisms, and partial ordering relations illustrated with Hasse diagrams. Students are asked to define, explain, and solve problems relating to these discrete math topics.
This document is a mid-semester exam for a Discrete Mathematical Structures course. It contains 3 questions with multiple parts each. Question 1 covers topics like well-formed formulas, substitution instances, and indexed sets. Question 2 involves converting logical statements between prefix, infix, conjunctive normal form and disjunctive normal form, and using Venn diagrams. Question 3 addresses relation matrices, algebraic concepts like epimorphisms and monomorphisms, and partial ordering relations illustrated with Hasse diagrams. Students are asked to define, explain, and solve problems relating to these discrete math topics.
This document is a mid-semester exam for a Discrete Mathematical Structures course. It contains 3 questions with multiple parts each. Question 1 covers topics like well-formed formulas, substitution instances, and indexed sets. Question 2 involves converting logical statements between prefix, infix, conjunctive normal form and disjunctive normal form, and using Venn diagrams. Question 3 addresses relation matrices, algebraic concepts like epimorphisms and monomorphisms, and partial ordering relations illustrated with Hasse diagrams. Students are asked to define, explain, and solve problems relating to these discrete math topics.
COLLEGE OF ENGINEERING (AUTONOMOUS), KOLHAPUR (AN AFFILIATED TO SHIVAJI UNIVERSITY,KOLHAPUR)
Second Year B.Tech. (Computer Science & Engineering)
MID SEMESTER EXAMINATION, SEPTEMBER 2018 DISCRETE MATHEMATICAL STRUCTURE (UCSE0302) PRN No. : Day and Date: Tuesday, 18 /09/2018 Time: 9:30 AM to 11:30 AM Max Marks- 50 Instructions: IMP: Verify that you have received question paper with correct course, code, branch etc. i) All questions are compulsory. ii) Figure to the right indicates full marks. iii) Assume suitable data wherever necessary.
Blooms Po Marks CO’s Level Level Q.1 Attempt any three 18 A Define with examples i) We1l formed formula ii) Substitution 6 CO1 L1 PO1 Instance iii) Tautological Implications B Define indexed set. Given S = {a1, a2…a8} , what subsets are 6 CO1 L1 PO1 represented by B19 and B29? How will you designate subsets {a6, a7} and {a3} C Explain the properties of binary relations in a set with examples 6 CO1 L2 PO1 D Solve to obtain the Prefix & infix form of following formulas 6 CO2 L3 PO2 respectively i) Q ( R P Q) ii) PQ QR PR Q.2 Attempt any two 16 A Solve to obtain PCNF and PDNF of 8 CO2 L3 PO2 𝑷 → (( 𝑷 → 𝑸) ∧ ⏋( ⏋𝑸 𝑽 ⏋𝑷)) B Explain Venn diagrams. Show the following with Venn diagram i) 8 CO2 L2 PO2 𝐴 ∩ 𝐵 = 𝐴 ∩ 𝐶 𝑏𝑢𝑡 𝐵 ≠ 𝐶 i) A B A C but B C C Explain Semigroups and Monoids with their properties and 8 CO1 L2 PO1 examples. Q.3 Attempt any two 16 A What is Relation matrix. Let X = {1, 2, 3, 4} and R = {<x, 8 CO1 L1 PO1 y>|x>y}. Draw the graph of relation R and give its matrix. B Define w. r. t. Algebra – i) Epimorphism ii) Monomorphism iii) 8 CO1 L1 PO1 Isomorphism iv) Endomorphism C Explain Partial ordering Relation with example. Illustrate with 8 CO1 L2 PO1 Hasse diagram , the following sets under partial ordering relation divides and indicate which are totally ordered i) {2, 6, 24} ii) {3, 5, 15}
