B4.

2-R3: DISCRETE STRUCTURES

Question Papers

January 2007

January, 2006

July 2006

July, 2005

January, 2005

July, 2004

January, 2004
 B4.2-R3:DISCRETE STRUCTURE

January 2007

Time: 3 Hours Total Marks: 100

1.
a) i) If A= φ and B={{{a}}}, φ } then Find (P(P(A))) and P(B). (P denotes Poset Set).
ii) Let A={1, 2, 3, 4, 5} and B={4, 5, 6, 7}. Compute i) A-B, ii) AXB
b) Show that every cyclic group of order n is isomorphic to the group <Zn, †n>.
c) Let X={2, 3, 6, 12, 24, 36} and the relation ≤ be such that x ≤ y if x divides y. Draw the Hasse diagram
of < X, ≤ >.
d) What do you mean by DUAL of a statement in Boolean algebra?
e) Let p: Food is good
q: service is good
r: restaurant is 5-star
Write following in Symbolic notations
i) It is not true that five star restaurant always means for good food and good service.
ii) Food is good but service is poor.
f) How many ways can the letters in word MISSISSIPI can be arranged?
g) Let A= {a, b}. Write regular expressions such that L (r) which consists of all words w, where fifth
character from right end is always a.
(7x4)

2.
a) Find the Principal Conjunctive Normal Form of the formula (~ p → R) Λ (Q↔P).
b) Test the validity of the following argument:
If I study, then I will not fail in Mathematics
If I do not play basket ball, then I will study
But I failed Mathematics
Therefore, I must have played basketball.
c) In a room containing 25 females, there are 18 females who speak English, 15 females speak French
and 22 speak German. 9 females speak both English and French, 11 females speak both French and
German whereas 13 speak both German and English. How many females speak all the three
languages?
d) Find all Partitions of S={1, 2, 3}.
(5+5+5+3)

3.
a) Prove that both join and meet operations in Lattice algebra and associative.
b) Prove that, in a distributive lattice, if an element has a complement then this Complement is Unique.
c) Find a minimal sum for the Boolean expressions:
E= x +x’yz + xy’z
d) Prove that the relation, “Divides” is a POSET.
(5+5+5+3)
4.
a) For the following graph find its spanning tree of minimal cost using kruskal algorithm.
14

19 9 3

17 4
31 12

16

b) Apply the Dijkistra’s algorithm to find the shortest path from a to z from given figure.

3
b e

2 2 5 1

a 1 c z

2 7
4 3

d f
4

c) Define briefly the followings

i) Cut Set, ii) Eulerian Circuit, iii) Bipartite graph, iv) Hamiltonian Path
(6+8+4)

5.
a) Let A= {0, 1} construct a deterministic finite automation M such that L(M) will consist of
i) Those words in which number of 0’s and 1’s is even
ii) Those words in which number of 1’s are odd
m m
b) Show that the language L = {a b : m positive} is not regular.
c) Define a Phase structure grammar.
(10+6+2)

6.
a) Find integers m and n such that 512 m + 320 n = 64.
n 3
b) Prove by mathematical inductions the following, 2 >n for n ≥ 10.
c) If Fn satisfied the Fibonacci relation for the Fibonacci series (1, 1, 2, 3,…) define by the recurrence
relation, Fn =Fn-1 + Fn-2, F0 = F1, then find a formula to find nth Fibonacci number.
(5+6+7)

7.
a) Prove that composition of two homomorphism is also a homomorphism.
n n n
b) If {G, *} is an abelian group, show that (a * b) =a * b , for all a, b Є G, where n is a positive integer.
c) A bag can contain six white balls and five red balls. Find the number of ways, four falls can be drawn
from the bag if two must be white and two red.
d) State pegions holes principle.
 July 2006

Time: 3 Hours Total Marks: 100

