Code No: RR210501 Set No.

1
II B.Tech I Semester Supplimentary Examinations, November 2007
DISCRETE STRUCTURES AND GRAPH THEORY
( Common to Computer Science & Engineering, Information Technology,
Computer Science & Systems Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. With reference to automatic theorem proving, show that SVR is tautologically

implied by (P∨Q) ∧ (P → R)∧(Q→S) [16]

2. (a) Show that the relation of congruence modulo m has m distinct equivalence
classes [8+8]
(b) Let C be a collection of sets which are closed under intersection and union.
Verify whether ( C, ∩, ∪ ) is a lattice.

3. (a) If f : X→Y and g : Y→X the function g is equal to f−1 only if g • f = Ix and
f •g = Iy .Prove the result . [8+8]
(b) Let f : R → R and g : R → R where R is the set of real numbers. Find f •
g and g • f where f(x) = x2 - 2, g(x) = x + 4. State whether these functions
are injective, subjective or objective.

4. (a) Define bigraph and their properties. [4+4+8]

(b) Find the diameter of Bipartite graph Km,n
(c) A graph is Bipartite prove that all the cycles of the graph are even cycles.

5. (a) State and explain the Four - Colour problem for planar graphs. [6+10]
(b) Prove that the regions of a plane graph can be 4 - coloured if G has a Hamil-
tonian cycle.

6. (a) Show how to represent a linked list as an almost complete binary tree in which
each list element is represented by one tree node. [8+8]
(b) Describe the concept of trees and also explain how they are represented? Also
list their uses in problem solving.

7. A shop sells 20 different flavors of ice cream. In how many ways can a customer
choose 4 ice cream cones ( one dip of ice cream per cone ) ?

(a) if they are all of different flavors ? [4]

(b) are not necessarily of different flavors ? [4]
(c) contain only 2 (or ) 3 flavors ? [4]
(d) contain 3 different flavors ? [4]

1 of 2
Code No: RR210501 Set No. 1
8. Solve the recurrence relation an -7an−1+ 26an−2 − 24an−3 =0 for n≥ 2. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR210501 Set No. 2
II B.Tech I Semester Supplimentary Examinations, November 2007
DISCRETE STRUCTURES AND GRAPH THEORY
( Common to Computer Science & Engineering, Information Technology,
Computer Science & Systems Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Write the following statement in symbolic form:

“The crop will be destroyed if there is a flood”
(b) Construct the truth table of the following formula.
⌉ (PV(Q ∧ R)) →← ((PVQ) ∧ (PVR)) [8+8]
2. (a) Show that when a relation R is symmetric, so is any Rk for any k > 0, where
Rk is the kth power of the relation R. [8+8]
(b) Let R be a relation on the set N of positive integers defined by the equation
x2 + 2y = 100, find the domain of R, range of R and R −1 .
3. (a) Let L a finite distributive lattice. Then prove that every element in L can be
written uniquely (except for order) as the join of irredundant join-irreducible
elements. [8+8]
(b) Prove the independent laws for the elements of a lattice.
4. (a) Prove that any two simple connected graphs with n vertices and all of degree
two are isomorphic [8+8]
(b) Suppose G1 and G2 are isomorphic prove that if G1 is connected then G2 is
also connected.
5. (a) Prove that the Kuratowskis second graph consisting of 6 vertices and 9 edges
is non-planar.
(b) State criteria to detect the planarity of a connected graph and give an example
also. [8+8]
6. (a) Describe the applications and efficiency level of breadth-first traversal.
(b) What is a minimum spanning tree? What are the different ways of creating
minimum spanning trees. [8+8]
7. (a) How many integral solutions are there to x1 + x2 + x3 + x4 + x5 = 20 where
each xi ≥ 2 ? [8]
(b) Find the number of district triples (x1 , x2 , x3 ) of nonnegative integers satisfying
the inequality x1 + x2 + x3 < 6. [8]
8. Solve the recurrence relation an -9an−1+ 26an−2 − 24an−3 =0 for n≥ 3. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR210501 Set No. 3
II B.Tech I Semester Supplimentary Examinations, November 2007
DISCRETE STRUCTURES AND GRAPH THEORY
( Common to Computer Science & Engineering, Information Technology,
Computer Science & Systems Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. With reference to automatic theorem proving, show that SVR is tautologically

implied by (P∨Q) ∧ (P → R)∧(Q→S) [16]

2. (a) What are the properties of the relation r = ( i, j ) / |i - j| = 2 on the set

A = { 1, 2, 3, 4, 5, 6 }. [8+8]
(b) Determine all the bijections from { 1, 2, 3 } on to {a, b, c, d}.

3. (a) If f : X→Y and g : Y→Z and both f and g are onto; show that g • f is also
onto. Is g • f is one to one if both g and f are one to one? Justify. [8+8]
(b) Let D(x) denote the number of divisions of x. Show that D(x) is primitive
recursive.

4. Prove that any 2 simple connected graphs with n vertices, all of degree 2, are
isomorphic. [16]

5. (a) Prove that the Kuratowskis second graph consisting of 6 vertices and 9 edges
is non-planar.
(b) State criteria to detect the planarity of a connected graph and give an example
also. [8+8]

6. (a) Write the Algorithm for traversing a tree in preorder. Give an example. [8+8]
(b) What are the application areas where preorder traversal can be implemented.
Give at least four examples.

7. (a) Explain about Enumerating permutations with constrained repetitions. [8+8]

(b) Compute the number of 10-digit numbers which contain only the digits 1,2
and 3 with the digit 2 appearing in each number exactly twice.

8. Solve the recurrence relation an -7an−1+ 26an−2 − 24an−3 =0 for n≥ 2. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR210501 Set No. 4
II B.Tech I Semester Supplimentary Examinations, November 2007
DISCRETE STRUCTURES AND GRAPH THEORY
( Common to Computer Science & Engineering, Information Technology,
Computer Science & Systems Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. With reference to automatic theorem proving, show that SVR is tautologically

implied by (P∨Q) ∧ (P → R)∧(Q→S) [16]

2. (a) Prove that the relation “congruence modulo m “ given by

≡ = {< x, y > /x − y is divisible by m} over the set of positive integers is
an equivalence relation. [8+8]
(b) Let A be given finite set and ρ(A) its power set. Let ⊆ be the inclusion relation
on the elements of ρ(A). Draw Hasse diagram of < ρ(A) ⊆ > for
i. A = {a}
ii. A = {a, b}
iii. A = {a, b, c, d}

3. (a) Define the term ‘lattice’, clearly stating the axioms. [6]
(b) Let C be a collection of sets which are closed under intersection and union.
Verify whether ( C, ∩, ∪ ) is a lattice. [10]

4. A graph is said to be self-complementary, if it is isomorphic to its complement.

(a) Draw a self - complementary graph with 4 vertices.

(b) Is there a self-complementary graph with 6 vertices. [8+8]

5. Km,n represents a complete bi partite graph. [5+5+6]

(a) Is there a Hamiltonian circuit in K4,6 ?

(b) Is there a Hamiltonian path in K4,5 ?
(c) State a necessary and sufficient condition for the existence of Hamiltonian
circuit in Km,n .

6. Prove whether it is always, never, or some times the nodes are added to the min-
imum spanning tree by the Dijkstra-Prim algorithm is the same as the order in
which they are encountered in a breadth-first traversal. [16]

7. (a) Compute the number of rows of 6 Americans, 7 Mexicans, and 10 Canadians

in which an American invariably stands between a Mexican and a Canadian
and in which a Mexican and a Canadian never stand side by side.

1 of 2
Code No: RR210501 Set No. 4
(b) In how many ways can we choose 3 of the numbers from 1 to 100. So that
their sum is divisible by 3 ? [8+8]

8. Explain the Recurrence relation. What is its application in computer science ex-
plain with suitable examples. [16]

⋆⋆⋆⋆⋆

2 of 2