Scribd
Upload
17 views2 pages

DM Model

The document is an examination paper for the Discrete Mathematics course at Apollo Engineering College for the academic year 2024-2025. It includes two parts: Part A consists of 10 short questions worth 2 marks each, while Part B contains 5 long questions worth 16 marks each. The exam covers various topics such as truth tables, mathematical induction, graph theory, and group theory.

Uploaded by

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

DM Model

The document is an examination paper for the Discrete Mathematics course at Apollo Engineering College for the academic year 2024-2025. It includes two parts: Part A consists of 10 short questions worth 2 marks each, while Part B contains 5 long questions worth 16 marks each. The exam covers various topics such as truth tables, mathematical induction, graph theory, and group theory.

Uploaded by

Robert Harris
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

APOLLO ENGINEERING

COLLEGE

CHENNAI -602105
ACADEMIC YEAR 2024- 2025 (ODD SEMESTER)
DEPARTMENT OF SCIENCE AND HUMANITIES
MODEL EXAM
Subject code: MA3354 Date: 13/12/2024
Subject Title: Discrete Mathematics Time: 12.00-03.00pm
Max. Marks: 100
Branch / Year: CSE/CYBER/AIDS/CSBS/ II
PART-A (10 X 2 = 20)

1. Construct the truth table of (p˄~q) → (p˄q)


2. Give an indirect proof of the theore “ If 3n+2 is odd, then n is odd”.
3. How many permutations are there in the word MISSISSIPPI?
4. State the Pigeonhole principle.
5. State the handshaking theorem.
6. Prove that the number of odd degree vertices is always even.
7. Give an example of sub semigroup.
8. State any two properties of a group.
9. Define sub lattice.
10. Define lattice homomorphism.
PART-B (5 X 16 = 80)
11 (a)(i) Prove that ((p v q) ˄ ~ (~ p ˄(~ q v ~ r))) v (~p ˄ ~q) v (~p ˄ ~r) is a tautology.
(ii) Without using the truth table find PCNF and PDNF of [P→(Q v R), Q→ ~P, S →
~R and P.
OR

(b) (i) Prove that √2 is irrotational by giving a proof by contradication.


(ii) Show that the premises “One student in this class knows how to write program in
JAVA”, and “Everyone who knows how to write the programme in JAVA can get a high
paying job imply a conclusion “someone in this class can get a high paying job”.

12 (a)(i) Use mathematical induction to show that 𝑛2 − 1 is divisible by 8 whenever n is an odd


positive integer.
(ii) State the strong induction (the second principle of mathematical induction). Prove that a
positive integer >1 is either a prime number or it can be written as product of prime numbers.
OR
(b) (i) Solve the recurrence relation 𝑎𝑛 = 3𝑎𝑛−1 + 2, 𝑛 ≥ 1, 𝑤𝑖𝑡ℎ 𝑎0 = 1 by the method
of generating function.
(ii) Find the generating function of Fibonacci sequence.
13 (a)(i) Prove that the number of vertices of odd degree in a graph is always even.
(ii) Prove that the maximum number of edges in a simple disconnected graph G with n
vertices and k components is (𝑛 − 𝑘)(𝑛 − 𝑘 − 1)⁄2
OR
(b) (i) Prove that a connected graph 𝐺 is Euler graph if and only if every vertex of 𝐺is of
even degree.
(ii) If a graph G has exactly two vertices of odd degree there is a path joining these two
vertices.

14 (a)(i) State and prove Cayley’s theorem.


(ii) State and prove Lagrange’s theorem
OR
(b) (i) Prove that every subgroup of a cyclic group is cyclic.
(ii) If (𝐺,∗) is an abelian group and if ∀ 𝑎, 𝑏 ∈ 𝐺. Show that (𝑎 ∗ 𝑏)𝑛 = 𝑎𝑛 ∗ 𝑏 𝑛, 𝑓𝑜𝑟
𝑒𝑣𝑒𝑟𝑦 𝑖𝑛𝑡𝑒𝑔𝑒𝑟 𝑛
.
15 (a) (i) Show that a complemented, distributive lattice is a Boolean Algebra.
(ii) Show that every totally ordered set is a lattice.

OR
〈𝐿, ≤〉 be a Lattice. For any 𝑎, 𝑏, 𝑐 ∈ 𝐿 the following inequalities known as
(b) (i) Let
distributive inequality hold.
(i) 𝑎⨁(𝑏 ∗ 𝑐) ≤ (𝑎⨁𝑏) ∗ (𝑎⨁𝑐)
(ii) 𝑎 ∗ (𝑏⨁𝑐) ≤ (𝑎 ∗ 𝑏)⨁(𝑎 ∗ 𝑐)
(ii) Prove the absorption law 𝑥(𝑥 + 𝑦) = 𝑥 using the the identities of Boolean algebra.

PREPARED BY VERIFIED BY APPROVED BY

You might also like