1.
a) i) Determine the power sets of {φ, { φ }}.
ii) Let S={2, 5, √2, 25, π, 5/2} and T ={4, 25, √2, 6, 3/2}
Find S∩T and Tx(S∩T).
b) For integers a,b, define a ~ b if and only if 2a + 3b = 5n for some integer n. Show that ~ defines an
equivalence relation on Z. (set of Integers).
c) Define a Monoid.
d) Draw the Hassediagrams for each of the following partial orders.
i) ( { 1,2,3,4,5,6},≤ )
ii) ( { {a},{a,b},{a,b,c},{a,b,c,d},{a,c},{c,d} },⊆ )
e) Wht is a Spanning tree?
f) Write the converse, inverse and contrapositive of P→Q.

g) Show that the functions f : R → (1, ∞ ) and g : (1, ∞) → R

log 3( x − 1)
Defined by f(x)=3 +1, g ( x ) =
2x
are inverse of each others.
2
(7x4)

2.
a) Find the principal disjunctive normal form of (P∧Q) ∨ (~P∧R) ∨ (Q∧R).
b) Show that ~ (P∧Q) follows from ~ P∧ ~Q.
c) In a group of 25 students, 12 have taken Mathematics, 8 have taken Mathematics but not Biology.
Find the number of students who have taken Mathematics and biology and those who have taken
Biology but not Mathematics.
(6+6+6)

3.
a) For any a, b, c, d in a lattice (A, ≤), if a ≤ b and c ≤ d then Prove that (a∨ c) ∨ (b∨ d) and (a ∧c) ≤ (b
∧d) (where ∨ is join and ∧ is meet operation).
b) Prove that if the meet operation is distributive over the join operation in a lattice, then the join
operation is also distributive over the meet operation.
c) Minimize the following expressions using Karnaugh map.
F − ABC + A BC + AB C + A B C
(6+6+6)

4.
a) Apply Dijkstra’s algorithm to the graph given below and find the shortest path from a to f. (Show all
the steps)
 6
b d
1 2
a 2 5 3 f
4
7
c 1 e

b) Define briefly the following:

i) Cut set
ii) Hamiltonian path
iii) Bipartite Graph
iv) Isomophic graph
c) For the following graph, find its spanning tree of minimal Cost using Kruskal algorithm.

16
1 2
21 11
5

19 6
6
14 3
33

10
5 18 4

(8+4+6)

5.
a) In how many ways 7 women and 3 men are arranged in a row if the 3 men must always stand next to
each other.
b) i) State pigeonhole principle.
ii) Suppose that a patient is given a prescription of 45 pills with the instruction to take at least
one pill per day for 30 days. Then prove that there must be a period of consecutive days
during which the patient takes a total of exactly 14 pills.

c) If Fn satisfies the Fibonacci relation for the Fibonacci series (1,1,2,3…) defined by the recurrence
relation, Fn = Fn-1+Fn-2, F0=F1=1 then prove that nth Fibonacci number is given by (for n = 0,1,2,3, -----
------).
1 n n
Fn = [(1 + 5 ) − (1 − 5 )]
2n 5
 (6+6+6)

6.
a) Prove that for any a and b in a Boolean algebra
A ∨ B = A ∧ B and
A∧ B = A∨ B
b) Define the following terms:
i) Permutation of a set
ii) Abelian group
iii) Subgroup
iv) Group Homomorphism.
c) Prove that every finite group of order n is isomorphic to a permutation group of degree n.
(4+8+6)

7.
n 3
a) Prove by mathematical induction the following, 3 >n for n>3.
b) Find the regular expressions for a Valid Identifier fo any length in C language:
(The rule of an Identifier in C language is that first character is an alphabet or an Underscore and the
consequent letters are alphabet and/or digit and/or underscore, no extra symbols are allowed except
defined above).
c) Define a finite State Machine.
d) Calculate the greatest common divisor of 240 and 70(Step wise) by using Euclid’s algorithm.

JANUARY 2006
NOTE:

1. Answer question 1 and any FOUR questions from 2 to 7.

2. Parts of the same question should be answered together and in the same sequence

Time: 3 Hours Total Marks: 100

1. a) Can a relation R in a set A be both symmetric and anti symmetric? Justify your answer.

b) Write the negation of the following by changing the quantifiers:

“Every complete bipartite graph is not planer.”

