BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE,
PILANIWORK-INTEGRATED LEARNING PROGRAMMES DIVISIONBITS-WIPRO
Collabora!"# Pro$ra%%#& MS !' So()ar# E'$!'##r!'$I
SEMESTERCOURSE HANDOUT Co*r+# No, &SEWP -C./.Co*r+# T!l#&
DISCRETE STRUCTURES FOR COMPUTER SCIENCE Co*r+#
D#+0r!1!o'Introduction to discrete mathematical structures; Formal
logic and predicate calculus; Sets, relations andfunctions; Proof
techniques; Graphs and trees; Primes, factorization, greatest
common divisor, residuesand application to cryptology; Boolean
algebra; Permutations, combinations and partitions;
ecurrencerelations and generating functions; Introduction to
error!correcting codes; Formal languages andgrammars, finite state
machines" T#2boo3#$" %olman, Busby, oss andehman,
&iscrete'athematical Structures for (omputer Science,Pearson
)ducation, *th )dition, +,,-"R#(#r#'0# Boo3+$"
&"S"'ali.and'"%"Sen,&iscrete'athematical Structures/#heory
and 0pplications, #homson,+,,1" +" Goodaire 2 Parmenter /
&iscrete 'athematics 2 Graph #heory, Pearson )ducation, +,,,"-"
%enneth 3" osen, &iscrete 'athematics and its 0pplications,
#ata 'cGra4 3ill, *th )d", +,,1" 1" ("5" 5iu, )lements of
&iscrete 'athematics, +nd )dition, 'cGra4 3ill, $678" L#0*r#
Pla'W##3 No, To1!0+ R#(#r#'0# o T#2 Boo3 $ Sets, 9perations on
sets, Sequences, 'atrices#$!(h"$ + Propositions, (onditional
statements, Induction#$!(h"+- Pigeonhole Principle, ecurrence
elations#$!(h" -"-, -"* 1 elations and &igraphs, Paths in
elations, )quivalence elations #$!(h" 1"+ ! 1"* * 9perations on
elations, #ransitive closure#$!(h" 1": ; 1"78 Functions, Function
for (omputer Science Permutation functions#$!(h" *"$,*"+,*"1:
Partially ordered sets, 5attices, Boolean 0lgebras#$!(h"8"$, 8"-,
8"17 evie4 and Problem SolvingS4llab*+ (or M!5-S#%#+#r T#+&
To1!0+ 0o"#r#5 !' 6# (!r+ #!$6 )##3+6 Graphs, )uler Paths, 3amilton
Paths #$!(h 7"$ ; 7"-$, #rees, 5abeled #rees#$!(h":"$, :"+$$ #ree
Searching,
