[go: up one dir, main page]
Scribd
Upload
18 views4 pages

Discrete Mathematics Sem2

This document is an examination paper for M.A/M.Sc. students in Mathematics, specifically focusing on Advanced Discrete Mathematics. It consists of three sections: Section A with very short answer questions, Section B with short answer questions, and Section C with long answer questions, covering topics such as Boolean algebra, graph theory, and lattice theory. The total marks for the exam are 50, and students are instructed to attempt all sections as per the provided guidelines.

Uploaded by

Ajay sharma
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
18 views4 pages

Discrete Mathematics Sem2

This document is an examination paper for M.A/M.Sc. students in Mathematics, specifically focusing on Advanced Discrete Mathematics. It consists of three sections: Section A with very short answer questions, Section B with short answer questions, and Section C with long answer questions, covering topics such as Boolean algebra, graph theory, and lattice theory. The total marks for the exam are 50, and students are instructed to attempt all sections as per the provided guidelines.

Uploaded by

Ajay sharma
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/ 4

D

(20524)
Printed Pages 4
Roll No.
M.A/M.Se.-I Senh,
12089
M.A/M.Se. Examination, May-2024
MATHEMATICS
(Advanced Diserete Mathematies)
(GH-2051)
Time : Three Hours] (Maximum Marks : 50
Note: Attempt allthe Sections as per instructions.
Section-A
(Very ShortAnswer Type Questions)
Note: Attempt all the five questions. Each
question
carries 2 marks. 2x5-10
1. Prove, without constructing truth table
~(pA)pvcpv )) =~pvq
2 Provethat every chain is a lattice.
3. Prove that a non-cmpty subset S of a Boolean
Algebra (B, t, . , ",0, 1) is asubalgebra ofB,ifand
only if S is closed with respect.to operations
+ and 1.

12089 [P.T.O.
(2)
4.
Prove that if Gis self
has 4k or 4k + 1vertices,
complementary then G
where k is an
integer.
5. Prove that a graph G is a tree iff it is minimally
connected.

Section-B
(Short Answer Type Questions)
Note: Attempt any two questions out of following three
questions. Each question carries 5marks.
2x5=10

6. Two lattices L and M are modular if and only if


LxMismodular.

7. Write the function

f- (xy'+ xz) +x in DN form


8. Prove that every connectedgraph with nvertices and
n-ledges is a tree.

12089
(3)

Section C

(Long Answer Type Questions)


Note: Atempt any three questions out of followingfive
questions. Each question carries 10 marks.
3x10-30
9. (a) Define the finite state Machine.
(b) Check the validityof the
argument

I’9
P’~r

10. Prove that the


following are equivalent in a Boolean
Algebra B.
(i) a+b=b
(ii) a.b=a
(ii) a' +b=1
(iv) a.b'=0

12089 PTO.
(4)

l1. (a) In a distributive lattice, if an element has


complement, then this complement is unique.
(b) A lattice is distributive if and only if the
equations aac=bAc and avc=bvc
imply a =b Va, b, c e L.

12. (a) A
graph Gis atree if and only if there is one
and only one path between any two vertices of
G.

(b) Prove that a tree with n vertices has (n 1)


edges.

13. (a) Definethe following withone example cach:


(i) Quantifiers
(ii) Arguments
(iii) Modular lattice
(iv) Adjacency Matrix
(v) Switching circuits and Planar graph.
(b) Draw a graphthathas both an Euler circuit and
a Hamiltonion circuit.
12089

You might also like