Scribd
Upload
190 views2 pages

Model Question Paper DMS

This document contains a model question paper for the Discrete Mathematics course Math-1041. It has 5 questions in Section A and 11 questions divided among 5 units in Section B. The questions cover various topics in discrete mathematics including propositional logic, normal forms, recurrence relations, equivalence relations, order relations, and group theory concepts like Lagrange's theorem. Students must answer all questions in Section A and 5 questions from Section B, choosing 1 from each unit.

Uploaded by

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

Model Question Paper DMS

This document contains a model question paper for the Discrete Mathematics course Math-1041. It has 5 questions in Section A and 11 questions divided among 5 units in Section B. The questions cover various topics in discrete mathematics including propositional logic, normal forms, recurrence relations, equivalence relations, order relations, and group theory concepts like Lagrange's theorem. Students must answer all questions in Section A and 5 questions from Section B, choosing 1 from each unit.

Uploaded by

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

Discrete Mathematics

(Model question paper)


(Math-1041)
Section-A
Answer All the Questions: ( 5 x 1 = 5)

1a) If p → (q ∨ r) is false then find the truth values of p, q, r.

b) Find the DNF of

c) Draw the Hasse diagram for the po-set (D, /) where D = { 1,2,3,6}
d) Determine the value of a2 from the recurrence relation an= 17an-1 + 30 n with a0=3.

e)What is the inverse of a, if (Z,*) is a group with a*b = a+b+1, ∀ a, b in Z


Section-B
Answer the following: ( 5x5 =25)

UNIT-I

2.Prove that PQP QP Q).


(OR)

3.Prove that for any propositions P,Q,R the compound proposition


[(P →Q )∧(Q→R )]→( P→ R ) is a tautology.
UNIT-II
4.Obtain principal disjunctive and conjunctive normal forms of (Q→P) ∧ (7P∧Q).
(OR)

5.Show that R ∧ (P ∨ Q) is a valid conclusion from the premises P ∨ Q, Q → R, P → M, and (~)M.

UNIT-III

6. If A = {1,2,3,4} R = {(1,1)(1,3)(2,2)(2,4)(3,1)(3,3)(4,2)(4,4)} then show that R is an equivalence


relation.

(OR)

7.Show that whether the relation x , y ∈ R , if x ≥ y defined on the set of all positive integers is a

partial order relation

UNIT-IV

2
8.Solve the recurrence relation to an-10an-1 +25an-2 = 2 with a0 = and a1 = 3
3
(OR)
9. Solve the recurrence relation an-7an-1 + 10an-2 = 7n with a0 =1,a1 = -1, for n2

UNIT-V

−1 −1 −1
10. Show that in a group G for all a, b G (ab) =b a

(OR)

11.State and prove the Lagrange’s Theorem for finite groups

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy