Scribd
Upload
13 views3 pages

mmm

Ktu previous S3 Maths

Uploaded by

maheenmonu04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
13 views3 pages

mmm

Ktu previous S3 Maths

Uploaded by

maheenmonu04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
A 0800MAT203122001 Pages: 3 Reg No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY Third Semester B.Tech Degree Examination December 2020 (2019 Scheme) Course Code: MAT203 Course Name: Discrete Mathematical Structures Max. Marks: 100 Duration: 3 Hours PART A Answer all questions. Each question carries 3 marks Marks 1 Without using truth tables, show that @) p> @>nNSp> avr s@PAqg)>r 2 Define the terms: Converse, Inverse and Contrapositive. @) 3 What is Pigeonhole Principle? Given a group of 100 people, at minimum, — (3) how many people were born in the same month? 4 In how many ways can the letters of the word ‘MATHEMATICS’ be (3) arranged such that vowels must always come together? 5 IfA = {1,2,3,4}, give an example of a relation on A which is reflexive and (3) transitive, but not symmetric, 6 Define a complete lattice. Give an example. 3) 7 Define a recurrence relation. Give an example. ey 8 Determine the coefficient of x" in f(x) = (x? + x3 +x + .. (3) 9 Define semi-group. Give an example. 3) 10 Show that the set of idempotent elements of any commutative monoid forms (3) a submonoid. PARTB Answer any one full question from each module. Each question carries 14 marks Module 1 11(a) Check whether the propositions p A (~ q Vr) and pV (q A~ r) are logically (6) equivalent or not. (b) Check the validity of the statement (8) pra q>(ras) ~rv(~tvu) Page 1 of 3 DOWNLOADED FROM KTUNOT: 12(a) (b) 13(a) (by 14(a) (b) 15(@) (b) 16(a) (b) 17a) (b) 0800MAT203122001 pat eu Show that ((p > q) A (q 1) > (p +r) is a tautology. Let p,q, be the statements given as p: Arjun studies. q: He plays cricket. r: He passes Data Structures. Let P1, Po, P3 denote the premises pu: If Arjun studies, then he will pass Data Structures. Po: If he doesn't play cricket, then he will study. ps: He failed Data Structures Determine whether the argument (p; A pz A ps) > q is valid. Module 2 State Binomial theorem, Find the coefficient of xyz? in (2x — y — 2)* Determine the number of positive integers n such that 1 0, ay = 0. Solve the recurrence relation an¢2 = @n¢1 + Gyn 2 0, ag = 0, a; Page 2 of 3 .OADED FROM KTUNOTES.IN (6) (8) (6) (8) (6) (8) (6) (8) © (8) (6) (8) 18(@) (b) 19a) (b) 20(a) (b) 0800MAT203122001 Solve the recurrence relation dy42 — 4dne1 + 3a, = —200,n > 0, dy = 3000, a, = 3300 Solve the recurrence relation dy, = 2dy—1 — 4dy—p , > 3,4; = 2,42 =0 Module 5 If f:(R*,°) > (R, +) as f(x) = numbers. Show that f is a monoid isomorphism from Rt onto R. Inx, where R* is the set of positive real Show that every subgroup of a cyclic group is cyclic, State and prove Lagrange’s Theorem. If A = {1,2,3}. List all permutations on A and prove that it is a group. Page 3 of 3 .OADED FROM KTUNOTES.IN (6) (8) (6) (8) (6) (8)

You might also like