Lovely Professional University 2010 B.Tech Computer Science and Engineering Design Problem Discrete mathematics - Question Paper
Friday, 25 January 2013 02:15Web
Design problem-1
Dos:-18-03-10
Q.1) We say 2 sets A and B are equivalent if there exist a mapping f:A¬B which is both one-one
and onto .In that case we write A¬ B .Show that ¬ is an equivalence relation.
Q.2) provided a non-empty set A, let f:A->A and g:A->A described as
(SEE IN ATTACHMENT)
Show that f=g.
Q.3) SEE THE ques. IN ATTACHMENT
Q.4) Solve the recurrence relations
(i) SEE THE ques. IN ATTACHMENT
(ii) SEE THE ques. IN ATTACHMENT
(iii) SEE THE ques. IN ATTACHMENT
Section-A1805
Design problem-1 Dos:-18-03-10
Q.1) We say two sets A and B are equivalent
if there exist a mapping f:A
B
which is both one-one and onto .In that case we write A
B
.Show that is
an equivalence relation.
Q.2) Given a non-empty set A, let 
defined
as
Q.3) Let 
with
Verify
that the quotient 
is
the generating function for the sequence 
Where
Q.4) Solve the recurrence relations (i) 
(ii) 
(iii) 
| Earning: Approval pending. |
