August 2011 Bachelor of Science in Information Technology (BScIT) Semester 2/ Diploma in Information Technology (DIT) Semester 2 BT00 !

! Discrete "athematics # $re%its

(Boo& ID' B0!())

Assignment Set 1 ( 0 "ar&s)

Ans*er all +uestions , 10 - 0 "ar&s

1 1 3) and (ii) f ( 15) 1. If f: R R is defined by f( x ) = x 2 3x + 5 find (i) f (

2. Prove that If A1, A2 ,.....,An are subsets of S. Then the non-empty minsets enerated by A1, A2 ,.....,An form a partition of S!. ". So#ve an 2an 1 =( n + 1)2n $. In a finite Poset S% sho& that there is a#&ays at#east one ma'ima# e#ement and one minima# e#ement. (. Sho& that If ) is a distributive #atti*e% then it is a modu#ar #atti*e!. +. Sho& that the set of rea# numbers is a roup &ith respe*t to mu#tip#i*ation.

August 2011 Bachelor of Science in Information Technology (BScIT) Semester 2/ Diploma in Information Technology (DIT) Semester 2 BT00 ! Discrete "athematics # $re%its
(Boo& ID' B0!())

Assignment Set 2 ( 0 "ar&s)

Ans*er all +uestions , 10 - 0 "ar&s

1. Sho& that (( p ~q ) r ) ( p ( q r ))
( P( x ) Q ( x )) ( xP ( x )) ( xQ ( x )) 2. Sho& that x

". ,onsider the -oo#ean e'pression

, , ) . .rite f( x 1, x 2 , x 3 ) = x 1 ( x 2 x 3 ) ( x 1 x 2 ) x 3 x 1 over({ 0,1},

] [[

dnf and *nf.

$. If

G = ({ S },{0,1}, :{S 0S1,S }, S )

% then find )(/)% the #an ua e enerated by /.

(. Prove that In a raph /% every u-v path *ontains a simp#e u-v path! +. Prove that If a binary n-tup#e ('1% '2% 0..%'n) is transmitted a*ross a binary symmetri* *hanne# &ith probabi#ity p su*h that no error &i## o**ur in ea*h *oordinate%

k n k then the probabi#ity that there are errors in e'a*t#y 1 *oordinates is !. k q p