c) Prove absorption low in a Boolean algebra.

d) How many ways can one right and one left shoe be selected from 10 pairs of shoes without obtaining a
pair?
e) What is the largest possible number of vertices in a graph with 35 edges and all vertices of degree at
least 3?

f) Find a grammar to generate the set

{0 m1 n | m and n are non negative integers)}

g) Let (A,*) be an algebraic system, where * is a binary operation such that for any a and b in A

a*b = a

Show that this operation is associative.

(7x4)

2. a) Suppose R is an arbitrary transitive and reflexive relation on a set A. Prove that the relation E
defined by “x E y iff x R y and y R x” is an equivalence relation.

b) Prove or disprove the validity of the following argument:

i) Every living thing is a plant or animal.

ii) Ram’s dog is alive and is not a plant.

iii) All animals have heart.

iv) Hence Ram’s dog has a heart.

(9+9)

3. a) Prove that is R is a partial ordering relation on a set S, then for n ³ 2,there can not be a sequence s
1, s 2, s 3,…. s n of distinct elements of S such that s 1 R s 2 R s 3…Rs nRs 1.

b) Minimize following switching function

å m (0, 2, 8, 12, 13).

c) Consider the group (Z 4, Å ): the integer modulo 4 group with respect to the operation Å : addition
modulo 4. Does H={[0], [2]} form a subgroup of Z 4. If yes, is it a normal subgroup? Justify.

(6+6+6)

4. a) Solve the following:

a n = 2 a n-1 + 1

where

a 0 =0
a 1 =1

a 2 =3.

b) Find a generating function to count the number of integral solutions of

e 1 + e 2+ e 3 = 10 if for each i, 0 £ e 1

(9+9)

For more questions papers visit www.DoeaccOnline.com, www.IgnouOnline.com

5. a) Show that complement of a regular set is a regular set.

b) Write a grammar/ regular expression for the language on the alphabet {0,1} having all the strings with
different first and last symbols.

c) Find a deterministic finite state machine that recognizes the set:

L={0 i10 j | i ³ 1, j ³ 1}

(6+6+6)

6. a) Apply Dijkstra’s algorithm to determine a shortest path between a and z in the following graph:

The numbers associated with the edges are distances between vertices.

b) Obtain the principal conjunctive normal form and principal disjunctive normal form of the formula S
given by

( Ø P ® R) L (Q « P)

c) State pigeon hole principle show that in a sequence of n2+1 distinct integers, there is either an
increasing subsequence of length (n+1) or decreasing subsequence of length.

(6+6+6)
 JULY 2005
NOTE:
1. Answer the question 1 and any FOUR questions form 2 to 7.
2. Parts of same question should be answered together and in same
sequence.
TIME : 3 Hours
Total Marks: 100

1.
a) Let R1 and R2 be binary relations defined on set of positive integer by
R1 ={(a,b):a-b is an odd positive integer}
R2 = {(a,b): a=b2 }.

Is R1 transitive ? Is R2 anti-symmetric? Why?

b) Express the following proposition in Symbolic form:

“ If I work hard than I get good marks.”
Also, Write its converse, inverse and contra positive in symbolic form.

c) Let x, y z be the variable in Boolean algebra. Show that

[(z’ + xy’ ).( xy)]’ = (x.y.z’)’

d) Let G be the commutative group.

Let H ={ x G : x2 = e } show that H is subgroup of G.
e) i) Solve the congruence 3x= 5 (Mod 7).
ii) If H.C.F. of a and b is 1 and both a and b divide c, then prove
that a b also divides c ( a, b, c are positive integers)

f) Find a minimal spanning tree for the following graph using Kruskal’s algorithm.

1 c 2
b d

4 1
3

g) State pigeon hole principle. U se it to show that in any set having eleven or more positive
Integers,
there are at least two whose difference is divisible by 10.

h) Consider the grammar G with productions:

S AB, A Aa, B Bb, A a, B b
Find the derivation of word a2b4 .

(4+3+4+3+4+3+4+3)

2.
 a) i) Let A= {n3 : n is a positive integer}
B= {n2 : n is a positive integer }

