Code No: RR210501 Set No.

1
II B.Tech I Semester Supplimentary Examinations, February 2008
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) Show that RVS follows logically from premises. [8+8]

C∨D, (C ∨ D) →⌉ H,⌉ H → (A ∧⌉ B) (A ∧⌉ B) → R ∨ S
(b) Show that R → S can be derived from the premises P→(Q→ S), ⌉ R∨P and
Q.

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) 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) 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) Write a detailed algorithm for depth-first traversal using an adjacency matrix
that just prints the node label as the visit operation. You should trace it using
the graphs. [8+8]
(b) Prove that each edge in a connected graph will be part of the depth-first
traversal tree or will be an edge pointing to a predecessor in the tree.

7. (a) How many integral solutions are there of x1 + x2 + x3 + x4 + x5 = 30 where

for each; [10]
i. xi ≥ 0;
ii. xi ≥ 1;
iii. x1 ≥ 2, x2 ≥ 3, x3 ≥ 4, x4 ≥ 2, x5 ≥ 0;
iv. xi ≥ i.

1 of 2
Code No: RR210501 Set No. 1
(b) Six distinct symbols are transmitted through a communication channel. A
total of 12 blanks are to be inserted between the symbols with at least 2
blanks between every pair of symbols. In how many ways can the symbols
and blanks be arranged? [6]

8. (a) Explain the properties of Fibonacci Numbers. [8+8]

(b) Find a recurrence relation for the number of ways to make a pile of n chips
using garnet, gold, red, white and blue chips such that no two gold chips are
together.

⋆⋆⋆⋆⋆

2 of 2
Code No: RR210501 Set No. 2
II B.Tech I Semester Supplimentary Examinations, February 2008
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. Using the statements R: Mark is rich [16]

H: Mark is happy
Write the following statement in symbolic form:

(a) Mark is poor but happy

(b) Mark is rich (or) unhappy.
(c) Mark is neither rich nor happy
(d) Mark is poor (or) he is both rich and unhappy.

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) Are the graphs shown in the figure4a isomorphic ? [8+8]

Figure 4a
(b) Define isomorphism and give examples.

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

1 of 2
Code No: RR210501 Set No. 2
(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. (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) 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 -7an−1+ 26an−2 − 24an−3 =0 for n≥ 2. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR210501 Set No. 3
II B.Tech I Semester Supplimentary Examinations, February 2008
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) Without constructing the truth table find whether A∧ is valid or not for the
following. [8+8]
A→ ← B, B →
← (C ∧ D) C →
← (A ∨ E) and A ∨ E .
(b) Establish the validity of A∨C from A→← (B → C), B →
←(⌉ A∨⌉ C), C →←(A∨⌉ B)
and B.

2. (a) Let the compatibility relation on a set {x1 , x2 ,.......x6 } be given by the following
matrix. Draw the graph and find the maximal compatibility blocks of the
relation. [8+8]
X2 1
X3 1 1
X4 0 0 1
X5 0 0 1 1
X6 1 0 1 0 1
X 1 X 2 X3 X4 X5
(b) Let R denote a relation on the set of ordered pairs of positive integers such
that < x, y > R < u, v > if and only if xv = yu. Show that R is an equivalence
relation.

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. Prove that any 2 simple connected graphs with n vertices, all of degree 2, are
isomorphic. [16]

5. (a) Define planar graph and show that the following graphs are planar [8+8]
i. Graph of order 5 and size 8.
ii. Graph of order 6 and size 12.
(b) Explain non-planar graph and prove that the complete graph of 5 varieties K5
is non-planar (Kurtowskis First graph).

6. What is a minimum spanning tree? With the help of an example illustration,

explain the basic concepts and terminology of minimum spanning tree. [16]

1 of 2
Code No: RR210501 Set No. 3
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.
(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. Solve the recurrence relation [16]

S(k) - 0.25 S(k-1) = 0, S(0) = 6.

⋆⋆⋆⋆⋆

2 of 2
Code No: RR210501 Set No. 4
II B.Tech I Semester Supplimentary Examinations, February 2008
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) Obtain the formulae having the simplest possible form which are equivalent
to the formulae given below. [8+8]
i. ((P→Q) →← (⌉ Q→ ⌉ P)) ∧R.
ii. (P∧(Q∧S))V(⌉ P∧(Q∧S))
(b) Obtain the principal disjunctive and conjunctive normal forms for the follow-
ing.
→⌉ Q)
i. (⌉ P∨ ⌉ Q)→(P←
ii. (P→(Q∧R))∧(⌉ P→(⌉ Q∧⌉ R))
Which of the above is (are) tautology (ies).

2. (a) Let S = {1, 2, 3, 4, 5} and let A = S × S. Define the following relation R on A

such that (a, b) R (a’, b’) if and only if a b’ = a’b. [5+5+6]
(b) Show that R is an equivalence relation.
(c) Compute A/R.

3. (a) Let L be lattice. Then prove that a ∧ b = a if and only if a ∨ b = b. [8+8]

(b) Define the dual of a statement in a lattice L.Why does the principle apply to
L?

4. (a) Prove that the sequence 5,5,3,3,2,2 is graphic. Draw the graph [8+8]
(b) Show that 5,5,3,3,2,2,2 form a graphical sequence

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 a detailed algorithm for breadth-first traversal using an adjacency ma-
trix that just prints the node label as the visit operation. You should trace it
using the graphs. [8+8]
(b) Prove that each edge in a connected graph will be part of the breadth-first
traversal tree or will be an edge pointing to a node in the tree that is neither
a predecessor or descendent.

1 of 2
Code No: RR210501 Set No. 4
7. (a) How many ways can 20 similar books be placed on 5 different shelves ? [8+8]
(b) Enumerate the number of ways of placing 20 indistinguishable balls into 5
boxes where each box is nonempty.

8. Explain the methods of solving recurrence relations with suitable examples. [16]

⋆⋆⋆⋆⋆

2 of 2