Anna University Previous Years Question Paper
Question Paper Code : 40784
B.E./B.Tech. DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2021.
Third Semester
Computer Science and Engineering
MA 8351 – DISCRETE MATHEMATICS
(Common to Artificial Intelligence and Data Science/Computer Science and Business
System/Information Technology)
(Regulations 2017)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1. When do you say that two compound propositions are equivalent?
2. Define Tautology with an example.
3. Does there exists a simple graph with the degree sequence { } 3 ? , 3, 3, 3, 2
4. State the Pigeonhole principle.
5. Define strongly connected graph.
6. Define complete graph.
7. Prove if a has inverse b and b has inverse c , then a = c .
8. Prove that identity element is unique in a group.
9. Define lattice homomorphism.
10. When is a lattice said to be a Boolean algebra?
Attachments:
PDF Link : Click here to download Anna University MA8351 Discrete Mathematics Nov Dec 2021 Question Paper
Scanned Copies:
0 comments:
Pen down your valuable important comments below