Semester : SEMESTER 3
Subject : DISCRETE MATHEMATICAL STRUCTURES
Year : 2020
Term : DECEMBER
Branch : ARTIFICIAL INTELLIGENCE
Scheme : 2019 Full Time
Course Code : MAT 203
Page:1
Reg No.:
Max. Marks: 100
ഹ ०० പപ இ
0800MAT203122001 Pages: 3
Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Third Semester B.Tech Degree Examination December 2020 (2019 Scheme)
Course Code: MAT203
Course Name: Discrete Mathematical Structures
PARTA
Answer all questions. Each question carries 3 marks
Without using truth tables, show that
p>(q7>7r)=p>(~qvr)=(pAq)>r
Define the terms: Converse, Inverse and Contrapositive.
What is Pigeonhole Principle? Given a group of 100 people, at minimum,
how many people were born in the same month?
In how many ways can the letters of the word ‘MATHEMATICS’ be
arranged such that vowels must always come together?
If A = {1,2,3,4}, give an example of a relation on A which is reflexive and
transitive, but not symmetric.
Define a complete lattice. Give an example.
Define a recurrence relation. Give an example.
Determine the coefficient of 1 in f(x) = (x? + 3 + كير ...)4
Define semi-group. Give an example.
Show that the set of idempotent elements of any commutative monoid forms
a submonoid.
PART تا
Answer any one full question from each module. Each question carries 14 marks
Module 1
11(a) Check whether the propositions p A (~ و Vr) and م ۷ (व ہ۸ 7) are logically
equivalent or not.
(b) Check the validity of the statement
220
(ras) جه و
~rV(~tvu)
Page 1 of 3
Duration: 3 Hours
Marks
(3)
(3)
(3)
(3)
(3)
(3)
(3)
(3)
(3)
(3)
(6)
(8)