Find A B. Is the set A B countable ?justify.

ii) Let x and y be the sets such that x-y =y. show that both x and y are empty sets.

b) Let x = {1,2,3}.
i) How many reflexive relations can be defined on x ?
ii) If R ={(1,2), (2,3), (2,1)}, fine the smallest transitive relation on x containing R.

c) Let a= {0,1,2,3,…}. Define function f ,g and h from A to A by

f(x)=x+1, g(x)= 2x and
h(x)= 0 , when x is even
h(x) = 1 , When x is odd.
Is ƒ one to one ? Is g onto? Compute(h o g ) o ƒ(3)

([4+2]+[3+5]+[1+1+2])
3.
a) Which of the posets give in the following diagram are lattices ? Why ?

d t

4 5
6

e c

p q
r

f b
2

1 3 a s

(i) (ii) )iii)

Find minimal and maximal elements in diagram(i). Also find p (q r) in diagram (iii)

b) Using mathematical induction, show that

1 / + 1/ +…+1/ > n for all n>1.
1 2 n

c) Using Karnaugh map, find a minimal sum of products form for

E=(x z’) (x y z) (x’ y’ z’) (x’ y z t’ )

(6+6+6)

4.
a) Let g be the connected graph having 10 vertices. Such that degree of each vertex is three.
In how many regions does a representation of this planer graph splits the plane?
 b) Draw graph K5 Is it planer ?? Justify.

c) i) Give an example on a non-abelian group

ii) Find generators of the group(G,*) where G ={1,2,3,4) and *= multiplication module
5.

c) Apply Dijkstra’s algorithm to the graph given below to find the shortest path from ’a’ to ‘z’ ,
Also find minimum distance.

B 7 d

A 2 5 3 Z
5
jjh
4 6

C 1 e

(4+4+[2+2]+6)]
5.
a) i) Solve the recurrence relation
an – 4 an -1 + 4 an- 2 = (n+1)2n

ii) Find the generating function of the sequence

1, a, a2, a3,…

b) If the letters of the word PRIME are arranged as in dictionary (with or without meaning)
find the relative position of word PRIME in this arrangements

c) Let A= {1,2,…11}. Let R = {(x, y) : x – y =3m for some integer m}

Show that R is equivalence relation. Also, find all the equivalence classes.

6.
a) Draw the state table and state diagram of the finite state machine M =(A, O, S, ƒ, g, s0)
where A={a,b}, O={0,1} and S={( s0, s1) )}, Next state function f: S x A S is defined
by f (s0 ,a)= s1 ; f(s0 , b)= s1 ; f(s1 ,a)= s0 and f(s1 ,b)= s1 . Output function
g= S x A O is given by g( s0 ,a)=1 ; g(s0 ,b)=1;g(s1 ,a)=0 and g(s1 ,b)=1. Initial state s0.

b) Let g be a Graph in which every vertex is of degree 3. Show that G has even number of
vertices.

