DSGT 2006

www.andhracolleges.
com The Complete Information About Colleges in Andhra Pradesh
Code No: RR210501 Set No. 1

II B.Tech I Semester Supplementary Examinations, March 2006
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
www.andhracolleges.com
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) 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) 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 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) 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+8]
(b) Find the number of district triples (x1 , x2 , x3 ) of nonnegative integers satisfying
the inequality x1 + x2 + x3 < 6. [6]
8. Solve the recurrence relation an -9an−1+ 26an−2 − 24an−3 =0 for n≥ 3. [16]
⋆⋆⋆⋆⋆
Seminar Topics - Scholarships - Admission/Entrance Exam Notifications
1 ofUSA-UK-Australia-Germany-France-NewZealand
1 Universities List
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

Engineering)
⋆⋆⋆⋆⋆
1. (a) Explain the difference between the principal of disjunctive and conjunctive
normal forms. [8+8]
(b) Obtain the principal conjunctive normal form of the formula S given by
(⌉ P → R) ∧ (Q→ P)
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) 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. (a) Define the terms ‘path’ and ‘transitive closure’. [6+10]
(b) Prove that a digraph G is strongly connected iff there is a closed directed path
containing every vertex in G.
5. (a) Define connectivity, separability, cut vertex [6]

(b) Prove that [10]
i. The edge connectivity of a graph G can not exceed the degree of G.
ii. The vertex connectivity of a graph can never exceed its edge connectivity.
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.
7. (a) Explain the terms [10]

i. Disjunctive counting and
ii. Sequential counting.
2 Universities List


(b) How many numbers can be formed using the digits 1, 3, 4, 5, 6, 8, and 9 if no
repetitions are allowed? [6]
8. Solve the recurrence relation an -9an−1+ 26an−2 − 24an−3 =0 for n≥ 3. [16]
⋆⋆⋆⋆⋆
2 Universities List


Engineering)
⋆⋆⋆⋆⋆
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) Let D(n) be the number of ways that the set {1, 2,......., n}, n ≥ can be parti-
tioned into two non empty subsets. Find the recurrence relation for D. Also
solve the recurrence relation. [8+8]
2
Prove that if r is a transitive relation on a set, then r ⊆ r.
(b) Show that there are only five distinct Hasse Diagram for partially ordered sets
that contains three elements.
3. (a) Prove that if the function f : A→B has an inverse if and only if b is bijective.
(b) Show that the set of positive N is a lattice with respect to the operations a ∨
b = l c m(a,b) and a ∧ b = g c d, (a, b), l c m - least common multiple and
g c d - greatest common divisor. [8+8]
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) 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) Describe the applications of spanning trees. [8+8]
(b) What kind of traversal is applied to serach the files and directories in a DOS
environment. Justify your explanation.
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. Explain the methods of solving recurrence relations with suitable examples. [16]
⋆⋆⋆⋆⋆
1 Universities List


Engineering)
⋆⋆⋆⋆⋆
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) 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) 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) 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 the terms [10]
i. Disjunctive counting and
ii. Sequential counting.
(b) How many numbers can be formed using the digits 1, 3, 4, 5, 6, 8, and 9 if no
repetitions are allowed? [6]
8. If Fn satisfies the Fibonacci relation Fn = Fn−1 + Fn−2 for n≥ 2, then
√shown that
√ n
1+ 5 1− 5
three exists two constant C1 and C2 such that Fn =C1 2
+ C2 2
where
the constants are completely determined by the initial conditions. [16]
⋆⋆⋆⋆⋆
1 Universities List

DSGT 2006

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSGT 2006

Uploaded by

Copyright:

Available Formats

www.andhracolleges.

com The Complete Information About Colleges in Andhra Pradesh

Code No: RR210501 Set No. 1

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: RR210501 Set No. 2

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

5. (a) Define connectivity, separability, cut vertex [6]

7. (a) Explain the terms [10]

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: RR210501 Set No. 2

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

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: RR210501 Set No. 3

1. (a) Show that RVS follows logically from premises. [8+8]

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: RR210501 Set No. 4

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

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

You might also like