SHRI V.K.

PANDE COLLEGE OF SCIENCE AND MANAGEMENT HINGANGHAT

SESSIONAL EXAMINATION -2009
BACHELOR OF COMPUTER APPLICATION-I
SUBJECT :DISCREAT MATHEMATICAL STRUCTURE-I
TIME:- THREE HOURS MARKS:-40
N.B 1:- All questions are compulsory and carry equal marks
2:- Draw neat diagram wherever necessary.
EITHER: (4*2)
1. a) Prove by mathematical induction that if A1,A2……….An and B are any (n+1)sets

b) For the set A and B prove that:-

i. A-(A-B)=A∩B
ii. A∪B=B ⇔ A ⊆ B
OR
c) If A,B,C are boolean matrices of compitiable size then :-
A∧(Β∨C) = (A∧B) ∨ (A∧C)
d) Let a,b and c be integer.
i. if a | b and a | c then a|(b+c)
ii. If a | b and a | c where b>c, then a | (b-c)
iii. If a | b or a | c then a | bc
iv. If a | b and b | c then a | c.
EITHER: (4*2)
2. a) Show that:-
i. ¬ (P ∧Q) →(¬P ∨(¬P ∨Q)) ⇔(¬P ∨Q)
ii. (P ∨ Q) ∧(¬P ∧(¬P ∧Q)⇔(¬P ∧Q)
without using a truth table:-
b) Obtain the principal disjunctive normal form of:-
i. (P∧Q)∨(¬P∧R) ∨(Q∧R)
ii. P→((P→Q) ∧ ¬(¬ Q ∨ ¬P))
OR
c) if H1,H2……….Hm and P imply Q, then H1,H2………Hm imply P→Q
d) Draw the logic network for
i. (a+b) . (a+b) ii a .b + c .d
EITHER: (4*2)
3. a) Show that:-
i) n Cn-r = n
Cr n≥ r ≥ 1
ii) Compute n+1Cn-1
iii) How many different seven persons commitees can be form each containing thr
from an available set of twenty women & four men from an available
set of 30 men.
b) i) Let A={1,2,3,4}, B={a,b,c} and R={(1,a) (1,b), (2,b), (2,c),(3,b),(4
S={(1,b),(2,c),(3,b),(4,b),} Compute a) R b)R∩S c) RUS d
ii) Let A={a,b,c,d,e} &
1 1 0 0 0
0 0 1 1 0
MR= 0 0 0 1 1
0 1 1 0 0
 1 0 0 0 0
Find R and its diagraph. Find indegree and outdegree.
OR
c) Suppose that (R∩S) , to prove R-1∩S-1
-1

d) Let A={1,2,3,4,5,6,7,8}
compute the product.
i. (3,5,7,8) o (1,3,2) ii. (2,6) o (3,5,7,8) o (2,5,3,4) iii. (1,4) o (2,4,5,6) o
(1,4,6,7)
OR
EITHER: (4*2)
4. a) Let A= {V1,V2,V3,V4,V5,V6,V7,V8,V9,V10} And Let T={(V2,V3),(V2,V1),(V4
(V5,V8),(V6,V7),(V4,V2),(V7,V9),(V7,V10)}
Show that 'T' is rooted tree and identify the root.
b) Prove that if a graph G has more than two vartices of odd degree then there ca
Path in G.
OR
c) Let 'L' be a lattices then :-
A) a ∨ (a∧b)= a
B) a ∧ (a∨b)= a
d) Draw a tree for algebraic expression.
i. ( 3 - (2*x)+((x-2)-(3+x))
ii. (3 *(1-x))/((4+(7-(y+2)))*(7+(x/y))))
EITHER: (4*2)
5. a) Let < G, * > be the finite cyclic group generated by an element a ∈ G. If G is o
an=e, so that G= { a,a2,a3,………………,an=e} n is the least positve integer for
b) Show that if group G is abelian, then every subgroup of G is normal sub-group.
OR
c) Describes precisley the language L(G) produced by the grammer:
G= (v,s,vo,→)
V={v0,v1,x,y,z},
S={x,y,z},
→: v0→xv0
v0→yv1
v1→yv1
v1→z
d) Let T be the set of all even integer. Show that the semigroup (z,+)and (T,+) a