Scribd
Upload
19 views

Cs It 3005 Discrete Structure Jun 2020

Uploaded by

10300 PEDDI KISHOR
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
19 views

Cs It 3005 Discrete Structure Jun 2020

Uploaded by

10300 PEDDI KISHOR
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Total No. of Questions : 8] [Total No. of Printed Pages : 2 Roll No CS/IT-3005-CBGS B.E. II Semester Examination, June 2020 Choice Based Grading System (CBGS) Discrete Structure Time : Three Hours Maximum Marks : 70 Note: i) Attemptany five questions. ii) All questions carry equal marks. 1. a) If Uis a universal set and its two subsets A and B, then prove that (AUB)'=A'AB" b) Show that the set Q of rational numbers is countable. 2. a) Show that [(p Aq) = P]=>(42 ~ @) is acontradiction. b) Show thatthe language L={a":m= 21} is nota finite state 3. Define eulerian path and circuit of a graph with an example for each. State the necessary and sufficient conditions for existence of an Eulerian path in connected graph. 4. a) Prove: i) Ax(BAC)=(AxB)A(AxC) ii) Ax(BUC)=(AxB)U(AxC) b) Explain Pigeonhole principle with an example. CS/TT-3005-CBGS PTO https:/www.tgpvonline.com 1 5. a) Testthe validity of argument: if itrains, Ram will be sick itdid not rain b) Explain universal and existential qualifiers with example 6. Define the following with examples: i) Multigraph ii) Isomorphic graphs iii) Eulerian graph 7. a) Prove that the set G= {...-4m, —3m, 2m, —m, 0, m, 2m, 3m, 4m...} of multiples of integers by a fixed integer m is a group with respect to addition. b) Discuss ring and field with example. 8. Write short notes on : a) Hasse diagram b) Lattices ©) Binomial theorem d) Permutations sett CS/TT-3005-CBGS https:/www.tgpvonline.com

You might also like