Roll No. 1221 B. E. 3rd Sem. (Compt. Science) Examination, December, 2007 DISCRETE STRUCTURE Paper : CSE-203-E Time _: Three hours ] [ Maximum Marks : 100 Before answering the question, candidate should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be entertained after examination. Note : Attempt only five questions. All questions carry equal marks 1. Out of total of 130 students, 60 are wearing hats to class, 51 are wearing scarves, and 30 are wearing both hats and scarves. Of the 54 students who are wearing sweaters, 26 are wearing hats, 21 are wearing scarves and 12 are wearing both hats and scarves. Everyone wearing neither a hat nor a scarf is wearing gloves. 20 (2) How many students are wearing gloves ? {b) How many students not wearing a sweater are wearing hats but not scarves ? 1221-4,150-(P-3)(Q-8)(07) REO:(© How many stuslents not wearing eweaters are Wearing neltnera hat nora Wart? 2. Consider the following = sales of Houses fall OFF if terest rales se. Auctioneers art not happy (if sles OF houses falls off Interest rates are ising). The ‘question ie = fe those statements results in a ‘autology 20 ‘8 (@) Filton bab all pagename toe drafted by the three protessiqnal teams in Boston, Chicago and Now Vork such that cach team wall Draft ve players. In how many ways-can thisbedone? 15 (@) Fifteen lasktball players are to be divided into Shoes ten of ive players each in how many says thea canbe done? 4 Let a, aots the NO, af agen compet graph (a) Drive « meutvense relation for ap im teeme of (@) Solve me recurrence relation, 5. Lot (As#) be 2 semi group and’ be a loft adontty Turtheemw, for every vin A there exists in A such thar x= e 20 (0) Show that for anya bye iA GE ott ee. thon twovarsowayosyon (2) {(&) Show that (A, ") Sea group by showing that ei an identity element 6. (a) Show thot a egular binary te has an odd no. of ‘vertices Ey (&) Prove thit the compliment of = spanning roe oes not contain a cutset and that the Compliment of a" cutest does not contain. spanning tree, 7. (@) Suppose Cie finite eyclo fre graph with at last ‘me edge. Shovr that & has at least two vertices of degree 1 0 (&) Show that a connected graph G with n vertices tat awe atleast ecges 8. Write shore notes on (any three) 20 @) Pulerian paths and circuits, () Classes sets, (©) Plannee graphs and binary toss, (2) Lagrangats theorem. reararsogavosion (8)