B.E. II YEAR (4YDC) COMPUTER ENGINEERING CO 2453: DISCRETE STRUCTURES Theory: 1.

Set Theory: Operations; Principle of Inclusion-Exclusion; Computer Representation of sets. o!ic Theory: Prepositional o!ic. an!ua!es an" #rammars; Types of #rammars; $inite state machines. %. Countin! Techni&ues an" Com'inatorics; Relations an" $unctions: (pplication to R)*+S an" ,ashin!; Properties of Relations- Pi!eonhole Principle. .. #raphs an" Trees: Shortest path al!orithms; Cutsets; ,amiltonian an" Eulerian paths an" circuits; Tree Tra/ersals; Spannin! Trees. 0. Recurrence relations an" #eneratin! functions; Intro"uction to Complexity of Pro'lems an" (l!orithms. 1. (l!e'raic systems: #roups- Rin!s- $iel"s- attices- *oolean al!e'ra. Tex Boo!" 1. iu C. .- 2Intro"uction to )iscrete +athematics3- +c#ra4-,ill- 1567. %. Colman- *us'y- Ross an" Rehman- 2)iscrete +athematical Structures3Pearson E"ucation-%887. Re#ere$%e Boo!" 1. Trem'ley an" C. +anohar- 2Intro"uction to )iscrete Structures for Computer Science3- +c#ra4-,ill- 1595. %. :arsin! )eo- 2#raph Theory 4ith (pplications to En!ineerin! an" Computer Science3- Prentice ,all Series in (utomatic Computation- Prentice-,all- Inc.;S(- 1590.