BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI INSTRUCTION DIVISION SECOND SEMESTER 2009-2010 COURSE HANDOUT(PART-I) Date: 07/01/2010

In addition to Part-I (General Handout for all courses appended to the Timeta le! this portion "i#es further specific details re"ardin" the course$ Co !"# No$ Co !"# T&'(# I)"'! *'o! I) C+,!-# T#,/ o0 I)"'! *'o!" % % % : %&TH '222 Discrete (tructures for 'omputer (cience NAVNEET GOYAL (-o#(.) Trilo) %athur (tmathur*!

1$ COURSE DESCRIPTION% +an"ua"e of %athematics, sets - operation on sets, relations - e.ui#alence relations, elementar/ lo"ic, propositions, informal proof, lo"ical e.ui#alence, 0ea)- stron" form of mathematical induction, pi"eonhole principle, recurrence relations, "raph, "raph isomorphism, 1uler - Hamiltonian "raphs, planar "raphs, "roups, finite "roups, +a"ran"e theorem$ 2$ SCOPE & OB1ECTIVE% To de#elop lo"ical and mathematical concepts necessar/ to appreciate computational s/stems$ stud/ of concepts, techni.ues, and s)ills necessar/ to comprehend the structure of pro lems encountered in desi"n and anal/sis of al"orithms$ To pro#ide mathematical foundations for courses in computer science that rel/ upon the comprehension of formal a stract concepts$ The course 0ill train students in informal notation for prepositional and predicate lo"ic$ To construct formal proofs in prepositional and predicate lo"ic and throu"h such proofs help them to determine the #alidit/ of 1n"lish lan"ua"e ar"uments$ To pro#e theorems usin" the concepts of direct proof, proof / contraposition, proof / contradiction, and proof / induction$ To stud/ recursion and to 0rite recursi#e definitions for certain se.uences and collections of o 2ects$ Graphs, directed "raphs, planar "raphs - their rele#ance to circuit desi"n - map colorin" pro lems$ 3asic concepts of "roup theor/$ 2$ TE3T BOO4% Mo'' , 4,)5#(, & B,6#! : Discrete %athematics for 'omputer (cientists - %athematicians PHI, 2e, 2002$ 7$ REFERENCE BOO4S% R1$ C L L& % E(#/#)'" o0 D&"*!#'# M,'+#/,'&*", %cGra0 Hill, 2e, 1456 R2 4 H Ro"#)% D&"*!#'# M,'+#/,'&*" & &'" A88(&*,'&o)", T%H, 7e, 2007$

9$ COURSE PLAN% (u 2ect Introduction - 9#er#ie0 +o"ic, lo"ical inferences, methods of proof, Pi"eon hole principle :irst order lo"ic - other methods of proof, .uantifiers %athematical Induction, stron" form of mathematical induction 8ecurrence relations - sol#in" recurrence relations 0ith "eneratin" functions %ethod of characteristic roots for sol#in" recurrence relations (ol#in" inhomo"eneous - nonlinear recurrence relations 8elations - directed "raphs, e.ui#alence relations, partiall/ ordered set, totall/ ordered set, Hasse dia"rams, 0ell ordered set Graphs: 3asic concepts Isomorphism, (u "raphs, - special "raphs Planar "raphs, multi"raphs - 1ulerian - Hamiltonian "raphs 3oolean &l"e ra: 3asic concepts Group, "roup isomorphism, c/clic "roups, su "roups - +a"ran"e theorem$ 8in"s, fields, - finite fields ;$ EVALUATION SCHEME% 'omponent Duration Test I 60 mins$ Test II 60 mins$ ?ui@/&ssi"nment 'omprehensi#e ; hours =ei"hta"e (>! <0 <0 <0 50 Date - Time 07/0; (1 10/0< (1 T3& 07/06 :A 8emar)s '3 93 '3 Partl/ 9pen 8ef$ 'h$ 1 'h$1 art$ 6-7 'h$1 art$ 5-10 'h$; art$2-< 'h$; art$6 'h$; art$ 7 'h$ < art$ 1-6 'h$6 art$ 1 'h$6 art$ 2 'h$6 art$ 7-10 'h$ 7, 81: 'h$ 12 81: 'h$ 11 2-7 7-11 12-16 17-17 15 -14 20-26 27 27-;0 ;1-;6 ;7-;5 ;4- <2 L#*' !# : 1

<$ CHAMBER CONSULTATION HOUR% To e announced in class =$ MA4E-UP Po(&*>% Prior permission needed for ma)e-up$ 9$ NOTICES% &ll notices related to the course 0ill e put up on the IP' - %&TH( "roup A3s$

I)"'! *'o!?&)-*+,!-# MATH C222