Scribd
Upload
177 views1 page

13A05302 Discrete Mathematics PDF

This document contains exam questions on the topic of discrete mathematics. It includes questions about: 1) Proving logical statements without using truth tables 2) Defining Boolean algebra and lattice structures 3) Proving properties of subgroups, groups, and recurrence relations 4) Applying the pigeonhole principle and generating functions to solve problems 5) Proving properties of graphs, trees, and Eulerian paths The exam is divided into two parts - the first part contains 10 short answer questions and the second part contains 5 longer proof-based questions testing knowledge of specific discrete mathematics topics.

Uploaded by

ManojKarthik
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
177 views1 page

13A05302 Discrete Mathematics PDF

This document contains exam questions on the topic of discrete mathematics. It includes questions about: 1) Proving logical statements without using truth tables 2) Defining Boolean algebra and lattice structures 3) Proving properties of subgroups, groups, and recurrence relations 4) Applying the pigeonhole principle and generating functions to solve problems 5) Proving properties of graphs, trees, and Eulerian paths The exam is divided into two parts - the first part contains 10 short answer questions and the second part contains 5 longer proof-based questions testing knowledge of specific discrete mathematics topics.

Uploaded by

ManojKarthik
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/ 1

Code: 13A05302 R13

B.Tech II Year I Semester (R13) Regular Examinations December 2014


DISCRETE MATHEMATICS
(Common to IT and CSE)
Time: 3 hours Max. Marks: 70
PART – A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) Without using truth table show that P → (Q → P ) ⇒ ¬P → ( P → Q )
(b) State Boolean algebra.
(c) When a lattice is said to be bounded?
(d) Prove that p, p → q, q → r ⇒ r.
(e) State necessary and sufficient conditions for the existence of an Eulerian path is connected.
(f) Prove that the identity of a subgroup is same as that of the group.
(g) What is a group?
(h) Find the recurrence relation satisfying the equation y=
n A(3) n + B(−4) n
(i) What is the generating function of the sequence {0, 1, 0-1, 0, 1, 0, -1, 0…….}?
(j) What is a tree?
PART – B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT - I
2 Use pigeonhole principal to show that in any set of eleven integers, there are two integers whose difference
in divisible by 10.
OR
3 Write an equivalent formula ¬ ( p ↔ ( q → ( r ∨ p ))) which does not contains any conditional ( → ) and bi
conditional ( ↔ )
UNIT - II
4 In a Lattice (L, ≤) ,prove that x ∨ ( y ∧ z ) ≤ ( x ∨ y ) ∧ ( x ∨ z )
OR
5 If ( A, ≤) and ( B, ≤) are posets, then prove that { AxB, ≤) } is a poset with partial order ≤ defined as (a,
b) ≤ (a b), if a ≤ a in A , if b ≤ b in B.
UNIT - III
6 State and prove Lagrange’s theorem.
OR
7 Let ( S ,∗) be a semi group, then prove that there exists a homomorphism g : S → S S where <SS, o> is a
semi group of a function from S to S under the operation of the Composition.
UNIT - IV
n
n(n + 1)(2n + 1)
8 (i) Use Mathematical induction show that ∑k
k =1
2
=
6
(ii) Using the generating function, solve the difference equation:
y n + 2 − y n +1 − 6 y n = 0, y1 = 1, y 0 = 2
OR
9 Solve the recurrence relation, S(n) = S(n-1)+2(n-1) with S(0) = 3, S(1) = 1 by finding its generating function.
UNIT - V
10 Prove that a simple graph has a spanning tree, iff it is connected.
OR
11 Define Eulerian graph. Show that a non empty connected graph is Eulerian if and only if all its vertices are of
even degree.
*****

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