c) State ‘absorption’ and ‘Demorgan`s ‘ low is Boolean algebra.

d) Put the Boolean function f(x,y,z)=( x y’) (x’ z ) in CNF (Conjunction normal form )

(6+4+2+6)
7.
a) Let R denote the set of real numbers. Define a junction ƒ : R R by ƒ(x)= 3(x) -1 x
R.
If ƒ is invertible? IF yes fine ƒ – 1 .
b) Determine the numbers of integers between 1 and 200 that are divisible by at least one of
the integers 2,3,5
c) When do we say that two graph are isomorphic? Are the two graph given below isomorphic
? Justify.
G1: G2:
a b c t
s

v
r

d e g p
q

d) There are two restaurants next to each other. One has a Signboard that says “ good food is
not cheap” and
other has signboard that says “ Cheap food is not good”. Are the two signboard says same
thing ?justify

(4+5+5+4)
January, 2005

NOTE:
1. Answer question 1 and any FOUR questions from 2 to 7.
2. Parts of the same question should be answered together
and in the same sequence.

Time: 3 Hours Total

Marks: 100

1.
a) Each of the following defines a relation on the positive integers N:
1) x is greater than y
2) xy is the square of an integer
3) x + y =10
4) x+4y = 10
Determine, which relations are (i) reflexive (ii) Symmetric (iii)
anti-symmetric (iv) transitive
b) Let G be a group and let a be a fixed element of G. Show that the
functions fa : G -> G defined by fa (x) = axa –1 for x ∈G, is an
isomorphism.

c) Solve the linear congruence equation.

i) 132x = 169 (mod 735)
ii) 48x = 284 ( mod 356)
d) Define the complete bipartite graph on m and n vertices, denoted
as k m,n. Draw the graph K2,5.
e) In how many ways can 10 students be divided into 3 teams, one
containing 4 students and the others 3 ?
f) Let L be the language on A = { a,b,c }which consists of all words of
the form
w = ar bs ct where r,s,t > 0, that is , a’s followed by b’s followed by
c’s.
i)Find a regular expression r such that L = L(r)
ii) Find a regular grammar G which generated the language L
g) P(x) : x is even Q(x) : x is prime R(x,y) : x+y is even. The
variables x and y are integers. Write English sentence corresponding to
each of the following:
i) ~ ( ∃ x P(x) )
ii) ~ ( ∀ x Q(x) )
h) A partition of a positive integer m is a set of positive integers whose
sum is M. Consider m = 5. Draw tree form representation.
i) Define the principle of mutual exclusion and inclusion.
(4+4+2+3+3+4+2+3+3)
2.
a) Prove the follwing :
Let f : A -> B and g : B -> A be functions such that g o f = 1A and f o
g = 1B. Then f is a one-to-one correspondence between A and B, g is a
one-to-one correspondence between B and A and each is the inverse
of the other.

b) Prove or disprove that if a relation on a set A is transitive and

irreflexive , then it is asymmetric.

c) Consider the following assumptions:

S1 : All dictionaries are useful
S2 : Mary owns only romance novels
S3 : No romance novel is useful
Determine the validity of each of the following conclusions:
i) romance novels are not dictionaries
ii) Mary does not own a dictionary
iii) All useful books are dictionaries
Use Venn diagram to show the representation.

d) Find the Power set of A = {1,2,3,4,5 }

(5+5+5+3)
3.
a) Let A = {a,b,c} and consider the semigroup(A*, .), where . is
the operation of concatenation. Id α = abac, β = cba, γ = babc,
compute
i) (α.β).γ
ii) γ.(α.α)
iii) (γ.β).α
b) Describe the quotient semigroup for S = Z with ordinary addition
and R defined by a R b, if and only if a = b (mod 5)

c) Let (G,*) and (G1,*1) be two groups, and let f: G -> G1 be a

homomorphism from G to G1. Then prove the following:
i) If e is the identity in G and e1 is the identity in G1, then f(e) =
e1;
ii) If a ∈ g, then f(a –1) = (f(a))-1
(6+4+8)
4.
 a) Write Euclidean algorithm to find gcd(a,b) of two non-negative,
non-zero integers a and b.
b) Suppose a ≡ c(mod m) and b ≡ d(mod m) then prove the
following:
i) a+b ≡ c+d(mod m)
ii) a.b ≡ c.d (mod m)
c) Define RSA public key encryption and give the formula for ab
mod z.
d) Prove d=gcd(a,b) considering d to be the smallest positive
integer of the form ax + by.
(5+5+3+5)
5.
a) Use a Karnaugh map to find a minimal sum-of-products form for
e = xyp + xyz + xpypzp + xpyztp
b) Apply Boolean arithmetic to show that the following equality is valid
( zp ∨ x) ∧ (( x ∧ y) ∨ z) ∧ (zp ∨ y) = x ∧ y
c) Consider the bounded lattice L in the following Fig:

f
e

c
b d

i) Find the complements, if they exist, of e and f.

ii) express 1 in the irredundant join of irresucible decomposition
in as many ways as possible.
iii) Is L distributive ?
iv ) describe the isomorphisms of L with itself.
(5+5+8)
6.
a) Prove that Kn the complete graph on n vertices with n ≥ 3, has
(n-1) ! Hamiltonian circuits.
b) Consider the graph below and find a Hamiltonian path or
Hamiltonian circuit, if it exists. If it does not, why not?
c) Write Prim’s algorithm and using the algorithm find minimal
spanning tree for the graph starting from F.
D H
B 6 2

3
3 2
A
 d) Prove by mathematical induction the following:
12 + 22 + 32 +……n2 = (n(n+1)(2n+1))/6
(5+3+5+5)
7.
a) Assume that deer population in a country is 200 at time n=0 and
220 at time n=1 and that the increase from time n-1 to time n is
twice the increase from time n-2 to time (n-1). Write a
recurrence relation and an initial condition that define deer
population at time n and then solve the recurrence relation.
b) Let G be the context-free grammar with production S -> a, S ->
a A S and A -> bS.
i) Write G in Backus-Naur form
ii) Find the derivation tree of the word w = abaabaa
c) Develop a formula for the solution of a recurrence relation of the
form
an – m an-1 - 1, a1 = m
d) Let A = {a,b}. Construct an automation M which will accept the
language L(M) = {br abs : r>0, s>0 }
(6+4+4+4)

July, 2004

NOTE:
1. Answer question 1 and any FOUR questions from 2 to 7.
2. Parts of the same question should be answered together
and in the same sequence.
Time: 3 Hours Total
Marks: 100

1.
a) Let A = { 1,2,3,4,5} and let B = {4,5,6,7}. Compute
i) A–B
ii) B–A
iii) AxB
iv) 2B-A (Power set)
b) Let Q be the set of all rational numbers, then if the relation p is
defined as:
x p y ↔ |x| ≤ |y|; for ∀x,y ∈ Q
Check the relation for reflexivity, symmetry, anti-symmetry and
transitivity.
c) Let S be a finite set, with | S | = n. Find
i) Number of functions from S to S.
ii) Number of 1 – 1 functions from S to S.
iii) Number of functions from S onto S.
d) Construct truth tables for the following wffs. Note any tautology
or contradiction or contingents.
i) (A → B) ↔ (¬ A ∨ B)
ii) (A ∧ B) ∨ C → A ∧ (B ∨ C)
e) How many numbers between 100 and 999 inclusive are divisible
by 5.
f) Give the Hasse diagram for the following partial order:
i) S = {a,b,c}, p = {(a,a), (b,b), (c,c), (a,b), (b,c),
(a,c)}
ii) S = {a,b,c,d}, p = {(a,a), (b,b), (c,c), (d,d), (a,b),
(a,c)}
g) State the Church – Turing Thesis.
(4+4+9+4+3+2+2)

2. Prove the following (do not use a truth table).

a) ¬ (¬ A) → A
b) (P → (Q → R)) → (Q → (P → R))
c) (∃x)(∀y)Q(x,y) → (∀ y)( ∃x)Q(x,y)
(6+6+6)

3. Let the nth Fibonacci sequence be defined by:

F0 = F1 = 1;
Fn = Fn-1 + Fn-2; n > 1
Then
a) Give a closed form formula for the nth term in the sequence.
b) Fn+1 Fn-1 – (Fn)2 = (-1)n+1; n>1
c) 2Fn = Fn+1 + Fn-2; n>2
(7+7+4)

4.
a) In how many ways can a committee of 5 men 7 women be
selected out of a panel of 17 men and 23 women?
b) Let f : N → N be defined by f(x) = x + 1. Let g : N → N be
defined as g(x) = 3 x.
Calculate
i) (g ο f)(5)
ii) (f ο g)(5)
iii) (g ο f)(x)
iv) (f ο g)(x)
v) (f ο f)(x)
vi) (g ο g)(x)
c) Describe the directed graph with 5 nodes whose adjacency
matrix has all 1s in the 1st column and 0s elsewhere and draw its
graph (planar).
d) Design a Finite State Machine that accepts a binary string as
input and changes every alternate bit beginning second bit.
1001101 will be changed to 1100111.
(4+6+3+5)

5.
a) State and prove the Euler’s theorem for graphs.
b) Apply the Dijkstra’s algorithm to find the shortest path from
node 2 to node 5.
 5

2 2 3
2 1
3 1
1 1 4
7 8
5 1
1
4
6 5
6

(7+11)

6.
a) Find the grammar that generates the language L = (0 ∨ 1)* 01.
b) Use the Quine-McCluskey’s procedure to find the minimal sum of
product form of the expression given below. If there is more
than one equivalent solution, find all of them.

x1 x2’ x3 x4’ + x1’ x2’ x3 x4’ + x1’ x2 x3 x4’ +

x1’ x2’ x3’ x4’ + x1’ x2 x3’ x4’ + x1’ x2’ x3’ x4
(8+10)
7.
a) Let n be a positive integer The is – congruent – to – mod – n
relation is an equivalence relation on the set of positive integers.
b) Let G=< Z/4, ⊕ > be a group, where Z/4 denotes the set of
integers module 4 w.r.t the operation ⊕ - the addition module 4.
Let H={[0], [2]} be a subgroup of G. Find the left cosets of H.
c) Give examples of following with justification:
i) a semigroup without identity.
ii) A subgroup of a group which is not normal.
iii) Non-commulative group.
(6+6+6)
January, 2004

NOTE:
1. Answer question 1 and any FOUR questions from 2 to 7.
2. Parts of the same question should be answered together
and in the same sequence.

Time: 3 Hours Total

Marks: 100

1.
(a) In a science fair of a school, 34 students received awards for
scientific projects. Out of which 14 awards were given for
projects In Physics, 13 in Biology and 21 In Chemistry. If 3
students received awards in all three subjects, find the number
of students received awards for exactly (i) one subject (ii) two
subjects.
(b) Let A be the set of strings of 0's and 1's of length 3 or less.
Define the relation of R on A by xRy if x is contained within y.
Draw the Hasse diagram for this relation.
(c) Find the coefficient of x5 in (1-2x)-7.
(d) Seven towns K. C, B, M. A, D and L are connected by a system
of highways as follows:
i) H1 goes from K to B through C.
ii) H2 goes from B to M and then passes through C as it
continues to D.
iii) H3 goes from M through A to K.
iv) H4 goes from D to C. passing through Land
v) H5 goes from L to M.
1) Using vertices for towns and directed edges for segments of
highways between towns, draw a directed graph that models this
situation.
2) List the paths from L to K
3) Is It possible to leave town B and return there visiting each of
the other towns only once?
(4x7)
2.
a) Let A = {1,2,3,4.5} X {1.2,3.4.5} and define a relation R on A
by (x1,y1)R{ x2,y2) if x1+y1=x2+y2. Show that R is an
equivalence relation on A. Determine the equivalence classes
[(1,3)],[(2,4)] and [(1,1)].
b) For each of the networks In the following figurer express the
output In terms of the Boolean variables x, y or their
complements. Then use the expression for the output to simplify
the given network.
(8+10)

3.
a) Define the binary operation o on Z by x o y = x + y + 1. Show
that (Z. o) is an Abelian group.
b) Let <C;*> be a subgroup of the group <G, *> and let 8 and b
be any elements of G. Then show that either C * a = C * b or (C * a)
∩ (C * b) = φ
(9+9)
4.
a) Find the number of positive integers n where 1 ≤ n ≤ 100 and n
is not divisible by 2,3 or 5.
b) Find the number of ways that one can distribute a dozen apples
among 5 children so that no child gets more than 7 apples.
(9+9)
5. Derive the recurrence relation to find the number of distinct
binary trees that can be generated with n nodes. Also obtain its
solution.
(18)
6.
a) Write an efficient algorithm, which can be used to compute the
connected components .of an undirected graph.
b) Trace the Kruskal's algorithm to find the minimum spanning tree
of the following graph
 (9+9)
7.
(a) Construct a state diagram for a finite state machine with {0,1}
that recognizes all strings in the language
{0,1}*{00}∪{0,1}*{11}.
(b) Given nonempty language A ⊆ Σ*, prove that if A* = A, then. λ ∈
A.
(9+9)