Question Paper Code : 3469 M.A./M.Se. (CBCS) (Semester-I1]) Examination, 2021 MATHEMATICS [ Paper : MAEL-302 (A) ] ( Discrete Maths ) Time : Three Hours] [Maximum Marks : 70 Note : Answer any five questions. All questions carry equal marks. le Describe logical connectives. Write rules of inference theory. 2y (i) Prove validity of the following argument by deduction method : P, P>Q (~QvR ols (ii) Prove that the set {1} is minimal set of logical connectives. 3469/300 (GIs) (P.T.0.] Scanned with CamScannerSi (i) Discuss validity of the following argument : "All students of mathematics study Discrete mathematics. John is a student of mathematics Therefore, John does not study Discrete mathematics." (ii) Describe deduction method with the help of a suitable example. (i) Obtain principal disjunctive normal form of the 4. a following Boolean expression. : xy'ztyt+x yt+ztyt gi ens (ii) Minimize the following Boolean expression using oe Karnaugh map : xyz+ xyzt + x'yz't + x'y'z't + xy'zt' + x'yzt + xyz't’ 5. /Discuss lattice. Prove that lattices x and are isomorphic. Scanned with CamScanner6. Design a minimized logic circuit for implementing two bit word comparator, JS (i) Obtain DFA for the following NFA. € € fa € 1 L (ii) Construct a Moore machine for computing residue mod 4, input being a binary string. 8. Obtain a minimum state DFA for r=(a/b)*011/011: 9. Differentiate between context free language and context sensitive language. Discuss procedure to obtain LR (1) parsing table. 197 Design an LR(0) parsing table for the following CFG: A->BA|a B— xB| x| y meceeeXnnnee Scanned with CamScanner